Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694200100.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-COL-V50P50N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694200100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 12:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:22 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-COL-V50P50N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678606517106

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:35:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 07:35:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:35:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 07:35:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 07:35:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 468 ms
[2023-03-12 07:35:19] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 07:35:19] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-12 07:35:19] [INFO ] Skeletonized 10 HLPN properties in 1 ms. Removed 6 properties that had guard overlaps.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Finished random walk after 157 steps, including 0 resets, run visited all 7 properties in 12 ms. (steps per millisecond=13 )
[2023-03-12 07:35:19] [INFO ] Flatten gal took : 13 ms
[2023-03-12 07:35:19] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 07:35:19] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 107 ms.
[2023-03-12 07:35:19] [INFO ] Unfolded 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 35 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:35:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:35:20] [INFO ] Computed 5 place invariants in 31 ms
[2023-03-12 07:35:21] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
[2023-03-12 07:35:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:21] [INFO ] Invariant cache hit.
[2023-03-12 07:35:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 07:35:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:21] [INFO ] Invariant cache hit.
[2023-03-12 07:35:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:35:21] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-12 07:35:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:21] [INFO ] Invariant cache hit.
[2023-03-12 07:35:22] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1911 ms. Remains : 136/138 places, 2348/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2023-03-12 07:35:22] [INFO ] Flatten gal took : 235 ms
[2023-03-12 07:35:23] [INFO ] Flatten gal took : 199 ms
[2023-03-12 07:35:24] [INFO ] Input system was already deterministic with 2348 transitions.
Finished random walk after 2556 steps, including 5 resets, run visited all 16 properties in 676 ms. (steps per millisecond=3 )
Computed a total of 109 stabilizing places and 204 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 54 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 71 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:35:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:26] [INFO ] Invariant cache hit.
[2023-03-12 07:35:27] [INFO ] Dead Transitions using invariants and state equation in 1317 ms found 0 transitions.
[2023-03-12 07:35:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:27] [INFO ] Invariant cache hit.
[2023-03-12 07:35:28] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-12 07:35:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:28] [INFO ] Invariant cache hit.
[2023-03-12 07:35:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:35:29] [INFO ] Implicit Places using invariants and state equation in 957 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1285 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 29 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2716 ms. Remains : 135/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 415 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s106 1) (GEQ s109 1)) (AND (GEQ s0 1) (GEQ s97 1) (GEQ s106 1) (GEQ s109 1)) (AND (GEQ s0 1) (GEQ s90 1) (GEQ s106...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 872 reset in 1470 ms.
Product exploration explored 100000 steps with 904 reset in 1282 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 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 (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 156 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-12 07:35:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2023-03-12 07:35:33] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-12 07:35:35] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-12 07:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:35:35] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2023-03-12 07:35:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:35:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:35:37] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-12 07:35:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:35:37] [INFO ] [Nat]Added 42 Read/Feed constraints in 462 ms returned sat
[2023-03-12 07:35:37] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 150 ms.
[2023-03-12 07:35:38] [INFO ] Added : 21 causal constraints over 5 iterations in 490 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 54 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 23 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:35:38] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:38] [INFO ] Invariant cache hit.
[2023-03-12 07:35:52] [INFO ] Dead Transitions using invariants and state equation in 13804 ms found 0 transitions.
[2023-03-12 07:35:52] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:52] [INFO ] Invariant cache hit.
[2023-03-12 07:35:52] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-12 07:35:52] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:52] [INFO ] Invariant cache hit.
[2023-03-12 07:35:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:35:53] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2023-03-12 07:35:53] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:53] [INFO ] Invariant cache hit.
[2023-03-12 07:35:57] [INFO ] Dead Transitions using invariants and state equation in 3978 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18826 ms. Remains : 135/135 places, 2348/2348 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 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 (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 348 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-12 07:35:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:35:58] [INFO ] Invariant cache hit.
[2023-03-12 07:35:59] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-12 07:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:35:59] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-12 07:35:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:36:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:36:01] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-12 07:36:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:01] [INFO ] [Nat]Added 42 Read/Feed constraints in 250 ms returned sat
[2023-03-12 07:36:01] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 210 ms.
[2023-03-12 07:36:02] [INFO ] Added : 21 causal constraints over 5 iterations in 496 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 877 reset in 1075 ms.
Product exploration explored 100000 steps with 900 reset in 1118 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 54 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 471 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:36:05] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:36:05] [INFO ] Invariant cache hit.
[2023-03-12 07:36:05] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
[2023-03-12 07:36:06] [INFO ] Redundant transitions in 172 ms returned []
[2023-03-12 07:36:06] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:36:06] [INFO ] Invariant cache hit.
[2023-03-12 07:36:06] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2313 ms. Remains : 135/135 places, 2348/2348 transitions.
Support contains 54 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:36:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:36:07] [INFO ] Invariant cache hit.
[2023-03-12 07:36:08] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
[2023-03-12 07:36:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:36:08] [INFO ] Invariant cache hit.
[2023-03-12 07:36:08] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-12 07:36:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:36:08] [INFO ] Invariant cache hit.
[2023-03-12 07:36:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:08] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-12 07:36:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:36:08] [INFO ] Invariant cache hit.
[2023-03-12 07:36:10] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3403 ms. Remains : 135/135 places, 2348/2348 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-00 finished in 44710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0&&X(G((G(!p2)||p1)))) U (G((p0&&X(G((G(!p2)||p3)))))||(p0&&F((!p4&&X(!p2)))&&X(G((G(!p2)||p5)))))))))'
Support contains 107 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 33 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:36:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:36:11] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:36:12] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
[2023-03-12 07:36:12] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:12] [INFO ] Invariant cache hit.
[2023-03-12 07:36:12] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-12 07:36:12] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:12] [INFO ] Invariant cache hit.
[2023-03-12 07:36:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:13] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-12 07:36:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:13] [INFO ] Invariant cache hit.
[2023-03-12 07:36:13] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2347/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2491 ms. Remains : 135/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 3833 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), true, (AND p2 (NOT p3)), (AND p2 (NOT p3) (NOT p5)), (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3 (NOT p5)), (AND (NOT p1) p2 (NOT p3)), (AND p2 (NOT p3) (NOT p5) (NOT p1)), (OR (AND (NOT p0) (NOT p1) p2 p3) (AND p0 (NOT p1) p2 (NOT p3))), (OR (AND p2 p3 (NOT p5) (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p5) (NOT p1) p0)), (AND p2 (NOT p3)), (OR (AND (NOT p0) (NOT p2) p4) (AND (NOT p0) p2 p3)), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) (NOT p1) p2 p3) (AND p0 (NOT p1) p2 (NOT p3))), (OR p2 p4), p2, (AND p2 (NOT p3)), (AND p2 (NOT p3)), p2, (AND p2 (NOT p3)), (AND p2 (NOT p5)), (AND p2 (NOT p3) (NOT p5)), (AND p2 (NOT p3) (NOT p5)), (AND (NOT p0) p2 p3 (NOT p5)), (AND p2 (NOT p3)), (AND (NOT p0) p2 p3), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p1)), (AND p2 (NOT p5) (NOT p1)), (AND p2 (NOT p3) (NOT p1)), (OR (AND (NOT p0) p2 p3) (AND p0 p2 (NOT p3))), (OR (AND (NOT p0) (NOT p2) p4) (AND (NOT p0) p2 p3) (AND p0 p2 (NOT p3))), (OR (AND p0 p2 (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (AND p2 p3 (NOT p0)) (AND p2 (NOT p3) p0)), (OR (AND p2 p3 (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p1) p0)), (OR (AND p2 p3 (NOT p5) (NOT p0)) (AND p2 (NOT p3) (NOT p5) p0)), p2, (OR (AND (NOT p0) p2 p3) (AND p0 p2 (NOT p3)))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p4)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p4)), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p4)), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p4)), acceptance={} source=2 dest: 10}, { cond=p0, acceptance={} source=2 dest: 11}, { cond=(AND p0 p4), acceptance={} source=2 dest: 12}, { cond=(AND p0 p4), acceptance={} source=2 dest: 13}, { cond=(AND p0 p4), acceptance={} source=2 dest: 14}, { cond=(AND p0 p4), acceptance={} source=2 dest: 15}], [{ cond=true, acceptance={0, 1, 2, 3} source=3 dest: 3}], [{ cond=(AND p0 (NOT p4) p2 p3), acceptance={0, 1, 3} source=4 dest: 4}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={0, 1, 2, 3} source=4 dest: 4}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={1, 2, 3} source=4 dest: 6}, { cond=(AND p0 (NOT p4) p2), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={} source=4 dest: 10}, { cond=(AND p0 p4 p2 p3), acceptance={0, 1, 3} source=4 dest: 12}, { cond=(AND p0 p4 p2 (NOT p3)), acceptance={0, 1, 2, 3} source=4 dest: 12}, { cond=(AND p0 p4 p2 (NOT p3)), acceptance={1, 2, 3} source=4 dest: 13}, { cond=(AND p0 p4 p2), acceptance={} source=4 dest: 14}, { cond=(AND p0 p4 p2 (NOT p3)), acceptance={} source=4 dest: 15}, { cond=(AND (NOT p0) p4 p2 (NOT p3)), acceptance={} source=4 dest: 16}, { cond=(AND (NOT p0) (NOT p4) p2 (NOT p3)), acceptance={} source=4 dest: 17}, { cond=(AND (NOT p0) (NOT p4) p2 p3), acceptance={} source=4 dest: 18}, { cond=(AND (NOT p0) p4 p2 p3), acceptance={} source=4 dest: 19}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p5)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p4) (NOT p5)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p3 p5)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p3) p5), acceptance={0, 1, 2} source=5 dest: 5}, { cond=(AND p0 p2 p3 (NOT p5)), acceptance={0, 1, 3} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p3) (NOT p5)), acceptance={0, 1, 2, 3} source=5 dest: 5}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p5)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p2 (NOT p3) p5), acceptance={1, 2} source=5 dest: 7}, { cond=(AND p0 p2 (NOT p3) (NOT p5)), acceptance={1, 2, 3} source=5 dest: 7}, { cond=(AND p0 (NOT p4) (NOT p5)), acceptance={} source=5 dest: 8}, { cond=p0, acceptance={} source=5 dest: 9}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p5)), acceptance={} source=5 dest: 10}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 11}, { cond=(AND p0 p4 p2 (NOT p5)), acceptance={} source=5 dest: 12}, { cond=(AND p0 p4 p2 (NOT p3) (NOT p5)), acceptance={} source=5 dest: 13}, { cond=(AND p0 p4 (NOT p5)), acceptance={} source=5 dest: 14}, { cond=(AND p0 p4 (NOT p3) (NOT p5)), acceptance={} source=5 dest: 15}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p5)), acceptance={} source=5 dest: 20}, { cond=(AND (NOT p0) p3 (NOT p5)), acceptance={} source=5 dest: 21}, { cond=(AND (NOT p0) (NOT p3) p5), acceptance={} source=5 dest: 22}, { cond=(AND (NOT p0) p3 p5), acceptance={} source=5 dest: 23}, { cond=(AND p0 (NOT p2) (NOT p3) p5), acceptance={0, 2} source=5 dest: 24}, { cond=(AND p0 (NOT p2) p3 (NOT p5)), acceptance={0, 3} source=5 dest: 24}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p5)), acceptance={0, 2, 3} source=5 dest: 24}, { cond=(AND p0 (NOT p2) (NOT p3) p5), acceptance={2} source=5 dest: 25}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p5)), acceptance={2, 3} source=5 dest: 25}, { cond=(AND p0 p4 (NOT p2) (NOT p5)), acceptance={} source=5 dest: 26}, { cond=(AND p0 p4 (NOT p2) (NOT p3) (NOT p5)), acceptance={} source=5 dest: 27}], [{ cond=(AND p0 (NOT p4) p2 p3), acceptance={0, 1, 2, 3} source=6 dest: 4}, { cond=(AND p0 (NOT p4) p2 p3), acceptance={1, 2, 3} source=6 dest: 6}, { cond=(AND p0 (NOT p4) p2 p3), acceptance={} source=6 dest: 10}, { cond=(AND p0 p4 p2 p3), acceptance={0, 1, 2, 3} source=6 dest: 12}, { cond=(AND p0 p4 p2 p3), acceptance={1, 2, 3} source=6 dest: 13}, { cond=(AND p0 p4 p2 p3), acceptance={} source=6 dest: 15}, { cond=(AND (NOT p0) p4 p2 p3), acceptance={} source=6 dest: 16}, { cond=(AND (NOT p0) (NOT p4) p2 p3), acceptance={} source=6 dest: 17}], [{ cond=(AND (NOT p0) p2 p3 (NOT p5)), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p4) p3 (NOT p5)), acceptance={} source=7 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p3 p5)), acceptance={0, 1, 2} source=7 dest: 5}, { cond=(AND p0 p2 p3 (NOT p5)), acceptance={0, 1, 2, 3} source=7 dest: 5}, { cond=(AND p0 (NOT p4) p3 (NOT p5)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p3 p5)), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p0 p2 p3 (NOT p5)), acceptance={1, 2, 3} source=7 dest: 7}, { cond=(AND p0 (NOT p4) p3 (NOT p5)), acceptance={} source=7 dest: 10}, { cond=(AND p0 p3), acceptance={} source=7 dest: 11}, { cond=(AND p0 p4 p2 p3 (NOT p5)), acceptance={} source=7 dest: 12}, { cond=(AND p0 p4 p2 p3 (NOT p5)), acceptance={} source=7 dest: 13}, { cond=(AND p0 p4 p3 (NOT p5)), acceptance={} source=7 dest: 15}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p5)), acceptance={} source=7 dest: 20}, { cond=(AND (NOT p0) p3 p5), acceptance={} source=7 dest: 22}, { cond=(AND p0 (NOT p2) p3 (NOT p5)), acceptance={0, 2, 3} source=7 dest: 24}, { cond=(AND p0 (NOT p2) p3 (NOT p5)), acceptance={2, 3} source=7 dest: 25}, { cond=(AND p0 p4 (NOT p2) p3 (NOT p5)), acceptance={} source=7 dest: 26}, { cond=(AND p0 p4 (NOT p2) p3 (NOT p5)), acceptance={} source=7 dest: 27}], [{ cond=(AND (NOT p4) p2 p3 p1), acceptance={} source=8 dest: 8}, { cond=(AND p4 p2 p3 p1), acceptance={} source=8 dest: 14}, { cond=(AND p4 p2 (NOT p3) (NOT p1)), acceptance={} source=8 dest: 16}, { cond=(AND (NOT p4) p2 (NOT p3) (NOT p1)), acceptance={} source=8 dest: 17}, { cond=(AND (NOT p4) p2 p3 (NOT p1)), acceptance={} source=8 dest: 18}, { cond=(AND p4 p2 p3 (NOT p1)), acceptance={} source=8 dest: 19}, { cond=(AND (NOT p4) p2 (NOT p3) p1), acceptance={} source=8 dest: 28}, { cond=(AND p4 p2 (NOT p3) p1), acceptance={} source=8 dest: 29}], [{ cond=(AND p2 (NOT p3) (NOT p5) (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND p3 p5 p1), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p3) (NOT p5) (NOT p1)), acceptance={} source=9 dest: 20}, { cond=(AND p3 (NOT p5) (NOT p1)), acceptance={} source=9 dest: 21}, { cond=(AND (NOT p3) p5 (NOT p1)), acceptance={} source=9 dest: 22}, { cond=(AND p3 p5 (NOT p1)), acceptance={} source=9 dest: 23}, { cond=(AND (NOT p3) (NOT p5) p1), acceptance={} source=9 dest: 30}, { cond=(AND (NOT p3) p5 p1), acceptance={} source=9 dest: 31}, { cond=(AND p3 (NOT p5) p1), acceptance={} source=9 dest: 32}], [{ cond=(AND p0 (NOT p4) p2 (NOT p3) p1), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p4) p2 p1), acceptance={} source=10 dest: 10}, { cond=(AND p0 p4 p2 (NOT p3) p1), acceptance={} source=10 dest: 14}, { cond=(AND p0 p4 p2 p1), acceptance={} source=10 dest: 15}, { cond=(AND (NOT p0) p4 p2 p3 (NOT p1)), acceptance={} source=10 dest: 16}, { cond=(AND (NOT p0) (NOT p4) p2 p3 (NOT p1)), acceptance={} source=10 dest: 17}, { cond=(AND p0 (NOT p4) p2 (NOT p3) (NOT p1)), acceptance={} source=10 dest: 18}, { cond=(AND p0 p4 p2 (NOT p3) (NOT p1)), acceptance={} source=10 dest: 19}, { cond=(AND (NOT p0) (NOT p4) p2 p3 p1), acceptance={} source=10 dest: 28}, { cond=(AND (NOT p0) p4 p2 p3 p1), acceptance={} source=10 dest: 29}, { cond=(AND p0 (NOT p4) p2 (NOT p1)), acceptance={} source=10 dest: 33}, { cond=(AND p0 p4 p2 (NOT p1)), acceptance={} source=10 dest: 34}], [{ cond=(AND (NOT p0) p2 p3 (NOT p5) (NOT p1)), acceptance={} source=11 dest: 3}, { cond=(AND p0 (NOT p3) p5 p1), acceptance={} source=11 dest: 9}, { cond=(AND p0 p5 p1), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p5) (NOT p1)), acceptance={} source=11 dest: 20}, { cond=(AND p0 (NOT p3) (NOT p5) (NOT p1)), acceptance={} source=11 dest: 21}, { cond=(AND (NOT p0) p3 p5 (NOT p1)), acceptance={} source=11 dest: 22}, { cond=(AND p0 (NOT p3) p5 (NOT p1)), acceptance={} source=11 dest: 23}, { cond=(AND (NOT p0) p3 (NOT p5) p1), acceptance={} source=11 dest: 30}, { cond=(AND (NOT p0) p3 p5 p1), acceptance={} source=11 dest: 31}, { cond=(AND p0 (NOT p3) (NOT p5) p1), acceptance={} source=11 dest: 32}, { cond=(AND p0 p2 (NOT p5) (NOT p1)), acceptance={} source=11 dest: 35}, { cond=(AND p0 (NOT p2) (NOT p5) (NOT p1)), acceptance={} source=11 dest: 36}, { cond=(AND p0 (NOT p5) p1), acceptance={} source=11 dest: 37}, { cond=(AND p0 p5 (NOT p1)), acceptance={} source=11 dest: 38}], [{ cond=(AND p0 (NOT p4) p3), acceptance={0, 1, 3} source=12 dest: 4}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={0, 1, 2, 3} source=12 dest: 4}, { cond=(AND p0 (NOT p4) (NOT p2) (NOT p3)), acceptance={2, 3} source=12 dest: 6}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={1, 2, 3} source=12 dest: 6}, { cond=(AND p0 (NOT p4)), acceptance={} source=12 dest: 8}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={} source=12 dest: 10}, { cond=(OR (AND p0 p4 (NOT p2)) (AND p0 p4 p3)), acceptance={0, 1, 3} source=12 dest: 12}, { cond=(AND p0 p4 p2 (NOT p3)), acceptance={0, 1, 2, 3} source=12 dest: 12}, { cond=(AND p0 p4 p2 (NOT p3)), acceptance={1, 2, 3} source=12 dest: 13}, { cond=(AND p0 p4), acceptance={} source=12 dest: 14}, { cond=(AND p0 p4 (NOT p3)), acceptance={} source=12 dest: 15}, { cond=(AND (NOT p0) p4 p2 (NOT p3)), acceptance={} source=12 dest: 16}, { cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=12 dest: 17}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=12 dest: 18}, { cond=(AND (NOT p0) p4 p3), acceptance={} source=12 dest: 19}, { cond=(AND p0 p4 (NOT p2) (NOT p3)), acceptance={0, 2, 3} source=12 dest: 26}, { cond=(AND p0 p4 (NOT p2) (NOT p3)), acceptance={2, 3} source=12 dest: 27}, { cond=(AND (NOT p0) p4 (NOT p2) (NOT p3)), acceptance={} source=12 dest: 39}], [{ cond=(AND p0 (NOT p4) p3), acceptance={0, 1, 2, 3} source=13 dest: 4}, { cond=(OR (AND p0 (NOT p4) (NOT p2)) (AND p0 (NOT p4) p3)), acceptance={1, 2, 3} source=13 dest: 6}, { cond=(AND p0 (NOT p4) p3), acceptance={} source=13 dest: 10}, { cond=(OR (AND p0 p4 (NOT p2)) (AND p0 p4 p3)), acceptance={0, 1, 2, 3} source=13 dest: 12}, { cond=(OR (AND p0 p4 (NOT p2)) (AND p0 p4 p3)), acceptance={1, 2, 3} source=13 dest: 13}, { cond=(AND p0 p4 p3), acceptance={} source=13 dest: 15}, { cond=(OR (AND (NOT p0) p4 (NOT p2)) (AND (NOT p0) p4 p3)), acceptance={} source=13 dest: 16}, { cond=(OR (AND (NOT p0) (NOT p4) (NOT p2)) (AND (NOT p0) (NOT p4) p3)), acceptance={} source=13 dest: 17}], [{ cond=(AND (NOT p4) p3 p1), acceptance={} source=14 dest: 8}, { cond=(AND p4 p3 p1), acceptance={} source=14 dest: 14}, { cond=(AND p4 p2 (NOT p3) (NOT p1)), acceptance={} source=14 dest: 16}, { cond=(AND (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=14 dest: 17}, { cond=(AND (NOT p4) p3 (NOT p1)), acceptance={} source=14 dest: 18}, { cond=(AND p4 p3 (NOT p1)), acceptance={} source=14 dest: 19}, { cond=(AND (NOT p4) (NOT p3) p1), acceptance={} source=14 dest: 28}, { cond=(AND p4 (NOT p3) p1), acceptance={} source=14 dest: 29}, { cond=(AND p4 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=14 dest: 39}], [{ cond=(AND p0 (NOT p4) (NOT p3) p1), acceptance={} source=15 dest: 8}, { cond=(AND p0 (NOT p4) p1), acceptance={} source=15 dest: 10}, { cond=(AND p0 p4 (NOT p3) p1), acceptance={} source=15 dest: 14}, { cond=(AND p0 p4 p1), acceptance={} source=15 dest: 15}, { cond=(AND (NOT p0) p4 p2 p3 (NOT p1)), acceptance={} source=15 dest: 16}, { cond=(AND (NOT p0) (NOT p4) p3 (NOT p1)), acceptance={} source=15 dest: 17}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=15 dest: 18}, { cond=(AND p0 p4 (NOT p3) (NOT p1)), acceptance={} source=15 dest: 19}, { cond=(AND (NOT p0) (NOT p4) p3 p1), acceptance={} source=15 dest: 28}, { cond=(AND (NOT p0) p4 p3 p1), acceptance={} source=15 dest: 29}, { cond=(AND p0 (NOT p4) (NOT p1)), acceptance={} source=15 dest: 33}, { cond=(AND p0 p4 p2 (NOT p1)), acceptance={} source=15 dest: 34}, { cond=(AND (NOT p0) p4 (NOT p2) p3 (NOT p1)), acceptance={} source=15 dest: 39}, { cond=(AND p0 p4 (NOT p2) (NOT p1)), acceptance={} source=15 dest: 40}], [{ cond=p4, acceptance={0, 1, 2, 3} source=16 dest: 16}, { cond=(NOT p4), acceptance={0, 1, 2, 3} source=16 dest: 17}], [{ cond=(AND p4 p2), acceptance={0, 1, 2, 3} source=17 dest: 16}, { cond=(AND (NOT p4) p2), acceptance={0, 1, 2, 3} source=17 dest: 17}], [{ cond=(AND p4 p2 (NOT p3)), acceptance={} source=18 dest: 16}, { cond=(AND (NOT p4) p2 (NOT p3)), acceptance={} source=18 dest: 17}, { cond=(AND (NOT p4) p2 p3), acceptance={} source=18 dest: 18}, { cond=(AND p4 p2 p3), acceptance={} source=18 dest: 19}], [{ cond=(AND p4 p2 (NOT p3)), acceptance={} source=19 dest: 16}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=19 dest: 17}, { cond=(AND (NOT p4) p3), acceptance={} source=19 dest: 18}, { cond=(AND p4 p3), acceptance={} source=19 dest: 19}, { cond=(AND p4 (NOT p2) (NOT p3)), acceptance={} source=19 dest: 39}], [{ cond=p2, acceptance={} source=20 dest: 3}, { cond=(NOT p2), acceptance={} source=20 dest: 20}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=21 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=21 dest: 20}, { cond=p3, acceptance={} source=21 dest: 21}], [{ cond=(AND p2 (NOT p5)), acceptance={} source=22 dest: 3}, { cond=(AND (NOT p2) (NOT p5)), acceptance={} source=22 dest: 20}, { cond=p5, acceptance={} source=22 dest: 22}], [{ cond=(AND p2 (NOT p3) (NOT p5)), acceptance={} source=23 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p5)), acceptance={} source=23 dest: 20}, { cond=(AND p3 (NOT p5)), acceptance={} source=23 dest: 21}, { cond=(AND (NOT p3) p5), acceptance={} source=23 dest: 22}, { cond=(AND p3 p5), acceptance={} source=23 dest: 23}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p5)), acceptance={} source=24 dest: 3}, { cond=(AND p0 (NOT p4) (NOT p5)), acceptance={} source=24 dest: 4}, { cond=(AND p0 p2 p3 p5), acceptance={0, 1} source=24 dest: 5}, { cond=(AND p0 p2 (NOT p3) p5), acceptance={0, 1, 2} source=24 dest: 5}, { cond=(AND p0 p2 p3 (NOT p5)), acceptance={0, 1, 3} source=24 dest: 5}, { cond=(AND p0 p2 (NOT p3) (NOT p5)), acceptance={0, 1, 2, 3} source=24 dest: 5}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p5)), acceptance={} source=24 dest: 6}, { cond=(AND p0 p2 (NOT p3) p5), acceptance={1, 2} source=24 dest: 7}, { cond=(AND p0 p2 (NOT p3) (NOT p5)), acceptance={1, 2, 3} source=24 dest: 7}, { cond=(AND p0 (NOT p4) (NOT p5)), acceptance={} source=24 dest: 8}, { cond=p0, acceptance={} source=24 dest: 9}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p5)), acceptance={} source=24 dest: 10}, { cond=(AND p0 (NOT p3)), acceptance={} source=24 dest: 11}, { cond=(AND p0 p4 p2 (NOT p5)), acceptance={} source=24 dest: 12}, { cond=(AND p0 p4 p2 (NOT p3) (NOT p5)), acceptance={} source=24 dest: 13}, { cond=(AND p0 p4 (NOT p5)), acceptance={} source=24 dest: 14}, { cond=(AND p0 p4 (NOT p3) (NOT p5)), acceptance={} source=24 dest: 15}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p5)), acceptance={} source=24 dest: 20}, { cond=(AND (NOT p0) p3 (NOT p5)), acceptance={} source=24 dest: 21}, { cond=(AND (NOT p0) (NOT p3) p5), acceptance={} source=24 dest: 22}, { cond=(AND (NOT p0) p3 p5), acceptance={} source=24 dest: 23}, { cond=(AND p0 (NOT p2) p3 p5), acceptance={0} source=24 dest: 24}, { cond=(AND p0 (NOT p2) (NOT p3) p5), acceptance={0, 2} source=24 dest: 24}, { cond=(AND p0 (NOT p2) p3 (NOT p5)), acceptance={0, 3} source=24 dest: 24}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p5)), acceptance={0, 2, 3} source=24 dest: 24}, { cond=(AND p0 (NOT p2) (NOT p3) p5), acceptance={2} source=24 dest: 25}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p5)), acceptance={2, 3} source=24 dest: 25}, { cond=(AND p0 p4 (NOT p2) (NOT p5)), acceptance={} source=24 dest: 26}, { cond=(AND p0 p4 (NOT p2) (NOT p3) (NOT p5)), acceptance={} source=24 dest: 27}], [{ cond=(AND (NOT p0) p2 p3 (NOT p5)), acceptance={} source=25 dest: 3}, { cond=(AND p0 (NOT p4) p3 (NOT p5)), acceptance={} source=25 dest: 4}, { cond=(AND p0 p2 p3 p5), acceptance={0, 1, 2} source=25 dest: 5}, { cond=(AND p0 p2 p3 (NOT p5)), acceptance={0, 1, 2, 3} source=25 dest: 5}, { cond=(AND p0 (NOT p4) p3 (NOT p5)), acceptance={} source=25 dest: 6}, { cond=(AND p0 p2 p3 p5), acceptance={1, 2} source=25 dest: 7}, { cond=(AND p0 p2 p3 (NOT p5)), acceptance={1, 2, 3} source=25 dest: 7}, { cond=(AND p0 (NOT p4) p3 (NOT p5)), acceptance={} source=25 dest: 10}, { cond=(AND p0 p3), acceptance={} source=25 dest: 11}, { cond=(AND p0 p4 p2 p3 (NOT p5)), acceptance={} source=25 dest: 12}, { cond=(AND p0 p4 p2 p3 (NOT p5)), acceptance={} source=25 dest: 13}, { cond=(AND p0 p4 p3 (NOT p5)), acceptance={} source=25 dest: 15}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p5)), acceptance={} source=25 dest: 20}, { cond=(AND (NOT p0) p3 p5), acceptance={} source=25 dest: 22}, { cond=(AND p0 (NOT p2) p3 p5), acceptance={0, 2} source=25 dest: 24}, { cond=(AND p0 (NOT p2) p3 (NOT p5)), acceptance={0, 2, 3} source=25 dest: 24}, { cond=(AND p0 (NOT p2) p3 p5), acceptance={2} source=25 dest: 25}, { cond=(AND p0 (NOT p2) p3 (NOT p5)), acceptance={2, 3} source=25 dest: 25}, { cond=(AND p0 p4 (NOT p2) p3 (NOT p5)), acceptance={} source=25 dest: 26}, { cond=(AND p0 p4 (NOT p2) p3 (NOT p5)), acceptance={} source=25 dest: 27}], [{ cond=(AND p0 (NOT p4) (NOT p2) p3), acceptance={0, 3} source=26 dest: 4}, { cond=(AND p0 (NOT p4) p2 p3), acceptance={0, 1, 3} source=26 dest: 4}, { cond=(AND p0 (NOT p4) (NOT p2) (NOT p3)), acceptance={0, 2, 3} source=26 dest: 4}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={0, 1, 2, 3} source=26 dest: 4}, { cond=(AND p0 (NOT p4) (NOT p2) (NOT p3)), acceptance={2, 3} source=26 dest: 6}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={1, 2, 3} source=26 dest: 6}, { cond=(AND p0 (NOT p4)), acceptance={} source=26 dest: 8}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={} source=26 dest: 10}, { cond=(AND p0 p4 p2 p3), acceptance={0, 1, 3} source=26 dest: 12}, { cond=(AND p0 p4 p2 (NOT p3)), acceptance={0, 1, 2, 3} source=26 dest: 12}, { cond=(AND p0 p4 p2 (NOT p3)), acceptance={1, 2, 3} source=26 dest: 13}, { cond=(AND p0 p4), acceptance={} source=26 dest: 14}, { cond=(AND p0 p4 (NOT p3)), acceptance={} source=26 dest: 15}, { cond=(AND (NOT p0) p4 p2 (NOT p3)), acceptance={} source=26 dest: 16}, { cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=26 dest: 17}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=26 dest: 18}, { cond=(AND (NOT p0) p4 p3), acceptance={} source=26 dest: 19}, { cond=(AND p0 p4 (NOT p2) p3), acceptance={0, 3} source=26 dest: 26}, { cond=(AND p0 p4 (NOT p2) (NOT p3)), acceptance={0, 2, 3} source=26 dest: 26}, { cond=(AND p0 p4 (NOT p2) (NOT p3)), acceptance={2, 3} source=26 dest: 27}, { cond=(AND (NOT p0) p4 (NOT p2) (NOT p3)), acceptance={} source=26 dest: 39}], [{ cond=(AND p0 (NOT p4) (NOT p2) p3), acceptance={0, 2, 3} source=27 dest: 4}, { cond=(AND p0 (NOT p4) p2 p3), acceptance={0, 1, 2, 3} source=27 dest: 4}, { cond=(AND p0 (NOT p4) (NOT p2) p3), acceptance={2, 3} source=27 dest: 6}, { cond=(AND p0 (NOT p4) p2 p3), acceptance={1, 2, 3} source=27 dest: 6}, { cond=(AND p0 (NOT p4) p3), acceptance={} source=27 dest: 10}, { cond=(AND p0 p4 p2 p3), acceptance={0, 1, 2, 3} source=27 dest: 12}, { cond=(AND p0 p4 p2 p3), acceptance={1, 2, 3} source=27 dest: 13}, { cond=(AND p0 p4 p3), acceptance={} source=27 dest: 15}, { cond=(AND (NOT p0) p4 p2 p3), acceptance={} source=27 dest: 16}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=27 dest: 17}, { cond=(AND p0 p4 (NOT p2) p3), acceptance={0, 2, 3} source=27 dest: 26}, { cond=(AND p0 p4 (NOT p2) p3), acceptance={2, 3} source=27 dest: 27}, { cond=(AND (NOT p0) p4 (NOT p2) p3), acceptance={} source=27 dest: 39}], [{ cond=(AND p4 p2 (NOT p1)), acceptance={} source=28 dest: 16}, { cond=(AND (NOT p4) p2 (NOT p1)), acceptance={} source=28 dest: 17}, { cond=(AND (NOT p4) p2 p1), acceptance={} source=28 dest: 28}, { cond=(AND p4 p2 p1), acceptance={} source=28 dest: 29}], [{ cond=(AND p4 p2 (NOT p1)), acceptance={} source=29 dest: 16}, { cond=(AND (NOT p4) (NOT p1)), acceptance={} source=29 dest: 17}, { cond=(AND (NOT p4) p1), acceptance={} source=29 dest: 28}, { cond=(AND p4 p1), acceptance={} source=29 dest: 29}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=29 dest: 39}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=30 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=30 dest: 20}, { cond=p1, acceptance={} source=30 dest: 30}], [{ cond=(AND p2 (NOT p5) (NOT p1)), acceptance={} source=31 dest: 3}, { cond=(AND (NOT p2) (NOT p5) (NOT p1)), acceptance={} source=31 dest: 20}, { cond=(AND p5 (NOT p1)), acceptance={} source=31 dest: 22}, { cond=(AND (NOT p5) p1), acceptance={} source=31 dest: 30}, { cond=(AND p5 p1), acceptance={} source=31 dest: 31}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=32 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=32 dest: 20}, { cond=(AND p3 (NOT p1)), acceptance={} source=32 dest: 21}, { cond=(AND (NOT p3) p1), acceptance={} source=32 dest: 30}, { cond=(AND p3 p1), acceptance={} source=32 dest: 32}], [{ cond=(AND (NOT p0) p4 p2 p3), acceptance={} source=33 dest: 16}, { cond=(AND (NOT p0) (NOT p4) p2 p3), acceptance={} source=33 dest: 17}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={} source=33 dest: 18}, { cond=(AND p0 p4 p2 (NOT p3)), acceptance={} source=33 dest: 19}, { cond=(AND p0 (NOT p4) p2), acceptance={} source=33 dest: 33}, { cond=(AND p0 p4 p2), acceptance={} source=33 dest: 34}], [{ cond=(OR (AND (NOT p0) p4 (NOT p2)) (AND (NOT p0) p4 p3)), acceptance={} source=34 dest: 16}, { cond=(OR (AND (NOT p0) (NOT p4) (NOT p2)) (AND (NOT p0) (NOT p4) p3)), acceptance={} source=34 dest: 17}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={} source=34 dest: 18}, { cond=(AND p0 p4 (NOT p3)), acceptance={} source=34 dest: 19}, { cond=(AND p0 (NOT p4)), acceptance={} source=34 dest: 33}, { cond=(AND p0 p4), acceptance={} source=34 dest: 34}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), acceptance={} source=35 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=35 dest: 21}, { cond=p0, acceptance={} source=35 dest: 35}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=36 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=36 dest: 20}, { cond=(AND p0 (NOT p3)), acceptance={} source=36 dest: 21}, { cond=(AND p0 p2), acceptance={} source=36 dest: 35}, { cond=(AND p0 (NOT p2)), acceptance={} source=36 dest: 36}], [{ cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=37 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=37 dest: 20}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=37 dest: 21}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=37 dest: 30}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=37 dest: 32}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=37 dest: 35}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=37 dest: 36}, { cond=(AND p0 p1), acceptance={} source=37 dest: 37}], [{ cond=(AND (NOT p0) p2 p3 (NOT p5)), acceptance={} source=38 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p5)), acceptance={} source=38 dest: 20}, { cond=(AND p0 (NOT p3) (NOT p5)), acceptance={} source=38 dest: 21}, { cond=(AND (NOT p0) p3 p5), acceptance={} source=38 dest: 22}, { cond=(AND p0 (NOT p3) p5), acceptance={} source=38 dest: 23}, { cond=(AND p0 p2 (NOT p5)), acceptance={} source=38 dest: 35}, { cond=(AND p0 (NOT p2) (NOT p5)), acceptance={} source=38 dest: 36}, { cond=(AND p0 p5), acceptance={} source=38 dest: 38}], [{ cond=(AND p4 p2), acceptance={} source=39 dest: 16}, { cond=(NOT p4), acceptance={} source=39 dest: 17}, { cond=(AND p4 (NOT p2)), acceptance={} source=39 dest: 39}], [{ cond=(AND (NOT p0) p4 p2 p3), acceptance={} source=40 dest: 16}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=40 dest: 17}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={} source=40 dest: 18}, { cond=(AND p0 p4 (NOT p3)), acceptance={} source=40 dest: 19}, { cond=(AND p0 (NOT p4)), acceptance={} source=40 dest: 33}, { cond=(AND p0 p4 p2), acceptance={} source=40 dest: 34}, { cond=(AND (NOT p0) p4 (NOT p2) p3), acceptance={} source=40 dest: 39}, { cond=(AND p0 p4 (NOT p2)), acceptance={} source=40 dest: 40}]], initial=0, aps=[p0:(OR (AND (GEQ s64 1) (GEQ s107 1)) (AND (GEQ s103 1) (GEQ s107 1)) (AND (GEQ s84 1) (GEQ s107 1)) (AND (GEQ s93 1) (GEQ s107 1)) (AND (GEQ s104 1) (GEQ...], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 191 steps with 1 reset in 13 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-01 finished in 6690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||(!p1 U (p2||G(!p1)))))&&F(!p1)))'
Support contains 77 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 32 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:36:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:17] [INFO ] Invariant cache hit.
[2023-03-12 07:36:18] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
[2023-03-12 07:36:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:18] [INFO ] Invariant cache hit.
[2023-03-12 07:36:18] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-12 07:36:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:18] [INFO ] Invariant cache hit.
[2023-03-12 07:36:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:19] [INFO ] Implicit Places using invariants and state equation in 811 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1008 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1971 ms. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 340 ms :[p1, p1, (AND p1 (NOT p0) (NOT p2)), true, (AND p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s108 1) (GEQ s121 1)) (AND (GEQ s108 1) (GEQ s120 1)) (AND (GEQ s108 1) (GEQ s119 1)) (AND (GEQ s108 1) (GEQ s118 1)) (AND (GEQ s108 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 13 steps with 3 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-02 finished in 2385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 73 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2344
Applied a total of 9 rules in 566 ms. Remains 131 /136 variables (removed 5) and now considering 2344/2348 (removed 4) transitions.
[2023-03-12 07:36:20] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2023-03-12 07:36:20] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 07:36:20] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-12 07:36:20] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 07:36:20] [INFO ] Invariant cache hit.
[2023-03-12 07:36:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:21] [INFO ] Implicit Places using invariants and state equation in 910 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1122 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/136 places, 2344/2348 transitions.
Applied a total of 0 rules in 370 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2060 ms. Remains : 129/136 places, 2344/2348 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s89 1) (GEQ s104 1) (GEQ s113 1)) (AND (GEQ s0 1) (GEQ s101 1) (GEQ s104 1) (GEQ s114 1)) (AND (GEQ s0 1) (GEQ s77 1) (GEQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11685 steps with 70 reset in 385 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-03 finished in 2600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 125 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 17 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:36:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:36:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:36:23] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
[2023-03-12 07:36:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:23] [INFO ] Invariant cache hit.
[2023-03-12 07:36:23] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 07:36:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:23] [INFO ] Invariant cache hit.
[2023-03-12 07:36:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:24] [INFO ] Implicit Places using invariants and state equation in 513 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 586 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 9 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1463 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s92 1) (GEQ s107 1) (GEQ s116 1)) (AND (GEQ s1 1) (GEQ s104 1) (GEQ s107 1) (GEQ s117 1)) (AND (GEQ s1 1) (GEQ s80 1) (GEQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 6372 ms.
Product exploration explored 100000 steps with 50000 reset in 6356 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-04 finished in 14638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 53 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 287 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:36:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:37] [INFO ] Invariant cache hit.
[2023-03-12 07:36:38] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
[2023-03-12 07:36:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:38] [INFO ] Invariant cache hit.
[2023-03-12 07:36:38] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-12 07:36:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:38] [INFO ] Invariant cache hit.
[2023-03-12 07:36:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:39] [INFO ] Implicit Places using invariants and state equation in 993 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1237 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 320 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2663 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s105 1) (GEQ s108 1)) (AND (GEQ s0 1) (GEQ s97 1) (GEQ s105 1) (GEQ s108 1)) (AND (GEQ s0 1) (GEQ s90 1) (GEQ s105...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 911 reset in 1002 ms.
Product exploration explored 100000 steps with 901 reset in 843 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 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 67 ms :[(NOT p0)]
Finished random walk after 164 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 345 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-12 07:36:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 07:36:42] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:36:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:36:45] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2023-03-12 07:36:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:36:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:36:46] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-12 07:36:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 459 ms returned sat
[2023-03-12 07:36:47] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 155 ms.
[2023-03-12 07:36:47] [INFO ] Added : 66 causal constraints over 14 iterations in 544 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 53 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 256 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:36:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:47] [INFO ] Invariant cache hit.
[2023-03-12 07:36:48] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
[2023-03-12 07:36:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:48] [INFO ] Invariant cache hit.
[2023-03-12 07:36:48] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-12 07:36:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:48] [INFO ] Invariant cache hit.
[2023-03-12 07:36:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:50] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
[2023-03-12 07:36:50] [INFO ] Redundant transitions in 160 ms returned []
[2023-03-12 07:36:50] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:50] [INFO ] Invariant cache hit.
[2023-03-12 07:36:51] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3573 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 246 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 38 ms :[(NOT p0)]
Finished random walk after 164 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 184 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-12 07:36:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:51] [INFO ] Invariant cache hit.
[2023-03-12 07:36:53] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:36:53] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2023-03-12 07:36:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:36:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:36:55] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-12 07:36:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:36:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 336 ms returned sat
[2023-03-12 07:36:55] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 75 ms.
[2023-03-12 07:36:55] [INFO ] Added : 69 causal constraints over 14 iterations in 392 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 907 reset in 879 ms.
Product exploration explored 100000 steps with 898 reset in 891 ms.
Support contains 53 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 254 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:36:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:36:58] [INFO ] Invariant cache hit.
[2023-03-12 07:37:00] [INFO ] Dead Transitions using invariants and state equation in 2497 ms found 0 transitions.
[2023-03-12 07:37:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:00] [INFO ] Invariant cache hit.
[2023-03-12 07:37:00] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-12 07:37:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:00] [INFO ] Invariant cache hit.
[2023-03-12 07:37:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:37:01] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2023-03-12 07:37:01] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-12 07:37:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:01] [INFO ] Invariant cache hit.
[2023-03-12 07:37:02] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4863 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-05 finished in 25611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))&&G(p1))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:37:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:37:03] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:37:08] [INFO ] Dead Transitions using invariants and state equation in 5406 ms found 0 transitions.
[2023-03-12 07:37:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:37:08] [INFO ] Invariant cache hit.
[2023-03-12 07:37:08] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-12 07:37:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:37:08] [INFO ] Invariant cache hit.
[2023-03-12 07:37:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:37:09] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1427 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 18 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6875 ms. Remains : 134/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(GEQ s105 1), p0:(OR (AND (GEQ s0 50) (GEQ s133 1)) (AND (GEQ s0 50) (GEQ s132 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-07 finished in 7204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 53 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 18 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:37:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:37:10] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:37:11] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
[2023-03-12 07:37:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:11] [INFO ] Invariant cache hit.
[2023-03-12 07:37:11] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 07:37:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:11] [INFO ] Invariant cache hit.
[2023-03-12 07:37:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:37:12] [INFO ] Implicit Places using invariants and state equation in 831 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2342 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-08 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 s0 1) (GEQ s51 1) (GEQ s53 1) (GEQ s107 1)) (AND (GEQ s0 1) (GEQ s27 1) (GEQ s53 1) (GEQ s107 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s53 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 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-08 finished in 2466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 74 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 362 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:37:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:37:13] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:37:13] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
[2023-03-12 07:37:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:13] [INFO ] Invariant cache hit.
[2023-03-12 07:37:14] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-12 07:37:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:14] [INFO ] Invariant cache hit.
[2023-03-12 07:37:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:37:14] [INFO ] Implicit Places using invariants and state equation in 622 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 781 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 311 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2327 ms. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s104 1) (AND (GEQ s45 1) (GEQ s53 1) (GEQ s107 1) (GEQ s118 1)) (AND (GEQ s28 1) (GEQ s53 1) (GEQ s107 1) (GEQ s124 1)) (AND (GEQ s7 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1031 reset in 3631 ms.
Product exploration explored 100000 steps with 1039 reset in 3411 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 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 48 ms :[(NOT p0)]
Finished random walk after 109 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 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 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-12 07:37:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 07:37:23] [INFO ] Computed 5 place invariants in 21 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 07:37:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 74 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 238 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:37:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:44] [INFO ] Invariant cache hit.
[2023-03-12 07:37:45] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
[2023-03-12 07:37:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:45] [INFO ] Invariant cache hit.
[2023-03-12 07:37:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-12 07:37:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:45] [INFO ] Invariant cache hit.
[2023-03-12 07:37:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:37:45] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-12 07:37:45] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-12 07:37:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:45] [INFO ] Invariant cache hit.
[2023-03-12 07:37:46] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2415 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 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 24 ms :[(NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-12 07:37:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:37:47] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 07:38:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1016 reset in 3665 ms.
Product exploration explored 100000 steps with 1003 reset in 3711 ms.
Support contains 74 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 291 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:38:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:16] [INFO ] Invariant cache hit.
[2023-03-12 07:38:17] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
[2023-03-12 07:38:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:17] [INFO ] Invariant cache hit.
[2023-03-12 07:38:17] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-12 07:38:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:17] [INFO ] Invariant cache hit.
[2023-03-12 07:38:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:17] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2023-03-12 07:38:17] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-12 07:38:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:17] [INFO ] Invariant cache hit.
[2023-03-12 07:38:18] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3042 ms. Remains : 133/133 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-09 finished in 66630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 278 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:38:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:38:19] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 07:38:20] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
[2023-03-12 07:38:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:20] [INFO ] Invariant cache hit.
[2023-03-12 07:38:20] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-12 07:38:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:20] [INFO ] Invariant cache hit.
[2023-03-12 07:38:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:21] [INFO ] Implicit Places using invariants and state equation in 939 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1310 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 236 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2794 ms. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 274 reset in 904 ms.
Product exploration explored 100000 steps with 274 reset in 775 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 228 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:38:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 07:38:24] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:38:25] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
[2023-03-12 07:38:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:25] [INFO ] Invariant cache hit.
[2023-03-12 07:38:26] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 07:38:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:26] [INFO ] Invariant cache hit.
[2023-03-12 07:38:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:26] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-03-12 07:38:26] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-12 07:38:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:26] [INFO ] Invariant cache hit.
[2023-03-12 07:38:28] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3388 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Finished random walk after 135 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 274 reset in 853 ms.
Product exploration explored 100000 steps with 274 reset in 698 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 221 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:38:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:30] [INFO ] Invariant cache hit.
[2023-03-12 07:38:31] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
[2023-03-12 07:38:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:31] [INFO ] Invariant cache hit.
[2023-03-12 07:38:31] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-12 07:38:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:31] [INFO ] Invariant cache hit.
[2023-03-12 07:38:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:32] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2023-03-12 07:38:32] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-12 07:38:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:32] [INFO ] Invariant cache hit.
[2023-03-12 07:38:33] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3229 ms. Remains : 133/133 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-10 finished in 14643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(!p1)))'
Support contains 23 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:38:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:38:33] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:38:34] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
[2023-03-12 07:38:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:38:34] [INFO ] Invariant cache hit.
[2023-03-12 07:38:35] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-12 07:38:35] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:38:35] [INFO ] Invariant cache hit.
[2023-03-12 07:38:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:36] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1501 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2432 ms. Remains : 134/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 407 ms :[(NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 3}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (AND (GEQ s109 1) (GEQ s122 1)) (AND (GEQ s109 1) (GEQ s121 1)) (AND (GEQ s109 1) (GEQ s120 1)) (AND (GEQ s109 1) (GEQ s119 1)) (AND (GEQ s109 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-11 finished in 2892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 22 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 20 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:38:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:38:36] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:38:37] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
[2023-03-12 07:38:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:37] [INFO ] Invariant cache hit.
[2023-03-12 07:38:38] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-12 07:38:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:38] [INFO ] Invariant cache hit.
[2023-03-12 07:38:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:39] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1492 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 22 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2381 ms. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s108 1) (GEQ s121 1)) (AND (GEQ s108 1) (GEQ s120 1)) (AND (GEQ s108 1) (GEQ s119 1)) (AND (GEQ s108 1) (GEQ s118 1)) (AND (GEQ s108 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-12 finished in 2568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 73 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2344
Applied a total of 9 rules in 404 ms. Remains 131 /136 variables (removed 5) and now considering 2344/2348 (removed 4) transitions.
[2023-03-12 07:38:39] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2023-03-12 07:38:39] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 07:38:40] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-12 07:38:40] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 07:38:40] [INFO ] Invariant cache hit.
[2023-03-12 07:38:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:40] [INFO ] Implicit Places using invariants and state equation in 606 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 844 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/136 places, 2344/2348 transitions.
Applied a total of 0 rules in 327 ms. Remains 130 /130 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1578 ms. Remains : 130/136 places, 2344/2348 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s44 1) (LT s53 1) (LT s106 1) (LT s117 1)) (OR (LT s27 1) (LT s53 1) (LT s106 1) (LT s123 1)) (OR (LT s6 1) (LT s53 1) (LT s106 1) (LT s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 307 steps with 0 reset in 20 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-13 finished in 1755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 55 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 312 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:38:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:38:41] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:38:42] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
[2023-03-12 07:38:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:42] [INFO ] Invariant cache hit.
[2023-03-12 07:38:42] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-12 07:38:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:42] [INFO ] Invariant cache hit.
[2023-03-12 07:38:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:43] [INFO ] Implicit Places using invariants and state equation in 937 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1218 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 249 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2691 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s51 1) (GEQ s53 1) (GEQ s107 1)) (AND (GEQ s0 1) (GEQ s27 1) (GEQ s53 1) (GEQ s107 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s53 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 467 reset in 992 ms.
Product exploration explored 100000 steps with 445 reset in 962 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 333 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 192 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 07:38:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 07:38:47] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:38:48] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:38:49] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-03-12 07:38:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:38:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:38:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:38:50] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2023-03-12 07:38:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 638 ms returned sat
[2023-03-12 07:38:51] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 100 ms.
[2023-03-12 07:38:51] [INFO ] Added : 29 causal constraints over 7 iterations in 334 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-12 07:38:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:51] [INFO ] Invariant cache hit.
[2023-03-12 07:38:52] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:38:52] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-12 07:38:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:38:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:38:54] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2023-03-12 07:38:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:54] [INFO ] [Nat]Added 42 Read/Feed constraints in 63 ms returned sat
[2023-03-12 07:38:54] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 78 ms.
[2023-03-12 07:38:54] [INFO ] Added : 22 causal constraints over 6 iterations in 313 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 218 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:38:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:54] [INFO ] Invariant cache hit.
[2023-03-12 07:38:55] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
[2023-03-12 07:38:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:55] [INFO ] Invariant cache hit.
[2023-03-12 07:38:55] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-12 07:38:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:55] [INFO ] Invariant cache hit.
[2023-03-12 07:38:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:38:56] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-12 07:38:56] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-12 07:38:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:56] [INFO ] Invariant cache hit.
[2023-03-12 07:38:57] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3049 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 178 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 07:38:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:38:58] [INFO ] Invariant cache hit.
[2023-03-12 07:38:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:39:00] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-12 07:39:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:39:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:39:01] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2023-03-12 07:39:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 841 ms returned sat
[2023-03-12 07:39:02] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 8 ms to minimize.
[2023-03-12 07:39:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 728 ms
[2023-03-12 07:39:03] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 82 ms.
[2023-03-12 07:39:03] [INFO ] Added : 31 causal constraints over 11 iterations in 366 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-12 07:39:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:39:03] [INFO ] Invariant cache hit.
[2023-03-12 07:39:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:39:04] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-12 07:39:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:39:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:39:06] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2023-03-12 07:39:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:06] [INFO ] [Nat]Added 42 Read/Feed constraints in 52 ms returned sat
[2023-03-12 07:39:06] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 124 ms.
[2023-03-12 07:39:07] [INFO ] Added : 22 causal constraints over 6 iterations in 332 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 433 reset in 998 ms.
Product exploration explored 100000 steps with 472 reset in 1201 ms.
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 247 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:39:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:39:09] [INFO ] Invariant cache hit.
[2023-03-12 07:39:10] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
[2023-03-12 07:39:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:39:10] [INFO ] Invariant cache hit.
[2023-03-12 07:39:10] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-12 07:39:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:39:10] [INFO ] Invariant cache hit.
[2023-03-12 07:39:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:11] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2023-03-12 07:39:11] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-12 07:39:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:39:11] [INFO ] Invariant cache hit.
[2023-03-12 07:39:14] [INFO ] Dead Transitions using invariants and state equation in 3461 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5576 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-14 finished in 34163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0)) U !p1)))'
Support contains 107 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 387 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:39:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:39:15] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:39:16] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
[2023-03-12 07:39:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:39:16] [INFO ] Invariant cache hit.
[2023-03-12 07:39:16] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-12 07:39:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:39:16] [INFO ] Invariant cache hit.
[2023-03-12 07:39:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:17] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
[2023-03-12 07:39:17] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-12 07:39:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:39:17] [INFO ] Invariant cache hit.
[2023-03-12 07:39:19] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/136 places, 2347/2348 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3723 ms. Remains : 135/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 178 ms :[p1, p0, p1]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (OR (AND (GEQ s0 50) (GEQ s134 1)) (AND (GEQ s0 50) (GEQ s133 1))) (OR (AND (GEQ s2 1) (GEQ s52 1)) (AND (GEQ s22 1) (GEQ s52 1)) (AND (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 415 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-15 finished in 3944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-00
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 54 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 31 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:39:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:39:19] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-12 07:39:20] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
[2023-03-12 07:39:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:20] [INFO ] Invariant cache hit.
[2023-03-12 07:39:21] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-12 07:39:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:21] [INFO ] Invariant cache hit.
[2023-03-12 07:39:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:22] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1478 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 135/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 23 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2807 ms. Remains : 135/136 places, 2348/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s106 1) (GEQ s109 1)) (AND (GEQ s0 1) (GEQ s97 1) (GEQ s106 1) (GEQ s109 1)) (AND (GEQ s0 1) (GEQ s90 1) (GEQ s106...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 887 reset in 1086 ms.
Product exploration explored 100000 steps with 868 reset in 1040 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 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 (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 307 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 147 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-12 07:39:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2023-03-12 07:39:25] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:39:27] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-12 07:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:39:28] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-12 07:39:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:39:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:39:29] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-12 07:39:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:29] [INFO ] [Nat]Added 42 Read/Feed constraints in 364 ms returned sat
[2023-03-12 07:39:30] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 94 ms.
[2023-03-12 07:39:30] [INFO ] Added : 21 causal constraints over 5 iterations in 323 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 54 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 14 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:39:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:30] [INFO ] Invariant cache hit.
[2023-03-12 07:39:31] [INFO ] Dead Transitions using invariants and state equation in 1261 ms found 0 transitions.
[2023-03-12 07:39:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:31] [INFO ] Invariant cache hit.
[2023-03-12 07:39:31] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-12 07:39:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:31] [INFO ] Invariant cache hit.
[2023-03-12 07:39:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:32] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2023-03-12 07:39:32] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:32] [INFO ] Invariant cache hit.
[2023-03-12 07:39:33] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3061 ms. Remains : 135/135 places, 2348/2348 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 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 (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 140 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-12 07:39:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:34] [INFO ] Invariant cache hit.
[2023-03-12 07:39:35] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-12 07:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:39:36] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-12 07:39:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:39:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:39:39] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-12 07:39:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 286 ms returned sat
[2023-03-12 07:39:39] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 87 ms.
[2023-03-12 07:39:39] [INFO ] Added : 21 causal constraints over 5 iterations in 355 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 895 reset in 1233 ms.
Product exploration explored 100000 steps with 897 reset in 1119 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 54 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 320 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:39:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:43] [INFO ] Invariant cache hit.
[2023-03-12 07:39:44] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
[2023-03-12 07:39:44] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-12 07:39:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:44] [INFO ] Invariant cache hit.
[2023-03-12 07:39:45] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2158 ms. Remains : 135/135 places, 2348/2348 transitions.
Support contains 54 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 8 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:39:45] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:45] [INFO ] Invariant cache hit.
[2023-03-12 07:39:45] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
[2023-03-12 07:39:45] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:45] [INFO ] Invariant cache hit.
[2023-03-12 07:39:46] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-12 07:39:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:46] [INFO ] Invariant cache hit.
[2023-03-12 07:39:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:39:46] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-12 07:39:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:39:46] [INFO ] Invariant cache hit.
[2023-03-12 07:39:47] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2472 ms. Remains : 135/135 places, 2348/2348 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-00 finished in 28583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2023-03-12 07:39:48] [INFO ] Flatten gal took : 144 ms
[2023-03-12 07:39:48] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2023-03-12 07:39:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 2348 transitions and 18088 arcs took 18 ms.
Total runtime 269970 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2194/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2194/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2194/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2194/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2194/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-00
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-05
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-09
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-10
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-14

BK_STOP 1678606798646

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

+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-00
ltl formula formula --ltl=/tmp/2194/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.130 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2194/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2194/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2194/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2194/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
double free or corruption (fasttop)
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-05
ltl formula formula --ltl=/tmp/2194/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.130 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2194/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2194/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2194/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2194/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-09
ltl formula formula --ltl=/tmp/2194/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.130 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2194/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2194/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2194/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2194/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-10
ltl formula formula --ltl=/tmp/2194/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2194/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2194/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.110 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2194/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2194/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-14
ltl formula formula --ltl=/tmp/2194/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.110 user 0.180 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2194/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2194/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2194/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2194/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size

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-COL-V50P50N20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V50P50N20, 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 r041-tajo-167813694200100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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