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-167863536300420.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-208, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 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.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 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 49K 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-208-LTLFireability-00
FORMULA_NAME Parking-PT-208-LTLFireability-01
FORMULA_NAME Parking-PT-208-LTLFireability-02
FORMULA_NAME Parking-PT-208-LTLFireability-03
FORMULA_NAME Parking-PT-208-LTLFireability-04
FORMULA_NAME Parking-PT-208-LTLFireability-05
FORMULA_NAME Parking-PT-208-LTLFireability-06
FORMULA_NAME Parking-PT-208-LTLFireability-07
FORMULA_NAME Parking-PT-208-LTLFireability-08
FORMULA_NAME Parking-PT-208-LTLFireability-09
FORMULA_NAME Parking-PT-208-LTLFireability-10
FORMULA_NAME Parking-PT-208-LTLFireability-11
FORMULA_NAME Parking-PT-208-LTLFireability-12
FORMULA_NAME Parking-PT-208-LTLFireability-13
FORMULA_NAME Parking-PT-208-LTLFireability-14
FORMULA_NAME Parking-PT-208-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678920828792

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-208
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 22:53:52] [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:53:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:53:52] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-15 22:53:52] [INFO ] Transformed 137 places.
[2023-03-15 22:53:52] [INFO ] Transformed 201 transitions.
[2023-03-15 22:53:52] [INFO ] Found NUPN structural information;
[2023-03-15 22:53:52] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-208-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Applied a total of 2 rules in 31 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2023-03-15 22:53:52] [INFO ] Computed 34 place invariants in 15 ms
[2023-03-15 22:53:52] [INFO ] Implicit Places using invariants in 385 ms returned [28, 36, 52, 64, 94, 102, 118, 130]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 431 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/137 places, 116/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 112
Applied a total of 8 rules in 20 ms. Remains 124 /128 variables (removed 4) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 124 cols
[2023-03-15 22:53:53] [INFO ] Computed 26 place invariants in 6 ms
[2023-03-15 22:53:53] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-15 22:53:53] [INFO ] Invariant cache hit.
[2023-03-15 22:53:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:53] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/137 places, 112/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1000 ms. Remains : 124/137 places, 112/117 transitions.
Support contains 36 out of 124 places after structural reductions.
[2023-03-15 22:53:53] [INFO ] Flatten gal took : 69 ms
[2023-03-15 22:53:53] [INFO ] Flatten gal took : 28 ms
[2023-03-15 22:53:54] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 34 out of 124 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 292 resets, run finished after 1061 ms. (steps per millisecond=9 ) properties (out of 25) seen :19
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 22:53:55] [INFO ] Invariant cache hit.
[2023-03-15 22:53:55] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-15 22:53:55] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-15 22:53:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:55] [INFO ] After 20ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 22:53:55] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 22:53:55] [INFO ] [Nat]Absence check using 26 positive place invariants in 13 ms returned sat
[2023-03-15 22:53:56] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 22:53:56] [INFO ] After 95ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 22:53:56] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-15 22:53:56] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 37 ms.
Support contains 9 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 115 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 115 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 109 transition count 97
Free-agglomeration rule applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 47 place count 109 transition count 80
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 64 place count 92 transition count 80
Applied a total of 64 rules in 60 ms. Remains 92 /124 variables (removed 32) and now considering 80/112 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 92/124 places, 80/112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Finished probabilistic random walk after 3501 steps, run visited all 4 properties in 42 ms. (steps per millisecond=83 )
Probabilistic random walk after 3501 steps, saw 1224 distinct states, run finished after 42 ms. (steps per millisecond=83 ) properties seen :4
FORMULA Parking-PT-208-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-208-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(p0)))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 120 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 120 transition count 105
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 12 place count 117 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 114 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 108 transition count 96
Applied a total of 30 rules in 30 ms. Remains 108 /124 variables (removed 16) and now considering 96/112 (removed 16) transitions.
// Phase 1: matrix 96 rows 108 cols
[2023-03-15 22:53:57] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-15 22:53:57] [INFO ] Implicit Places using invariants in 162 ms returned [38, 54, 89, 105]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 164 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/124 places, 96/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 100 transition count 92
Applied a total of 8 rules in 16 ms. Remains 100 /104 variables (removed 4) and now considering 92/96 (removed 4) transitions.
// Phase 1: matrix 92 rows 100 cols
[2023-03-15 22:53:57] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:53:57] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-15 22:53:57] [INFO ] Invariant cache hit.
[2023-03-15 22:53:58] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/124 places, 92/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 535 ms. Remains : 100/124 places, 92/112 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-00 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:(EQ s32 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 29 steps with 0 reset in 2 ms.
FORMULA Parking-PT-208-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-00 finished in 924 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)&&F(G(p1)))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 114 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 108 transition count 96
Applied a total of 32 rules in 19 ms. Remains 108 /124 variables (removed 16) and now considering 96/112 (removed 16) transitions.
// Phase 1: matrix 96 rows 108 cols
[2023-03-15 22:53:58] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-15 22:53:58] [INFO ] Implicit Places using invariants in 90 ms returned [37, 89, 105]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 93 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/124 places, 96/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 102 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 101 transition count 112
Applied a total of 8 rules in 15 ms. Remains 101 /105 variables (removed 4) and now considering 112/96 (removed -16) transitions.
// Phase 1: matrix 112 rows 101 cols
[2023-03-15 22:53:58] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-15 22:53:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-15 22:53:58] [INFO ] Invariant cache hit.
[2023-03-15 22:53:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 22:53:58] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/124 places, 112/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 386 ms. Remains : 101/124 places, 112/112 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s56 1), p1:(AND (EQ s40 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 39 steps with 1 reset in 2 ms.
FORMULA Parking-PT-208-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-01 finished in 587 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((p0||G(p1)))||X(G(p2))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 7 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-15 22:53:59] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-15 22:53:59] [INFO ] Implicit Places using invariants in 127 ms returned [41, 59, 117]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 131 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 109/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 108
Applied a total of 2 rules in 6 ms. Remains 117 /118 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 117 cols
[2023-03-15 22:53:59] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-15 22:53:59] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-15 22:53:59] [INFO ] Invariant cache hit.
[2023-03-15 22:53:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:53:59] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/124 places, 108/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 117/124 places, 108/112 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : Parking-PT-208-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s96 1) (EQ s113 1)), p1:(EQ s63 1), p2:(EQ s63 0)], 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-04 finished in 891 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)&&F(G(p1)))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 109
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 121 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 120 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 120 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 117 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 115 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 115 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 109 transition count 97
Applied a total of 30 rules in 35 ms. Remains 109 /124 variables (removed 15) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 109 cols
[2023-03-15 22:53:59] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-15 22:54:00] [INFO ] Implicit Places using invariants in 157 ms returned [37, 53, 89, 106]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 159 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/124 places, 97/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 10 place count 100 transition count 112
Applied a total of 10 rules in 19 ms. Remains 100 /105 variables (removed 5) and now considering 112/97 (removed -15) transitions.
// Phase 1: matrix 112 rows 100 cols
[2023-03-15 22:54:00] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:54:00] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-15 22:54:00] [INFO ] Invariant cache hit.
[2023-03-15 22:54:00] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-15 22:54:00] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/124 places, 112/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 622 ms. Remains : 100/124 places, 112/112 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s49 1) (EQ s16 1) (EQ s42 1)), p1:(EQ s84 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA Parking-PT-208-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-05 finished in 808 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&&F(p1)))))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 4 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-15 22:54:00] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-15 22:54:00] [INFO ] Implicit Places using invariants in 177 ms returned [41, 59, 99, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 179 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 4 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-15 22:54:00] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:54:01] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-15 22:54:01] [INFO ] Invariant cache hit.
[2023-03-15 22:54:01] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:54:01] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 572 ms. Remains : 115/124 places, 107/112 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s30 0), p1:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 3 ms.
FORMULA Parking-PT-208-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-07 finished in 781 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(F(p0)))&&F(p1)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 5 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-15 22:54:01] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-15 22:54:01] [INFO ] Implicit Places using invariants in 161 ms returned [41, 59, 99, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 163 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 11 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-15 22:54:01] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:54:01] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-15 22:54:01] [INFO ] Invariant cache hit.
[2023-03-15 22:54:01] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:54:02] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 115/124 places, 107/112 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s91 1), p0:(EQ s69 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-08 finished in 861 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((F(G(p0))||G(!p0)))))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 4 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-15 22:54:02] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-15 22:54:02] [INFO ] Implicit Places using invariants in 156 ms returned [41, 59, 99, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 158 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 3 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-15 22:54:02] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:54:02] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-15 22:54:02] [INFO ] Invariant cache hit.
[2023-03-15 22:54:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:54:02] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 565 ms. Remains : 115/124 places, 107/112 transitions.
Stuttering acceptance computed with spot in 196 ms :[false, (NOT p0), false, false]
Running random walk in product with property : Parking-PT-208-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2906 reset in 547 ms.
Product exploration explored 100000 steps with 2903 reset in 530 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 1186 steps, including 33 resets, run visited all 1 properties in 6 ms. (steps per millisecond=197 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 114 transition count 103
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 111 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 110 transition count 102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 110 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 107 transition count 99
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 30 place count 99 transition count 91
Applied a total of 30 rules in 19 ms. Remains 99 /115 variables (removed 16) and now considering 91/107 (removed 16) transitions.
// Phase 1: matrix 91 rows 99 cols
[2023-03-15 22:54:04] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:54:04] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-15 22:54:04] [INFO ] Invariant cache hit.
[2023-03-15 22:54:04] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-15 22:54:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 22:54:04] [INFO ] Invariant cache hit.
[2023-03-15 22:54:05] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/115 places, 91/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 99/115 places, 91/107 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 620 steps, including 18 resets, run visited all 1 properties in 3 ms. (steps per millisecond=206 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3066 reset in 299 ms.
Product exploration explored 100000 steps with 3080 reset in 526 ms.
Built C files in :
/tmp/ltsmin10367884773590443074
[2023-03-15 22:54:06] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2023-03-15 22:54:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:54:06] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2023-03-15 22:54:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:54:06] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2023-03-15 22:54:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:54:06] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10367884773590443074
Running compilation step : cd /tmp/ltsmin10367884773590443074;'/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 403 ms.
Running link step : cd /tmp/ltsmin10367884773590443074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10367884773590443074;'/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/stateBased10546763556766787554.hoa' '--buchi-type=spotba'
LTSmin run took 2103 ms.
FORMULA Parking-PT-208-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLFireability-11 finished in 6688 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(F(p0))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 4 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-15 22:54:09] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-15 22:54:09] [INFO ] Implicit Places using invariants in 88 ms returned [59, 99, 117]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 109/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 108
Applied a total of 2 rules in 2 ms. Remains 117 /118 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 117 cols
[2023-03-15 22:54:09] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-15 22:54:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-15 22:54:09] [INFO ] Invariant cache hit.
[2023-03-15 22:54:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:54:09] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/124 places, 108/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 317 ms. Remains : 117/124 places, 108/112 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (EQ s77 1) (EQ s107 1)) (AND (EQ s41 1) (EQ s58 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 43 steps with 2 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-12 finished in 441 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 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Applied a total of 6 rules in 3 ms. Remains 121 /124 variables (removed 3) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-15 22:54:09] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-15 22:54:09] [INFO ] Implicit Places using invariants in 99 ms returned [41, 59, 99, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 100 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 2 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-15 22:54:09] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-15 22:54:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-15 22:54:09] [INFO ] Invariant cache hit.
[2023-03-15 22:54:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:54:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 115/124 places, 107/112 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-13 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:(AND (EQ s2 1) (EQ s46 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-208-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-13 finished in 458 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' '!(((!p0 U (p1||G(!p0))) U G(p2)))'
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 106
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 12 place count 118 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 115 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 115 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 109 transition count 97
Applied a total of 30 rules in 24 ms. Remains 109 /124 variables (removed 15) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 109 cols
[2023-03-15 22:54:10] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-15 22:54:10] [INFO ] Implicit Places using invariants in 126 ms returned [37, 55, 90, 106]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 127 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/124 places, 97/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 10 place count 100 transition count 112
Applied a total of 10 rules in 14 ms. Remains 100 /105 variables (removed 5) and now considering 112/97 (removed -15) transitions.
// Phase 1: matrix 112 rows 100 cols
[2023-03-15 22:54:10] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:54:10] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-15 22:54:10] [INFO ] Invariant cache hit.
[2023-03-15 22:54:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 22:54:10] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/124 places, 112/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 522 ms. Remains : 100/124 places, 112/112 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), true, (NOT p2), (AND p2 (NOT p1) p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (NEQ s64 1) (NOT (AND (EQ s67 1) (EQ s86 1)))), p1:(AND (NEQ s37 1) (NOT (AND (EQ s77 1) (EQ s98 1)))), p0:(AND (EQ s77 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3058 reset in 579 ms.
Product exploration explored 100000 steps with 3057 reset in 420 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p2), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 722 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), true, (NOT p2), (AND p0 p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 306 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 22:54:12] [INFO ] Invariant cache hit.
[2023-03-15 22:54:12] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-15 22:54:12] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 22:54:12] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-15 22:54:12] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 22:54:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 22:54:12] [INFO ] After 17ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 22:54:12] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-15 22:54:12] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 112/112 transitions.
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 100 transition count 91
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 42 place count 79 transition count 91
Applied a total of 42 rules in 9 ms. Remains 79 /100 variables (removed 21) and now considering 91/112 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 79/100 places, 91/112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 218 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=218 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p2), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p2)), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))]
Knowledge based reduction with 17 factoid took 844 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 112/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-15 22:54:14] [INFO ] Invariant cache hit.
[2023-03-15 22:54:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-15 22:54:14] [INFO ] Invariant cache hit.
[2023-03-15 22:54:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 22:54:14] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-15 22:54:14] [INFO ] Invariant cache hit.
[2023-03-15 22:54:14] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 100/100 places, 112/112 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p2), (X (NOT (AND p0 (NOT p1)))), true, (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 764 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 305 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:54:15] [INFO ] Invariant cache hit.
[2023-03-15 22:54:15] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-15 22:54:15] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:54:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-15 22:54:15] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:54:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 22:54:15] [INFO ] After 29ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:54:15] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-15 22:54:15] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 112/112 transitions.
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 100 transition count 91
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 42 place count 79 transition count 91
Applied a total of 42 rules in 15 ms. Remains 79 /100 variables (removed 21) and now considering 91/112 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 79/100 places, 91/112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 327 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=327 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p2), (X (NOT (AND p0 (NOT p1)))), true, (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND p2 p1)))), (F (AND p0 (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 957 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3058 reset in 374 ms.
Product exploration explored 100000 steps with 3056 reset in 411 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), true, (NOT p2), (AND p0 (NOT p1))]
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 112/112 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-15 22:54:18] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 22:54:18] [INFO ] Invariant cache hit.
[2023-03-15 22:54:18] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 100/100 places, 112/112 transitions.
Built C files in :
/tmp/ltsmin8809032343140294083
[2023-03-15 22:54:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8809032343140294083
Running compilation step : cd /tmp/ltsmin8809032343140294083;'/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 454 ms.
Running link step : cd /tmp/ltsmin8809032343140294083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8809032343140294083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16341127281906132328.hoa' '--buchi-type=spotba'
LTSmin run took 10711 ms.
FORMULA Parking-PT-208-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLFireability-14 finished in 20105 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 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 113 transition count 101
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 107 transition count 95
Applied a total of 34 rules in 13 ms. Remains 107 /124 variables (removed 17) and now considering 95/112 (removed 17) transitions.
// Phase 1: matrix 95 rows 107 cols
[2023-03-15 22:54:30] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-15 22:54:30] [INFO ] Implicit Places using invariants in 96 ms returned [37, 53, 88, 104]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 97 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/124 places, 95/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 98 transition count 110
Applied a total of 10 rules in 9 ms. Remains 98 /103 variables (removed 5) and now considering 110/95 (removed -15) transitions.
// Phase 1: matrix 110 rows 98 cols
[2023-03-15 22:54:30] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-15 22:54:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-15 22:54:30] [INFO ] Invariant cache hit.
[2023-03-15 22:54:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 22:54:30] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/124 places, 110/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 371 ms. Remains : 98/124 places, 110/112 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s42 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 31 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-15 finished in 450 ms.
All properties solved by simple procedures.
Total runtime 38394 ms.

BK_STOP 1678920871684

--------------------
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-208"
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-208, 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-167863536300420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 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 ;