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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 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 49K 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-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 1716841414728

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-208
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:23:37] [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:23:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:23:37] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-27 20:23:37] [INFO ] Transformed 137 places.
[2024-05-27 20:23:37] [INFO ] Transformed 201 transitions.
[2024-05-27 20:23:37] [INFO ] Found NUPN structural information;
[2024-05-27 20:23:37] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 34 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2024-05-27 20:23:37] [INFO ] Computed 34 invariants in 9 ms
[2024-05-27 20:23:38] [INFO ] Implicit Places using invariants in 404 ms returned [28, 36, 44, 52, 64, 94, 102, 110, 118, 130]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 448 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 116/117 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 111
Applied a total of 10 rules in 13 ms. Remains 121 /126 variables (removed 5) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 121 cols
[2024-05-27 20:23:38] [INFO ] Computed 24 invariants in 3 ms
[2024-05-27 20:23:38] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-27 20:23:38] [INFO ] Invariant cache hit.
[2024-05-27 20:23:38] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-27 20:23:38] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/137 places, 111/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 860 ms. Remains : 121/137 places, 111/117 transitions.
Support contains 28 out of 121 places after structural reductions.
[2024-05-27 20:23:38] [INFO ] Flatten gal took : 48 ms
[2024-05-27 20:23:38] [INFO ] Flatten gal took : 20 ms
[2024-05-27 20:23:38] [INFO ] Input system was already deterministic with 111 transitions.
Support contains 25 out of 121 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 289 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2024-05-27 20:23:39] [INFO ] Invariant cache hit.
[2024-05-27 20:23:39] [INFO ] [Real]Absence check using 24 positive place invariants in 8 ms returned sat
[2024-05-27 20:23:39] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-27 20:23:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-27 20:23:39] [INFO ] After 32ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:23:39] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:23:39] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2024-05-27 20:23:39] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:23:40] [INFO ] After 38ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:23:40] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-27 20:23:40] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 12 ms.
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 111/111 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 121 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
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 117 transition count 103
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 113 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 110 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 110 transition count 100
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 104 transition count 94
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 36 place count 103 transition count 97
Free-agglomeration rule applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 55 place count 103 transition count 78
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 74 place count 84 transition count 78
Applied a total of 74 rules in 50 ms. Remains 84 /121 variables (removed 37) and now considering 78/111 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 84/121 places, 78/111 transitions.
Finished random walk after 96 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Parking-PT-208-LTLFireability-03 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 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 121 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 118 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 118 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 115 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 111 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 111 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 106 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 104 transition count 118
Applied a total of 34 rules in 33 ms. Remains 104 /121 variables (removed 17) and now considering 118/111 (removed -7) transitions.
// Phase 1: matrix 118 rows 104 cols
[2024-05-27 20:23:40] [INFO ] Computed 24 invariants in 2 ms
[2024-05-27 20:23:40] [INFO ] Implicit Places using invariants in 115 ms returned [52, 101]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 118/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 4 place count 100 transition count 148
Applied a total of 4 rules in 13 ms. Remains 100 /102 variables (removed 2) and now considering 148/118 (removed -30) transitions.
// Phase 1: matrix 148 rows 100 cols
[2024-05-27 20:23:40] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 20:23:40] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-27 20:23:40] [INFO ] Invariant cache hit.
[2024-05-27 20:23:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 20:23:40] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 148/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 491 ms. Remains : 100/121 places, 148/111 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 239 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s37 1), p0:(AND (EQ s23 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 3 ms.
FORMULA Parking-PT-208-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-00 finished in 805 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((X(p0)||F(p1)))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 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 121 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
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 117 transition count 103
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 113 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 110 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 110 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 105 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 36 place count 103 transition count 117
Applied a total of 36 rules in 23 ms. Remains 103 /121 variables (removed 18) and now considering 117/111 (removed -6) transitions.
// Phase 1: matrix 117 rows 103 cols
[2024-05-27 20:23:41] [INFO ] Computed 24 invariants in 3 ms
[2024-05-27 20:23:41] [INFO ] Implicit Places using invariants in 102 ms returned [50, 100]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 107 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/121 places, 117/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 4 place count 99 transition count 147
Applied a total of 4 rules in 12 ms. Remains 99 /101 variables (removed 2) and now considering 147/117 (removed -30) transitions.
// Phase 1: matrix 147 rows 99 cols
[2024-05-27 20:23:41] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 20:23:41] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 20:23:41] [INFO ] Invariant cache hit.
[2024-05-27 20:23:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 20:23:41] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/121 places, 147/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 438 ms. Remains : 99/121 places, 147/111 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-208-LTLFireability-01 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:(EQ s50 0), p1:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3132 reset in 433 ms.
Product exploration explored 100000 steps with 3130 reset in 343 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 312 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:23:42] [INFO ] Invariant cache hit.
[2024-05-27 20:23:42] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:23:42] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2024-05-27 20:23:42] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-01 finished in 1748 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))||(X(G(p1)) U (p2 U !p0))) U p2))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 109
Applied a total of 4 rules in 4 ms. Remains 119 /121 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 119 cols
[2024-05-27 20:23:42] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:23:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 20:23:43] [INFO ] Invariant cache hit.
[2024-05-27 20:23:43] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-27 20:23:43] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-27 20:23:43] [INFO ] Invariant cache hit.
[2024-05-27 20:23:43] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/121 places, 109/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 119/121 places, 109/111 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s40 1) (EQ s58 1)), p0:(NEQ s100 1), p1:(AND (EQ s91 1) (EQ s115 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 846 steps with 23 reset in 5 ms.
FORMULA Parking-PT-208-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-04 finished in 591 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)) U G((!p1&&F(p2)))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
Applied a total of 8 rules in 2 ms. Remains 117 /121 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 117 cols
[2024-05-27 20:23:43] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:23:43] [INFO ] Implicit Places using invariants in 90 ms returned [57, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/121 places, 107/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 115/121 places, 107/111 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2), (AND p1 (NOT p0)), true, (AND p1 p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s42 1), p2:(NEQ s24 1), p0:(AND (EQ s87 1) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24965 reset in 569 ms.
Product exploration explored 100000 steps with 24967 reset in 477 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 (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p2), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 198 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p0)), (NOT p2), true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 289 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 107 rows 115 cols
[2024-05-27 20:23:45] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:23:45] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2024-05-27 20:23:45] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 20:23:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-27 20:23:45] [INFO ] After 11ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-27 20:23:45] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:23:45] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:23:45] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2024-05-27 20:23:45] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:23:45] [INFO ] After 10ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:23:45] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-27 20:23:45] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p2), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 17 factoid took 299 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-06 finished in 2363 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((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 108
Applied a total of 6 rules in 3 ms. Remains 118 /121 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 118 cols
[2024-05-27 20:23:45] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:23:46] [INFO ] Implicit Places using invariants in 85 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/121 places, 108/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 117/121 places, 108/111 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s35 1) (EQ s59 1))) (NOT (AND (EQ s83 1) (EQ s113 1)))), p0:(AND (EQ s83 1) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 445 ms.
Product exploration explored 100000 steps with 50000 reset in 467 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-10 finished in 1188 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 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 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 121 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 118 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 118 transition count 105
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 115 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 111 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 111 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 106 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 34 place count 104 transition count 118
Applied a total of 34 rules in 18 ms. Remains 104 /121 variables (removed 17) and now considering 118/111 (removed -7) transitions.
// Phase 1: matrix 118 rows 104 cols
[2024-05-27 20:23:47] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:23:47] [INFO ] Implicit Places using invariants in 93 ms returned [52, 100]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 118/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 4 place count 100 transition count 148
Applied a total of 4 rules in 11 ms. Remains 100 /102 variables (removed 2) and now considering 148/118 (removed -30) transitions.
// Phase 1: matrix 148 rows 100 cols
[2024-05-27 20:23:47] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:23:47] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 20:23:47] [INFO ] Invariant cache hit.
[2024-05-27 20:23:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 20:23:47] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 148/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 438 ms. Remains : 100/121 places, 148/111 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-208-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s81 1) (EQ s99 1) (EQ s33 1)), p0:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-11 finished in 494 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)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 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 121 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
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 117 transition count 103
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 113 transition count 103
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 109 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 109 transition count 99
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 36 place count 103 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 40 place count 101 transition count 115
Applied a total of 40 rules in 22 ms. Remains 101 /121 variables (removed 20) and now considering 115/111 (removed -4) transitions.
// Phase 1: matrix 115 rows 101 cols
[2024-05-27 20:23:47] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:23:47] [INFO ] Implicit Places using invariants in 96 ms returned [50, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 111 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/121 places, 115/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 4 place count 97 transition count 145
Applied a total of 4 rules in 10 ms. Remains 97 /99 variables (removed 2) and now considering 145/115 (removed -30) transitions.
// Phase 1: matrix 145 rows 97 cols
[2024-05-27 20:23:47] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 20:23:47] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 20:23:47] [INFO ] Invariant cache hit.
[2024-05-27 20:23:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-27 20:23:48] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/121 places, 145/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 437 ms. Remains : 97/121 places, 145/111 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s39 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 36 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-12 finished in 523 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 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 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 121 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
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 117 transition count 103
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 113 transition count 103
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 109 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 109 transition count 99
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 36 place count 103 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 40 place count 101 transition count 115
Applied a total of 40 rules in 23 ms. Remains 101 /121 variables (removed 20) and now considering 115/111 (removed -4) transitions.
// Phase 1: matrix 115 rows 101 cols
[2024-05-27 20:23:48] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:23:48] [INFO ] Implicit Places using invariants in 88 ms returned [50, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 101 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/121 places, 115/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 4 place count 97 transition count 145
Applied a total of 4 rules in 8 ms. Remains 97 /99 variables (removed 2) and now considering 145/115 (removed -30) transitions.
// Phase 1: matrix 145 rows 97 cols
[2024-05-27 20:23:48] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:23:48] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 20:23:48] [INFO ] Invariant cache hit.
[2024-05-27 20:23:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-27 20:23:48] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/121 places, 145/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 97/121 places, 145/111 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s18 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]]
Product exploration explored 100000 steps with 50000 reset in 678 ms.
Product exploration explored 100000 steps with 50000 reset in 815 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-13 finished in 2060 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(F(p1))&&p0)))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 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 121 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 118 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 118 transition count 105
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 115 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 111 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 111 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 106 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 34 place count 104 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 104 transition count 118
Applied a total of 35 rules in 19 ms. Remains 104 /121 variables (removed 17) and now considering 118/111 (removed -7) transitions.
// Phase 1: matrix 118 rows 104 cols
[2024-05-27 20:23:50] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:23:50] [INFO ] Implicit Places using invariants in 87 ms returned [53, 101]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 118/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 4 place count 100 transition count 148
Applied a total of 4 rules in 7 ms. Remains 100 /102 variables (removed 2) and now considering 148/118 (removed -30) transitions.
// Phase 1: matrix 148 rows 100 cols
[2024-05-27 20:23:50] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:23:50] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 20:23:50] [INFO ] Invariant cache hit.
[2024-05-27 20:23:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-27 20:23:50] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 148/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 100/121 places, 148/111 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s38 0), p0:(AND (EQ s6 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-14 finished in 580 ms.
All properties solved by simple procedures.
Total runtime 13558 ms.

BK_STOP 1716841431925

--------------------
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-208"
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-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 r285-smll-171654421800043"
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 ;