Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654421800038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r285-smll-171654421800038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 16:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 16:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 23K May 18 16:43 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 1716841305671

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=gold2023
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 202304061127
[2024-05-27 20:21:48] [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]
[2024-05-27 20:21:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:21:48] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-27 20:21:48] [INFO ] Transformed 65 places.
[2024-05-27 20:21:48] [INFO ] Transformed 97 transitions.
[2024-05-27 20:21:48] [INFO ] Found NUPN structural information;
[2024-05-27 20:21:48] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
FORMULA Parking-PT-104-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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
[2024-05-27 20:21:48] [INFO ] Computed 16 invariants in 7 ms
[2024-05-27 20:21:48] [INFO ] Implicit Places using invariants in 256 ms returned [24, 32, 40, 48, 58]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 296 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 58 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 54
Applied a total of 4 rules in 5 ms. Remains 58 /60 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 58 cols
[2024-05-27 20:21:48] [INFO ] Computed 11 invariants in 3 ms
[2024-05-27 20:21:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 20:21:48] [INFO ] Invariant cache hit.
[2024-05-27 20:21:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:21:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/65 places, 54/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 512 ms. Remains : 58/65 places, 54/56 transitions.
Support contains 24 out of 58 places after structural reductions.
[2024-05-27 20:21:49] [INFO ] Flatten gal took : 33 ms
[2024-05-27 20:21:49] [INFO ] Flatten gal took : 14 ms
[2024-05-27 20:21:49] [INFO ] Input system was already deterministic with 54 transitions.
Incomplete random walk after 10000 steps, including 595 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2024-05-27 20:21:50] [INFO ] Invariant cache hit.
[2024-05-27 20:21:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 20:21:50] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-27 20:21:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-27 20:21:50] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-27 20:21:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:21:50] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-27 20:21:50] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-27 20:21:50] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 4 ms.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
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 56 transition count 50
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 54 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 52 transition count 48
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 52 transition count 48
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 49 transition count 45
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 27 place count 49 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 36 place count 40 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 39 transition count 35
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 25 rules applied. Total rules applied 62 place count 30 transition count 19
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 22 rules applied. Total rules applied 84 place count 14 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 88 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 88 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 8 transition count 11
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 95 place count 5 transition count 8
Iterating global reduction 6 with 3 rules applied. Total rules applied 98 place count 5 transition count 8
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 101 place count 5 transition count 5
Applied a total of 101 rules in 26 ms. Remains 5 /58 variables (removed 53) and now considering 5/54 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 5/58 places, 5/54 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||F(p1))) U (p2&&X((p0||F(p1)))))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 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
[2024-05-27 20:21:50] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:21:51] [INFO ] Implicit Places using invariants in 68 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/58 places, 52/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 55/58 places, 52/54 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-104-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s6 1), p0:(EQ s51 1), p1:(EQ s32 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 13 steps with 0 reset in 2 ms.
FORMULA Parking-PT-104-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-00 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 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 57 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 52
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 56 transition count 51
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 55 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 52 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 52 transition count 48
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 16 place count 49 transition count 45
Applied a total of 16 rules in 13 ms. Remains 49 /58 variables (removed 9) and now considering 45/54 (removed 9) transitions.
// Phase 1: matrix 45 rows 49 cols
[2024-05-27 20:21:51] [INFO ] Computed 11 invariants in 2 ms
[2024-05-27 20:21:51] [INFO ] Implicit Places using invariants in 79 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/58 places, 45/54 transitions.
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 2 place count 47 transition count 44
Applied a total of 2 rules in 6 ms. Remains 47 /48 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 47 cols
[2024-05-27 20:21:51] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 20:21:51] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-27 20:21:51] [INFO ] Invariant cache hit.
[2024-05-27 20:21:51] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/58 places, 44/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 229 ms. Remains : 47/58 places, 44/54 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-02 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-02 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(!p0)))&&F(p1)))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 53
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 57 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 56 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 56 transition count 51
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 55 transition count 51
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 52 transition count 48
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 52 transition count 48
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 3 with 6 rules applied. Total rules applied 18 place count 49 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 48 transition count 48
Applied a total of 20 rules in 17 ms. Remains 48 /58 variables (removed 10) and now considering 48/54 (removed 6) transitions.
// Phase 1: matrix 48 rows 48 cols
[2024-05-27 20:21:51] [INFO ] Computed 11 invariants in 0 ms
[2024-05-27 20:21:51] [INFO ] Implicit Places using invariants in 54 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/58 places, 48/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 46 transition count 63
Applied a total of 2 rules in 7 ms. Remains 46 /47 variables (removed 1) and now considering 63/48 (removed -15) transitions.
// Phase 1: matrix 63 rows 46 cols
[2024-05-27 20:21:51] [INFO ] Computed 10 invariants in 2 ms
[2024-05-27 20:21:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-27 20:21:51] [INFO ] Invariant cache hit.
[2024-05-27 20:21:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-27 20:21:51] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 63/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 46/58 places, 63/54 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, true, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p0:(EQ s29 1), p1:(AND (EQ s10 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-03 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
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 56 transition count 50
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
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 2 with 2 rules applied. Total rules applied 16 place count 50 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 18 place count 49 transition count 49
Applied a total of 18 rules in 14 ms. Remains 49 /58 variables (removed 9) and now considering 49/54 (removed 5) transitions.
// Phase 1: matrix 49 rows 49 cols
[2024-05-27 20:21:52] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:21:52] [INFO ] Implicit Places using invariants in 69 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/58 places, 49/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 47 transition count 64
Applied a total of 2 rules in 7 ms. Remains 47 /48 variables (removed 1) and now considering 64/49 (removed -15) transitions.
// Phase 1: matrix 64 rows 47 cols
[2024-05-27 20:21:52] [INFO ] Computed 10 invariants in 0 ms
[2024-05-27 20:21:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-27 20:21:52] [INFO ] Invariant cache hit.
[2024-05-27 20:21:52] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-27 20:21:52] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/58 places, 64/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 47/58 places, 64/54 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s46 1)), p1:(EQ s24 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 16 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-04 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
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 56 transition count 50
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 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
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 2 with 4 rules applied. Total rules applied 18 place count 49 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 48
Applied a total of 20 rules in 14 ms. Remains 48 /58 variables (removed 10) and now considering 48/54 (removed 6) transitions.
// Phase 1: matrix 48 rows 48 cols
[2024-05-27 20:21:52] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:21:52] [INFO ] Implicit Places using invariants in 54 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/58 places, 48/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 46 transition count 63
Applied a total of 2 rules in 12 ms. Remains 46 /47 variables (removed 1) and now considering 63/48 (removed -15) transitions.
// Phase 1: matrix 63 rows 46 cols
[2024-05-27 20:21:52] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 20:21:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-27 20:21:52] [INFO ] Invariant cache hit.
[2024-05-27 20:21:52] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-27 20:21:52] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 63/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 46/58 places, 63/54 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLFireability-05 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 s19 1) (EQ s45 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 14 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-05 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 3 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2024-05-27 20:21:52] [INFO ] Computed 11 invariants in 0 ms
[2024-05-27 20:21:52] [INFO ] Implicit Places using invariants in 47 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s12 1), p0:(OR (EQ s34 0) (EQ s53 0) (AND (EQ s3 1) (EQ s23 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 434 steps with 25 reset in 8 ms.
FORMULA Parking-PT-104-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-06 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 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 3 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2024-05-27 20:21:52] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:21:52] [INFO ] Implicit Places using invariants in 59 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/58 places, 52/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 55/58 places, 52/54 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Parking-PT-104-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s52 1), p0:(AND (EQ s27 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 1 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-08 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(G(p1)&&F(p2))))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 53
Applied a total of 2 rules in 1 ms. Remains 57 /58 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 57 cols
[2024-05-27 20:21:53] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:21:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 20:21:53] [INFO ] Invariant cache hit.
[2024-05-27 20:21:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:21:53] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-27 20:21:53] [INFO ] Invariant cache hit.
[2024-05-27 20:21:53] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/58 places, 53/54 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 57/58 places, 53/54 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Parking-PT-104-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (EQ s43 0) (EQ s53 0)), p1:(OR (EQ s17 0) (EQ s53 0)), p2:(EQ s10 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7969 reset in 444 ms.
Product exploration explored 100000 steps with 7975 reset in 302 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 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 389 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 594 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-27 20:21:55] [INFO ] Invariant cache hit.
[2024-05-27 20:21:55] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:21:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 20:21:55] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-27 20:21:55] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:21:55] [INFO ] After 27ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-27 20:21:55] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-27 20:21:55] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 53/53 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 57 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 55 transition count 51
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 55 transition count 49
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 53 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 14 place count 50 transition count 46
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 50 transition count 38
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 30 place count 42 transition count 38
Applied a total of 30 rules in 13 ms. Remains 42 /57 variables (removed 15) and now considering 38/53 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 42/57 places, 38/53 transitions.
Finished random walk after 811 steps, including 26 resets, run visited all 4 properties in 8 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p2) p0)), (F (NOT (AND p1 p2 p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 12 factoid took 790 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 53/53 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 57 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 55 transition count 51
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 55 transition count 49
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 53 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 14 place count 50 transition count 46
Applied a total of 14 rules in 16 ms. Remains 50 /57 variables (removed 7) and now considering 46/53 (removed 7) transitions.
// Phase 1: matrix 46 rows 50 cols
[2024-05-27 20:21:57] [INFO ] Computed 11 invariants in 0 ms
[2024-05-27 20:21:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-27 20:21:57] [INFO ] Invariant cache hit.
[2024-05-27 20:21:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 20:21:57] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-27 20:21:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:21:57] [INFO ] Invariant cache hit.
[2024-05-27 20:21:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/57 places, 46/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 50/57 places, 46/53 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 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (AND p1 (NOT p2))), (X (AND (NOT p2) p0)), (X (AND p1 p0)), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0))))]
Knowledge based reduction with 19 factoid took 735 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 611 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-27 20:21:58] [INFO ] Invariant cache hit.
[2024-05-27 20:21:58] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:21:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 20:21:58] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-27 20:21:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 20:21:59] [INFO ] After 27ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-27 20:21:59] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-27 20:21:59] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 46/46 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 50 transition count 38
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 42 transition count 38
Applied a total of 16 rules in 4 ms. Remains 42 /50 variables (removed 8) and now considering 38/46 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 42/50 places, 38/46 transitions.
Finished random walk after 1973 steps, including 55 resets, run visited all 4 properties in 18 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (AND p1 (NOT p2))), (X (AND (NOT p2) p0)), (X (AND p1 p0)), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p2) p0)), (F (NOT (AND p1 p2 p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 20 factoid took 1652 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 14060 reset in 192 ms.
Product exploration explored 100000 steps with 13913 reset in 335 ms.
Built C files in :
/tmp/ltsmin7590318658559659365
[2024-05-27 20:22:02] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2024-05-27 20:22:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:22:02] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2024-05-27 20:22:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:22:02] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2024-05-27 20:22:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:22:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7590318658559659365
Running compilation step : cd /tmp/ltsmin7590318658559659365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 363 ms.
Running link step : cd /tmp/ltsmin7590318658559659365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7590318658559659365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2864755668034486267.hoa' '--buchi-type=spotba'
LTSmin run took 615 ms.
FORMULA Parking-PT-104-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLFireability-09 finished in 10254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X((p1||X(p2)))))))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 2 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2024-05-27 20:22:03] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:22:03] [INFO ] Implicit Places using invariants in 60 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : Parking-PT-104-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s10 1), p1:(EQ s38 1), p2:(EQ s38 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18308 steps with 2336 reset in 31 ms.
FORMULA Parking-PT-104-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-10 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 53
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 2 place count 57 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 54 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 54 transition count 50
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 12 place count 52 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 14 place count 51 transition count 51
Applied a total of 14 rules in 10 ms. Remains 51 /58 variables (removed 7) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 51 cols
[2024-05-27 20:22:03] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:22:03] [INFO ] Implicit Places using invariants in 88 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/58 places, 51/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 49 transition count 66
Applied a total of 2 rules in 4 ms. Remains 49 /50 variables (removed 1) and now considering 66/51 (removed -15) transitions.
// Phase 1: matrix 66 rows 49 cols
[2024-05-27 20:22:03] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 20:22:03] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-27 20:22:03] [INFO ] Invariant cache hit.
[2024-05-27 20:22:03] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-27 20:22:04] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/58 places, 66/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 49/58 places, 66/54 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-104-LTLFireability-11 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:(OR (EQ s28 0) (EQ s48 0)), p1:(EQ s34 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 16 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 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 1 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2024-05-27 20:22:04] [INFO ] Computed 11 invariants in 3 ms
[2024-05-27 20:22:04] [INFO ] Implicit Places using invariants in 54 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-104-LTLFireability-12 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 s14 0), p1:(EQ s16 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-12 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 2 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
[2024-05-27 20:22:04] [INFO ] Invariant cache hit.
[2024-05-27 20:22:04] [INFO ] Implicit Places using invariants in 63 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Parking-PT-104-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s15 1) (EQ s41 1)), p0:(EQ s6 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-13 finished in 320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 54/54 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 58 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
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 56 transition count 50
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 54 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 51 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 51 transition count 47
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 2 with 4 rules applied. Total rules applied 18 place count 49 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 20 place count 48 transition count 48
Applied a total of 20 rules in 9 ms. Remains 48 /58 variables (removed 10) and now considering 48/54 (removed 6) transitions.
// Phase 1: matrix 48 rows 48 cols
[2024-05-27 20:22:04] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:22:04] [INFO ] Implicit Places using invariants in 57 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/58 places, 48/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 46 transition count 63
Applied a total of 2 rules in 4 ms. Remains 46 /47 variables (removed 1) and now considering 63/48 (removed -15) transitions.
// Phase 1: matrix 63 rows 46 cols
[2024-05-27 20:22:04] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 20:22:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-27 20:22:04] [INFO ] Invariant cache hit.
[2024-05-27 20:22:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-27 20:22:04] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 63/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 46/58 places, 63/54 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s24 1), p1:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 27 steps with 1 reset in 0 ms.
FORMULA Parking-PT-104-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-14 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(X(G(p1)))))))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 54/54 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 51
Applied a total of 6 rules in 2 ms. Remains 55 /58 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 55 cols
[2024-05-27 20:22:04] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 20:22:05] [INFO ] Implicit Places using invariants in 51 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/58 places, 51/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 54/58 places, 51/54 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-104-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(OR (EQ s3 0) (EQ s23 0)), p1:(AND (EQ s3 1) (EQ s23 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLFireability-15 finished in 291 ms.
All properties solved by simple procedures.
Total runtime 17095 ms.

BK_STOP 1716841326356

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r285-smll-171654421800038"
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 ;