Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536300412.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Parking-PT-104, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 23K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-104-LTLFireability-00
FORMULA_NAME Parking-PT-104-LTLFireability-01
FORMULA_NAME Parking-PT-104-LTLFireability-02
FORMULA_NAME Parking-PT-104-LTLFireability-03
FORMULA_NAME Parking-PT-104-LTLFireability-04
FORMULA_NAME Parking-PT-104-LTLFireability-05
FORMULA_NAME Parking-PT-104-LTLFireability-06
FORMULA_NAME Parking-PT-104-LTLFireability-07
FORMULA_NAME Parking-PT-104-LTLFireability-08
FORMULA_NAME Parking-PT-104-LTLFireability-09
FORMULA_NAME Parking-PT-104-LTLFireability-10
FORMULA_NAME Parking-PT-104-LTLFireability-11
FORMULA_NAME Parking-PT-104-LTLFireability-12
FORMULA_NAME Parking-PT-104-LTLFireability-13
FORMULA_NAME Parking-PT-104-LTLFireability-14
FORMULA_NAME Parking-PT-104-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678920562121

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-104
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 22:49:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:49:25] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-15 22:49:25] [INFO ] Transformed 65 places.
[2023-03-15 22:49:25] [INFO ] Transformed 97 transitions.
[2023-03-15 22:49:25] [INFO ] Found NUPN structural information;
[2023-03-15 22:49:25] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
FORMULA Parking-PT-104-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 16 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2023-03-15 22:49:25] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-15 22:49:25] [INFO ] Implicit Places using invariants in 312 ms returned [32, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 356 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 378 ms. Remains : 63/65 places, 56/56 transitions.
Support contains 32 out of 63 places after structural reductions.
[2023-03-15 22:49:26] [INFO ] Flatten gal took : 60 ms
[2023-03-15 22:49:26] [INFO ] Flatten gal took : 22 ms
[2023-03-15 22:49:26] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 29 out of 63 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 596 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 56 rows 63 cols
[2023-03-15 22:49:27] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:49:27] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 22:49:27] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2023-03-15 22:49:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:27] [INFO ] After 11ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :2 sat :1
[2023-03-15 22:49:27] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-15 22:49:27] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 2 ms.
FORMULA Parking-PT-104-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-104-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 61 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 59 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 57 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 57 transition count 50
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 54 transition count 47
Applied a total of 18 rules in 37 ms. Remains 54 /63 variables (removed 9) and now considering 47/56 (removed 9) transitions.
// Phase 1: matrix 47 rows 54 cols
[2023-03-15 22:49:28] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 22:49:28] [INFO ] Implicit Places using invariants in 115 ms returned [23, 35, 49, 51]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 117 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/63 places, 47/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 47 transition count 44
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 47 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 46 transition count 43
Applied a total of 8 rules in 8 ms. Remains 46 /50 variables (removed 4) and now considering 43/47 (removed 4) transitions.
// Phase 1: matrix 43 rows 46 cols
[2023-03-15 22:49:28] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 22:49:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-15 22:49:28] [INFO ] Invariant cache hit.
[2023-03-15 22:49:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 22:49:28] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/63 places, 43/56 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 46/63 places, 43/56 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-104-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s4 1), p0:(OR (NEQ s15 1) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6196 reset in 591 ms.
Product exploration explored 100000 steps with 6208 reset in 396 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 370 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 150 steps, including 9 resets, run visited all 2 properties in 3 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 377 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 43/43 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-15 22:49:30] [INFO ] Invariant cache hit.
[2023-03-15 22:49:31] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-15 22:49:31] [INFO ] Invariant cache hit.
[2023-03-15 22:49:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 22:49:31] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-15 22:49:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 22:49:31] [INFO ] Invariant cache hit.
[2023-03-15 22:49:31] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 46/46 places, 43/43 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 39 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 351 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6203 reset in 277 ms.
Product exploration explored 100000 steps with 6189 reset in 570 ms.
Built C files in :
/tmp/ltsmin8437324787982680738
[2023-03-15 22:49:33] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2023-03-15 22:49:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:33] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2023-03-15 22:49:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:33] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2023-03-15 22:49:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:33] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8437324787982680738
Running compilation step : cd /tmp/ltsmin8437324787982680738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 464 ms.
Running link step : cd /tmp/ltsmin8437324787982680738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin8437324787982680738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9007717365972538962.hoa' '--buchi-type=spotba'
LTSmin run took 491 ms.
FORMULA Parking-PT-104-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLFireability-00 finished in 6343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1)||F(p2)))'
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 62 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 59 transition count 52
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 59 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 56 transition count 49
Applied a total of 14 rules in 22 ms. Remains 56 /63 variables (removed 7) and now considering 49/56 (removed 7) transitions.
// Phase 1: matrix 49 rows 56 cols
[2023-03-15 22:49:34] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 22:49:34] [INFO ] Implicit Places using invariants in 110 ms returned [23, 51, 53]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 113 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/63 places, 49/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 47
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 47
Applied a total of 4 rules in 11 ms. Remains 51 /53 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 51 cols
[2023-03-15 22:49:34] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-15 22:49:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-15 22:49:34] [INFO ] Invariant cache hit.
[2023-03-15 22:49:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 22:49:34] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/63 places, 47/56 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 362 ms. Remains : 51/63 places, 47/56 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Parking-PT-104-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s36 1), p2:(AND (EQ s26 1) (EQ s49 1)), p0:(AND (EQ s33 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-01 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 60 transition count 53
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 60 transition count 51
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 58 transition count 51
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 56 transition count 49
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 56 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 53 transition count 46
Applied a total of 18 rules in 22 ms. Remains 53 /63 variables (removed 10) and now considering 46/56 (removed 10) transitions.
// Phase 1: matrix 46 rows 53 cols
[2023-03-15 22:49:34] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 22:49:35] [INFO ] Implicit Places using invariants in 106 ms returned [22, 34, 48, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/63 places, 46/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 46 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 46 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 45 transition count 42
Applied a total of 8 rules in 12 ms. Remains 45 /49 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 45 cols
[2023-03-15 22:49:35] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 22:49:35] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-15 22:49:35] [INFO ] Invariant cache hit.
[2023-03-15 22:49:35] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/63 places, 42/56 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 334 ms. Remains : 45/63 places, 42/56 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-03 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&X(X(!p1)))) U (G(p2) U p3)))'
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 7 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 61 cols
[2023-03-15 22:49:35] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:49:35] [INFO ] Implicit Places using invariants in 103 ms returned [24, 39, 55, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 105 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 54/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 51
Applied a total of 6 rules in 6 ms. Remains 54 /57 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 54 cols
[2023-03-15 22:49:35] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 22:49:35] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-15 22:49:35] [INFO ] Invariant cache hit.
[2023-03-15 22:49:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/63 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 54/63 places, 51/56 transitions.
Stuttering acceptance computed with spot in 622 ms :[(NOT p3), (NOT p0), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p3) p2 p1), p1, true, (AND (NOT p2) p1), (AND (NOT p3) p2 p1), (NOT p2), (NOT p3)]
Running random walk in product with property : Parking-PT-104-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 8}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p3) p2 p1), acceptance={} source=8 dest: 10}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(AND (EQ s40 1) (EQ s53 1)), p2:(AND (EQ s10 1) (EQ s30 1)), p0:(EQ s12 1), p1:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 5 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-05 finished in 990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 61 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 60 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 58 transition count 51
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 58 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 55 transition count 48
Applied a total of 14 rules in 21 ms. Remains 55 /63 variables (removed 8) and now considering 48/56 (removed 8) transitions.
// Phase 1: matrix 48 rows 55 cols
[2023-03-15 22:49:36] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 22:49:36] [INFO ] Implicit Places using invariants in 89 ms returned [22, 34, 50, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/63 places, 48/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 48 transition count 45
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 47 transition count 44
Applied a total of 8 rules in 12 ms. Remains 47 /51 variables (removed 4) and now considering 44/48 (removed 4) transitions.
// Phase 1: matrix 44 rows 47 cols
[2023-03-15 22:49:36] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 22:49:36] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-15 22:49:36] [INFO ] Invariant cache hit.
[2023-03-15 22:49:36] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/63 places, 44/56 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 47/63 places, 44/56 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-06 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||((p0 U (p1||G(p0)))&&(p2||F(p3))))))))'
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 5 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 61 cols
[2023-03-15 22:49:36] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 22:49:36] [INFO ] Implicit Places using invariants in 100 ms returned [24, 39, 57]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 102 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/63 places, 54/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 56 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Applied a total of 4 rules in 4 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2023-03-15 22:49:36] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 22:49:36] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-15 22:49:36] [INFO ] Invariant cache hit.
[2023-03-15 22:49:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:37] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/63 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 323 ms. Remains : 56/63 places, 52/56 transitions.
Stuttering acceptance computed with spot in 459 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : Parking-PT-104-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=7 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=7 dest: 7}]], initial=3, aps=[p3:(AND (EQ s51 1) (EQ s52 1)), p1:(AND (EQ s39 1) (NEQ s2 1)), p0:(NEQ s2 1), p2:(NEQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-10 finished in 822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 3 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 61 cols
[2023-03-15 22:49:37] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:49:37] [INFO ] Implicit Places using invariants in 97 ms returned [24, 39, 55, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 99 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 54/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 51
Applied a total of 6 rules in 3 ms. Remains 54 /57 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 54 cols
[2023-03-15 22:49:37] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-15 22:49:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-15 22:49:37] [INFO ] Invariant cache hit.
[2023-03-15 22:49:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:37] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/63 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 280 ms. Remains : 54/63 places, 51/56 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-11 finished in 415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 3 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 61 cols
[2023-03-15 22:49:38] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-15 22:49:38] [INFO ] Implicit Places using invariants in 75 ms returned [24, 39, 55, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 91 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 54/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 51
Applied a total of 6 rules in 2 ms. Remains 54 /57 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 54 cols
[2023-03-15 22:49:38] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-15 22:49:38] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-15 22:49:38] [INFO ] Invariant cache hit.
[2023-03-15 22:49:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:38] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/63 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 624 ms. Remains : 54/63 places, 51/56 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s32 1), p0:(AND (EQ s7 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-13 finished in 755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p1)))&&p0)))'
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 3 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 61 cols
[2023-03-15 22:49:38] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 22:49:38] [INFO ] Implicit Places using invariants in 91 ms returned [24, 39, 55, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 98 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 54/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 51
Applied a total of 6 rules in 2 ms. Remains 54 /57 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 54 cols
[2023-03-15 22:49:38] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-15 22:49:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-15 22:49:38] [INFO ] Invariant cache hit.
[2023-03-15 22:49:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:39] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/63 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 54/63 places, 51/56 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-104-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 6}, { cond=p0, acceptance={0} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p0:(AND (EQ s0 0) (OR (EQ s11 0) (EQ s35 0))), p1:(OR (AND (EQ s31 1) (EQ s53 1)) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-14 finished in 685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))||(!p2 U (G(!p2)||(!p2&&(!p3 U (G(!p3)||(!p3&&G(!p2)))))))||p0))))'
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 54
Applied a total of 4 rules in 2 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 61 cols
[2023-03-15 22:49:39] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 22:49:39] [INFO ] Implicit Places using invariants in 59 ms returned [39, 55, 57]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/63 places, 54/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 56 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Applied a total of 4 rules in 2 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2023-03-15 22:49:39] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 22:49:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-15 22:49:39] [INFO ] Invariant cache hit.
[2023-03-15 22:49:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/63 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 56/63 places, 52/56 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2 p3 (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : Parking-PT-104-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s19 0)), p2:(AND (EQ s2 1) (EQ s19 1)), p3:(AND (EQ s24 1) (EQ s52 1)), p1:(EQ s4 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))
Knowledge based reduction with 8 factoid took 167 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-104-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-104-LTLFireability-15 finished in 1134 ms.
All properties solved by simple procedures.
Total runtime 15731 ms.

BK_STOP 1678920581623

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-104"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Parking-PT-104, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536300412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-104.tgz
mv Parking-PT-104 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;