Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414400108.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BridgeAndVehicles-PT-V10P10N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414400108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 12K Apr 13 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 01:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 238K Apr 13 01:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 13 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 97K Apr 13 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Apr 13 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 223K May 18 16:42 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 BridgeAndVehicles-PT-V10P10N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716629970943

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=BridgeAndVehicles-PT-V10P10N10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 09:39:32] [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-25 09:39:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:39:32] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-25 09:39:33] [INFO ] Transformed 48 places.
[2024-05-25 09:39:33] [INFO ] Transformed 288 transitions.
[2024-05-25 09:39:33] [INFO ] Parsed PT model containing 48 places and 288 transitions and 2090 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Applied a total of 2 rules in 14 ms. Remains 46 /48 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2024-05-25 09:39:33] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 09:39:33] [INFO ] Computed 5 invariants in 7 ms
[2024-05-25 09:39:33] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
[2024-05-25 09:39:33] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:33] [INFO ] Invariant cache hit.
[2024-05-25 09:39:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 09:39:33] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:33] [INFO ] Invariant cache hit.
[2024-05-25 09:39:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:33] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-25 09:39:33] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:33] [INFO ] Invariant cache hit.
[2024-05-25 09:39:33] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 288/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 46/48 places, 288/288 transitions.
Support contains 46 out of 46 places after structural reductions.
[2024-05-25 09:39:34] [INFO ] Flatten gal took : 49 ms
[2024-05-25 09:39:34] [INFO ] Flatten gal took : 34 ms
[2024-05-25 09:39:34] [INFO ] Input system was already deterministic with 288 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 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 42 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 09:39:34] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:34] [INFO ] Invariant cache hit.
[2024-05-25 09:39:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:35] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 09:39:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:35] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 09:39:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:35] [INFO ] After 28ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-25 09:39:35] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-25 09:39:35] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 43 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 41 transition count 284
Applied a total of 9 rules in 43 ms. Remains 41 /46 variables (removed 5) and now considering 284/288 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 41/46 places, 284/288 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Finished probabilistic random walk after 92289 steps, run visited all 3 properties in 420 ms. (steps per millisecond=219 )
Probabilistic random walk after 92289 steps, saw 26688 distinct states, run finished after 420 ms. (steps per millisecond=219 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 44 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)))'
Support contains 12 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 43 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 41 transition count 284
Applied a total of 9 rules in 25 ms. Remains 41 /46 variables (removed 5) and now considering 284/288 (removed 4) transitions.
[2024-05-25 09:39:36] [INFO ] Flow matrix only has 86 transitions (discarded 198 similar events)
// Phase 1: matrix 86 rows 41 cols
[2024-05-25 09:39:36] [INFO ] Computed 4 invariants in 5 ms
[2024-05-25 09:39:36] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-25 09:39:36] [INFO ] Flow matrix only has 86 transitions (discarded 198 similar events)
[2024-05-25 09:39:36] [INFO ] Invariant cache hit.
[2024-05-25 09:39:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:36] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [12, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 190 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/46 places, 284/288 transitions.
Applied a total of 0 rules in 10 ms. Remains 39 /39 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 226 ms. Remains : 39/46 places, 284/288 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 154 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (G...], 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 64 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-00 finished in 443 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((X(X((F(p1)&&F(G(p2)))))||p0)))'
Support contains 17 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 09:39:36] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 09:39:36] [INFO ] Computed 5 invariants in 6 ms
[2024-05-25 09:39:37] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
[2024-05-25 09:39:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:37] [INFO ] Invariant cache hit.
[2024-05-25 09:39:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-25 09:39:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:37] [INFO ] Invariant cache hit.
[2024-05-25 09:39:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:37] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 202 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/46 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 347 ms. Remains : 45/46 places, 288/288 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-01 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=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s14 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 2 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-01 finished in 706 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 U X(p1)))))'
Support contains 25 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 287
Applied a total of 2 rules in 5 ms. Remains 45 /46 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2024-05-25 09:39:37] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-05-25 09:39:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:37] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
[2024-05-25 09:39:37] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:37] [INFO ] Invariant cache hit.
[2024-05-25 09:39:37] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 09:39:37] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:37] [INFO ] Invariant cache hit.
[2024-05-25 09:39:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:37] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 184 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 287/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 320 ms. Remains : 43/46 places, 287/288 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s26 1) (GEQ s31 1)) (AND (GEQ s20 1) (GEQ s31 1)) (AND (GEQ s21 1) (GEQ s31 1)) (AND (GEQ s19 1) (GEQ s31 1)) (AND (GEQ s22 1) (GEQ s31 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-02 finished in 463 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 G((!p1||G(p1)))))'
Support contains 13 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 287
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 43 transition count 286
Applied a total of 5 rules in 16 ms. Remains 43 /46 variables (removed 3) and now considering 286/288 (removed 2) transitions.
[2024-05-25 09:39:38] [INFO ] Flow matrix only has 88 transitions (discarded 198 similar events)
// Phase 1: matrix 88 rows 43 cols
[2024-05-25 09:39:38] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 09:39:38] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-25 09:39:38] [INFO ] Flow matrix only has 88 transitions (discarded 198 similar events)
[2024-05-25 09:39:38] [INFO ] Invariant cache hit.
[2024-05-25 09:39:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [12, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 323 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/46 places, 286/288 transitions.
Applied a total of 0 rules in 13 ms. Remains 41 /41 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 41/46 places, 286/288 transitions.
Stuttering acceptance computed with spot in 168 ms :[false, (NOT p1), false, false, true]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NOT (OR (AND (GEQ s25 1) (GEQ s40 1)) (AND (GEQ s26 1) (GEQ s40 1)))) (OR (AND (GEQ s26 1) (GEQ s36 1)) (AND (GEQ s26 1) (GEQ s37 1)) (AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-03 finished in 543 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(p0)) U (F(G(p1))&&G(p2))))'
Support contains 29 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 09:39:38] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 09:39:38] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:38] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
[2024-05-25 09:39:38] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:38] [INFO ] Invariant cache hit.
[2024-05-25 09:39:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 09:39:38] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:38] [INFO ] Invariant cache hit.
[2024-05-25 09:39:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:38] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 137 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 264 ms. Remains : 44/46 places, 288/288 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (AND (GEQ s2 1) (GEQ s15 1) (GEQ s16 1) (GEQ s39 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s16 1) (GEQ s42 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s16 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-04 finished in 603 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)))'
Support contains 23 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 287
Applied a total of 2 rules in 3 ms. Remains 45 /46 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2024-05-25 09:39:39] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-05-25 09:39:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:39] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
[2024-05-25 09:39:39] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:39] [INFO ] Invariant cache hit.
[2024-05-25 09:39:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-25 09:39:39] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:39] [INFO ] Invariant cache hit.
[2024-05-25 09:39:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 188 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 287/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 318 ms. Remains : 43/46 places, 287/288 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s15 1) (GEQ s16 1) (GEQ s38 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s16 1) (GEQ s41 1)) (AND (GEQ s2 1) (GEQ s15 1) (GEQ s16 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 439 steps with 5 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-05 finished in 458 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)))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 287
Applied a total of 2 rules in 5 ms. Remains 45 /46 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2024-05-25 09:39:39] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:39] [INFO ] Invariant cache hit.
[2024-05-25 09:39:39] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
[2024-05-25 09:39:39] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:39] [INFO ] Invariant cache hit.
[2024-05-25 09:39:39] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-25 09:39:39] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:39] [INFO ] Invariant cache hit.
[2024-05-25 09:39:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:40] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 248 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 287/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 379 ms. Remains : 43/46 places, 287/288 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s27 1) (GEQ s42 1)) (AND (GEQ s28 1) (GEQ s42 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][false, false]]
Stuttering criterion allowed to conclude after 76757 steps with 1493 reset in 239 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-06 finished in 725 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) U G((p1 U p0))))'
Support contains 13 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 09:39:40] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 09:39:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:40] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
[2024-05-25 09:39:40] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:40] [INFO ] Invariant cache hit.
[2024-05-25 09:39:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 09:39:40] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:40] [INFO ] Invariant cache hit.
[2024-05-25 09:39:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:40] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 209 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 44/46 places, 288/288 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33310 reset in 304 ms.
Product exploration explored 100000 steps with 33283 reset in 353 ms.
Computed a total of 27 stabilizing places and 44 stable transitions
Computed a total of 27 stabilizing places and 44 stable transitions
Detected a total of 27/44 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 250 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Finished random walk after 34 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 12 factoid took 269 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-07 finished in 1851 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(((p1 U (F((F(p4)&&p3))&&p2))&&p0)))'
Support contains 9 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 288/288 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 45 transition count 287
Applied a total of 2 rules in 10 ms. Remains 45 /46 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2024-05-25 09:39:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-05-25 09:39:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:42] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
[2024-05-25 09:39:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:42] [INFO ] Invariant cache hit.
[2024-05-25 09:39:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 09:39:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:42] [INFO ] Invariant cache hit.
[2024-05-25 09:39:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:42] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [12, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 192 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/46 places, 287/288 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 337 ms. Remains : 43/46 places, 287/288 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p4) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) (NOT p0) (NOT p4)), (NOT p4), (OR (NOT p3) (NOT p4))]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p3 (NOT p4)), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p3 (NOT p4)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p4), acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 (NOT p4)), acceptance={0} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s13 1) (GEQ s23 1) (GEQ s38 1)), p1:(GEQ s28 1), p3:(AND (GEQ s27 1) (GEQ s42 1)), p4:(AND (GEQ s1 1) (GEQ s13 1) (GEQ s23 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-09 finished in 563 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&&(p1||F(p2))))))'
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 09:39:42] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 09:39:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:42] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
[2024-05-25 09:39:42] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:42] [INFO ] Invariant cache hit.
[2024-05-25 09:39:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-25 09:39:43] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:43] [INFO ] Invariant cache hit.
[2024-05-25 09:39:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:43] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 193 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/46 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 297 ms. Remains : 45/46 places, 288/288 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s13 1), p1:(AND (GEQ s28 1) (GEQ s36 1)), p2:(AND (GEQ s10 1) (GEQ s12 1) (GEQ s14 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-10 finished in 445 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)||F(p1)))'
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 11 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 09:39:43] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:43] [INFO ] Invariant cache hit.
[2024-05-25 09:39:43] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
[2024-05-25 09:39:43] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:43] [INFO ] Invariant cache hit.
[2024-05-25 09:39:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-25 09:39:43] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:43] [INFO ] Invariant cache hit.
[2024-05-25 09:39:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:43] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 176 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/46 places, 288/288 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 45/46 places, 288/288 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s13 1) (GEQ s15 1) (GEQ s17 1) (GEQ s27 1)), p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s30 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]]
Product exploration explored 100000 steps with 1434 reset in 183 ms.
Product exploration explored 100000 steps with 1430 reset in 230 ms.
Computed a total of 28 stabilizing places and 44 stable transitions
Computed a total of 28 stabilizing places and 44 stable transitions
Detected a total of 28/45 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
[2024-05-25 09:39:44] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2024-05-25 09:39:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:39:44] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-25 09:39:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:39:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:39:44] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-25 09:39:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 32 ms returned sat
[2024-05-25 09:39:44] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 17 ms.
[2024-05-25 09:39:44] [INFO ] Added : 5 causal constraints over 3 iterations in 56 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 45 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 288/288 transitions.
Applied a total of 0 rules in 8 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 09:39:44] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:44] [INFO ] Invariant cache hit.
[2024-05-25 09:39:44] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
[2024-05-25 09:39:44] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:44] [INFO ] Invariant cache hit.
[2024-05-25 09:39:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-25 09:39:45] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:45] [INFO ] Invariant cache hit.
[2024-05-25 09:39:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:45] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-25 09:39:45] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-25 09:39:45] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:45] [INFO ] Invariant cache hit.
[2024-05-25 09:39:45] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 395 ms. Remains : 45/45 places, 288/288 transitions.
Computed a total of 28 stabilizing places and 44 stable transitions
Computed a total of 28 stabilizing places and 44 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2024-05-25 09:39:45] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:45] [INFO ] Invariant cache hit.
[2024-05-25 09:39:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:39:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 09:39:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:39:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:39:45] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-25 09:39:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 14 ms returned sat
[2024-05-25 09:39:45] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 12 ms.
[2024-05-25 09:39:45] [INFO ] Added : 6 causal constraints over 2 iterations in 36 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1425 reset in 188 ms.
Product exploration explored 100000 steps with 1420 reset in 191 ms.
Built C files in :
/tmp/ltsmin13484038658633945062
[2024-05-25 09:39:46] [INFO ] Computing symmetric may disable matrix : 288 transitions.
[2024-05-25 09:39:46] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:39:46] [INFO ] Computing symmetric may enable matrix : 288 transitions.
[2024-05-25 09:39:46] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:39:46] [INFO ] Computing Do-Not-Accords matrix : 288 transitions.
[2024-05-25 09:39:46] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:39:46] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13484038658633945062
Running compilation step : cd /tmp/ltsmin13484038658633945062;'/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 796 ms.
Running link step : cd /tmp/ltsmin13484038658633945062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin13484038658633945062;'/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/stateBased856603594602725844.hoa' '--buchi-type=spotba'
LTSmin run took 3461 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-11 finished in 7227 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(F(p1))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 09:39:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 09:39:50] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:50] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
[2024-05-25 09:39:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:50] [INFO ] Invariant cache hit.
[2024-05-25 09:39:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-25 09:39:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 09:39:50] [INFO ] Invariant cache hit.
[2024-05-25 09:39:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:50] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 172 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 261 ms. Remains : 44/46 places, 288/288 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s24 1) (LT s32 1) (GEQ s29 1)), p0:(AND (GEQ s27 1) (GEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Computed a total of 27 stabilizing places and 44 stable transitions
Computed a total of 27 stabilizing places and 44 stable transitions
Detected a total of 27/44 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 28 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-13 finished in 748 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&&X(!p0)) U p1)&&X(X(G(p2)))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 287
Applied a total of 2 rules in 2 ms. Remains 45 /46 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2024-05-25 09:39:51] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-05-25 09:39:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:51] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
[2024-05-25 09:39:51] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:51] [INFO ] Invariant cache hit.
[2024-05-25 09:39:51] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-25 09:39:51] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:51] [INFO ] Invariant cache hit.
[2024-05-25 09:39:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:51] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 190 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 287/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 308 ms. Remains : 43/46 places, 287/288 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p1) p0), (NOT p2), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s18 1) (GEQ s31 1)), p0:(AND (GEQ s0 1) (GEQ s3 1)), p2:(AND (GEQ s28 1) (GEQ s42 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 14 steps with 1 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-14 finished in 496 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 U p1)||F((p2&&X(p3))))))'
Support contains 10 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 287
Applied a total of 2 rules in 2 ms. Remains 45 /46 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2024-05-25 09:39:51] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:51] [INFO ] Invariant cache hit.
[2024-05-25 09:39:51] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
[2024-05-25 09:39:51] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:51] [INFO ] Invariant cache hit.
[2024-05-25 09:39:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-25 09:39:51] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:51] [INFO ] Invariant cache hit.
[2024-05-25 09:39:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 151 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 287/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 260 ms. Remains : 44/46 places, 287/288 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p2, acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (AND (GEQ s6 1) (GEQ s12 1) (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s19 1) (GEQ s41 1))), p3:(AND (GEQ s23 1) (GEQ s32 1)), p1:(A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1450 reset in 225 ms.
Product exploration explored 100000 steps with 1437 reset in 401 ms.
Computed a total of 27 stabilizing places and 43 stable transitions
Computed a total of 27 stabilizing places and 43 stable transitions
Detected a total of 27/44 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 121 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 09:39:53] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2024-05-25 09:39:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:39:53] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:39:53] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 09:39:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:53] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-25 09:39:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:53] [INFO ] After 27ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-25 09:39:53] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-25 09:39:53] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 17 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-05-25 09:39:53] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:53] [INFO ] Invariant cache hit.
[2024-05-25 09:39:53] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 44/44 places, 287/287 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 30064 steps, run visited all 2 properties in 97 ms. (steps per millisecond=309 )
Probabilistic random walk after 30064 steps, saw 8420 distinct states, run finished after 98 ms. (steps per millisecond=306 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND p2 (NOT p3))), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 19 factoid took 436 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
[2024-05-25 09:39:55] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:55] [INFO ] Invariant cache hit.
[2024-05-25 09:39:57] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:39:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-25 09:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:39:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:39:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-25 09:39:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 37 ms returned sat
[2024-05-25 09:39:57] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 14 ms.
[2024-05-25 09:39:57] [INFO ] Added : 10 causal constraints over 3 iterations in 51 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
[2024-05-25 09:39:57] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:57] [INFO ] Invariant cache hit.
[2024-05-25 09:39:57] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:39:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-25 09:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:39:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:39:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-25 09:39:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 75 ms returned sat
[2024-05-25 09:39:57] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 18 ms.
[2024-05-25 09:39:57] [INFO ] Added : 13 causal constraints over 3 iterations in 62 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 10 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-05-25 09:39:57] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:57] [INFO ] Invariant cache hit.
[2024-05-25 09:39:58] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
[2024-05-25 09:39:58] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:58] [INFO ] Invariant cache hit.
[2024-05-25 09:39:58] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-25 09:39:58] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:58] [INFO ] Invariant cache hit.
[2024-05-25 09:39:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:58] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-25 09:39:58] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:58] [INFO ] Invariant cache hit.
[2024-05-25 09:39:58] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 44/44 places, 287/287 transitions.
Computed a total of 27 stabilizing places and 43 stable transitions
Computed a total of 27 stabilizing places and 43 stable transitions
Detected a total of 27/44 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 495 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 09:39:59] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:59] [INFO ] Invariant cache hit.
[2024-05-25 09:39:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:59] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 09:39:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:39:59] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 09:39:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:39:59] [INFO ] After 35ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 09:39:59] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-25 09:39:59] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 10 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-05-25 09:39:59] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:39:59] [INFO ] Invariant cache hit.
[2024-05-25 09:39:59] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 44/44 places, 287/287 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 30064 steps, run visited all 2 properties in 96 ms. (steps per millisecond=313 )
Probabilistic random walk after 30064 steps, saw 8420 distinct states, run finished after 96 ms. (steps per millisecond=313 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p2 (NOT p3))), (F p2), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 412 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
[2024-05-25 09:40:00] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:40:00] [INFO ] Invariant cache hit.
[2024-05-25 09:40:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:40:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:40:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-25 09:40:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:40:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:40:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-25 09:40:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:40:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 34 ms returned sat
[2024-05-25 09:40:01] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 17 ms.
[2024-05-25 09:40:01] [INFO ] Added : 10 causal constraints over 3 iterations in 56 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
[2024-05-25 09:40:01] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 09:40:01] [INFO ] Invariant cache hit.
[2024-05-25 09:40:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:40:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:40:01] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-25 09:40:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:40:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:40:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-25 09:40:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:40:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 47 ms returned sat
[2024-05-25 09:40:01] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 13 ms.
[2024-05-25 09:40:01] [INFO ] Added : 13 causal constraints over 3 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 1450 reset in 277 ms.
Product exploration explored 100000 steps with 1434 reset in 231 ms.
Built C files in :
/tmp/ltsmin6147472008144073628
[2024-05-25 09:40:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6147472008144073628
Running compilation step : cd /tmp/ltsmin6147472008144073628;'/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 509 ms.
Running link step : cd /tmp/ltsmin6147472008144073628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6147472008144073628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14460323938455228893.hoa' '--buchi-type=spotba'
LTSmin run took 932 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLFireability-15 finished in 12178 ms.
All properties solved by simple procedures.
Total runtime 31228 ms.

BK_STOP 1716630004110

--------------------
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="BridgeAndVehicles-PT-V10P10N10"
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 BridgeAndVehicles-PT-V10P10N10, 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 r065-tajo-171620414400108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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