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-167813694200059.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-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694200059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 12:12 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.4K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:26 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 41K 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-V20P20N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678602835004

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:33:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 06:33:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:33:57] [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 06:33:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 06:33:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 540 ms
[2023-03-12 06:33:57] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 06:33:57] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-12 06:33:57] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 10 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.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 06:33:58] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 06:33:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:33:58] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-12 06:33:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:33:58] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-12 06:33:58] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 06:33:58] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 80 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 2 properties in 3 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2023-03-12 06:33:58] [INFO ] Flatten gal took : 19 ms
[2023-03-12 06:33:58] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 06:33:58] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 49 ms.
[2023-03-12 06:33:58] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Support contains 15 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 40 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:33:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2023-03-12 06:33:58] [INFO ] Computed 7 place invariants in 15 ms
[2023-03-12 06:33:59] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
[2023-03-12 06:33:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:33:59] [INFO ] Invariant cache hit.
[2023-03-12 06:33:59] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-12 06:33:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:33:59] [INFO ] Invariant cache hit.
[2023-03-12 06:33:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:00] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
[2023-03-12 06:34:00] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:00] [INFO ] Invariant cache hit.
[2023-03-12 06:34:02] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3367 ms. Remains : 108/108 places, 2228/2228 transitions.
Support contains 15 out of 108 places after structural reductions.
[2023-03-12 06:34:02] [INFO ] Flatten gal took : 262 ms
[2023-03-12 06:34:02] [INFO ] Flatten gal took : 218 ms
[2023-03-12 06:34:03] [INFO ] Input system was already deterministic with 2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:34:03] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:03] [INFO ] Invariant cache hit.
[2023-03-12 06:34:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 06:34:04] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.42 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 U p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 367 ms. Remains 107 /108 variables (removed 1) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:34:04] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2023-03-12 06:34:04] [INFO ] Computed 6 place invariants in 18 ms
[2023-03-12 06:34:05] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
[2023-03-12 06:34:05] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:05] [INFO ] Invariant cache hit.
[2023-03-12 06:34:06] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-12 06:34:06] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:06] [INFO ] Invariant cache hit.
[2023-03-12 06:34:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:07] [INFO ] Implicit Places using invariants and state equation in 938 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1295 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 249 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2942 ms. Remains : 105/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s23 s47), p0:(LEQ 1 (ADD s50 s51))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1687 reset in 836 ms.
Product exploration explored 100000 steps with 1635 reset in 715 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 3101 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.29 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 308 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 220 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:34:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 06:34:10] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 06:34:11] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
[2023-03-12 06:34:11] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:11] [INFO ] Invariant cache hit.
[2023-03-12 06:34:11] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-12 06:34:11] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:11] [INFO ] Invariant cache hit.
[2023-03-12 06:34:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:12] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2023-03-12 06:34:12] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-12 06:34:12] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:12] [INFO ] Invariant cache hit.
[2023-03-12 06:34:13] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3390 ms. Remains : 105/105 places, 2228/2228 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 3101 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 443 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Finished random walk after 28 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 358 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1567 reset in 673 ms.
Product exploration explored 100000 steps with 1605 reset in 680 ms.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 192 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:34:16] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:16] [INFO ] Invariant cache hit.
[2023-03-12 06:34:17] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
[2023-03-12 06:34:17] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:17] [INFO ] Invariant cache hit.
[2023-03-12 06:34:17] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 06:34:17] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:17] [INFO ] Invariant cache hit.
[2023-03-12 06:34:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:18] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2023-03-12 06:34:18] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-12 06:34:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:18] [INFO ] Invariant cache hit.
[2023-03-12 06:34:19] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3477 ms. Remains : 105/105 places, 2228/2228 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-00 finished in 15441 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 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 2227
Applied a total of 3 rules in 215 ms. Remains 105 /108 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:34:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:34:20] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-12 06:34:20] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
[2023-03-12 06:34:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:20] [INFO ] Invariant cache hit.
[2023-03-12 06:34:20] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-12 06:34:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:20] [INFO ] Invariant cache hit.
[2023-03-12 06:34:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:22] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1476 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 169 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2489 ms. Remains : 103/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01 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:(LEQ 1 s44)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1571 reset in 650 ms.
Product exploration explored 100000 steps with 1524 reset in 686 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-12 06:34:24] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 06:34:24] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:34:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:25] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-12 06:34:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:25] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 06:34:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:27] [INFO ] [Nat]Added 102 Read/Feed constraints in 1385 ms returned sat
[2023-03-12 06:34:27] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 178 ms.
[2023-03-12 06:34:27] [INFO ] Added : 39 causal constraints over 9 iterations in 475 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 201 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:34:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:27] [INFO ] Invariant cache hit.
[2023-03-12 06:34:28] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
[2023-03-12 06:34:28] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:28] [INFO ] Invariant cache hit.
[2023-03-12 06:34:28] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-12 06:34:28] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:28] [INFO ] Invariant cache hit.
[2023-03-12 06:34:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:29] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2023-03-12 06:34:29] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-12 06:34:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:29] [INFO ] Invariant cache hit.
[2023-03-12 06:34:30] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2896 ms. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2023-03-12 06:34:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:31] [INFO ] Invariant cache hit.
[2023-03-12 06:34:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:31] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-12 06:34:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:32] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-12 06:34:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:33] [INFO ] [Nat]Added 102 Read/Feed constraints in 1318 ms returned sat
[2023-03-12 06:34:33] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 109 ms.
[2023-03-12 06:34:33] [INFO ] Added : 39 causal constraints over 9 iterations in 406 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1574 reset in 778 ms.
Product exploration explored 100000 steps with 1533 reset in 663 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 167 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:34:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:35] [INFO ] Invariant cache hit.
[2023-03-12 06:34:36] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
[2023-03-12 06:34:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:36] [INFO ] Invariant cache hit.
[2023-03-12 06:34:36] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-12 06:34:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:36] [INFO ] Invariant cache hit.
[2023-03-12 06:34:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:37] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2023-03-12 06:34:37] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-12 06:34:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:37] [INFO ] Invariant cache hit.
[2023-03-12 06:34:38] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3195 ms. Remains : 103/103 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01 finished in 18925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1&&F(p0)))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 2227
Applied a total of 3 rules in 251 ms. Remains 106 /108 variables (removed 2) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:34:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 106 cols
[2023-03-12 06:34:39] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 06:34:39] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
[2023-03-12 06:34:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:39] [INFO ] Invariant cache hit.
[2023-03-12 06:34:39] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-12 06:34:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:39] [INFO ] Invariant cache hit.
[2023-03-12 06:34:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:41] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned [24, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1585 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 255 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2716 ms. Remains : 104/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s22 1), p0:(LEQ s22 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02 finished in 2925 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 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2227
Applied a total of 4 rules in 24 ms. Remains 105 /108 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:34:41] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:34:41] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:34:42] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
[2023-03-12 06:34:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:42] [INFO ] Invariant cache hit.
[2023-03-12 06:34:42] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 06:34:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:34:42] [INFO ] Invariant cache hit.
[2023-03-12 06:34:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:43] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1441 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2268 ms. Remains : 103/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s22 (ADD s101 s102))], 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 42 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03 finished in 2377 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)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 10 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:34:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:34:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:34:44] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
[2023-03-12 06:34:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:44] [INFO ] Invariant cache hit.
[2023-03-12 06:34:44] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-12 06:34:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:44] [INFO ] Invariant cache hit.
[2023-03-12 06:34:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:46] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1407 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 13 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2105 ms. Remains : 105/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s23) (LEQ 3 s24))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 12198 reset in 898 ms.
Product exploration explored 100000 steps with 12016 reset in 721 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 193 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2023-03-12 06:34:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 06:34:48] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:34:49] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:49] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-12 06:34:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:49] [INFO ] [Nat]Absence check using state equation in 37 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05 finished in 5843 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)||X(G((p1||X((p2&&F(p0))))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:34:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2023-03-12 06:34:49] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 06:34:50] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
[2023-03-12 06:34:50] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:50] [INFO ] Invariant cache hit.
[2023-03-12 06:34:50] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-12 06:34:50] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:50] [INFO ] Invariant cache hit.
[2023-03-12 06:34:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:51] [INFO ] Implicit Places using invariants and state equation in 977 ms returned [24, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1265 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1828 ms. Remains : 106/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s49 s50)), p1:(LEQ s48 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24942 reset in 770 ms.
Product exploration explored 100000 steps with 24938 reset in 784 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3102 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 212 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 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 613 steps, including 3 resets, run visited all 3 properties in 6 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 303 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 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:34:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:34:54] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 06:34:54] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
[2023-03-12 06:34:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:54] [INFO ] Invariant cache hit.
[2023-03-12 06:34:55] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-12 06:34:55] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:55] [INFO ] Invariant cache hit.
[2023-03-12 06:34:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:34:56] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2023-03-12 06:34:56] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:56] [INFO ] Invariant cache hit.
[2023-03-12 06:34:57] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2827 ms. Remains : 106/106 places, 2228/2228 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3102 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 205 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 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 420 steps, including 2 resets, run visited all 3 properties in 4 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 251 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 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24901 reset in 747 ms.
Product exploration explored 100000 steps with 25186 reset in 787 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 248 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:34:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:34:59] [INFO ] Invariant cache hit.
[2023-03-12 06:35:00] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2023-03-12 06:35:00] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-12 06:35:00] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:00] [INFO ] Invariant cache hit.
[2023-03-12 06:35:01] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1533 ms. Remains : 106/106 places, 2228/2228 transitions.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:35:01] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:01] [INFO ] Invariant cache hit.
[2023-03-12 06:35:01] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
[2023-03-12 06:35:01] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:01] [INFO ] Invariant cache hit.
[2023-03-12 06:35:01] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-12 06:35:01] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:01] [INFO ] Invariant cache hit.
[2023-03-12 06:35:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:02] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
[2023-03-12 06:35:02] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:02] [INFO ] Invariant cache hit.
[2023-03-12 06:35:03] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2450 ms. Remains : 106/106 places, 2228/2228 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 finished in 13819 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))||G(p1)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 230 ms. Remains 107 /108 variables (removed 1) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:35:03] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2023-03-12 06:35:03] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 06:35:04] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
[2023-03-12 06:35:04] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:04] [INFO ] Invariant cache hit.
[2023-03-12 06:35:04] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-12 06:35:04] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:04] [INFO ] Invariant cache hit.
[2023-03-12 06:35:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:06] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1397 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 226 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2541 ms. Remains : 105/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s23 s46), p0:(LEQ s47 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 finished in 2682 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 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2226
Applied a total of 6 rules in 321 ms. Remains 103 /108 variables (removed 5) and now considering 2226/2228 (removed 2) transitions.
[2023-03-12 06:35:06] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2023-03-12 06:35:06] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 06:35:07] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-12 06:35:07] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:35:07] [INFO ] Invariant cache hit.
[2023-03-12 06:35:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:08] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1462 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/108 places, 2226/2228 transitions.
Applied a total of 0 rules in 331 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2115 ms. Remains : 101/108 places, 2226/2228 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s43 (ADD s99 s100))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1723 reset in 453 ms.
Product exploration explored 100000 steps with 1715 reset in 456 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2023-03-12 06:35:10] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2023-03-12 06:35:10] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 06:35:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:10] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-12 06:35:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:10] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-12 06:35:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:11] [INFO ] [Nat]Added 102 Read/Feed constraints in 924 ms returned sat
[2023-03-12 06:35:11] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 195 transitions) in 128 ms.
[2023-03-12 06:35:12] [INFO ] Added : 36 causal constraints over 8 iterations in 441 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 281 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-12 06:35:12] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:35:12] [INFO ] Invariant cache hit.
[2023-03-12 06:35:12] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-12 06:35:12] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:35:12] [INFO ] Invariant cache hit.
[2023-03-12 06:35:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:13] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2023-03-12 06:35:13] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-12 06:35:13] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:35:13] [INFO ] Invariant cache hit.
[2023-03-12 06:35:14] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2442 ms. Remains : 101/101 places, 2226/2226 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-12 06:35:15] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:35:15] [INFO ] Invariant cache hit.
[2023-03-12 06:35:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:15] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-12 06:35:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:15] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-12 06:35:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:16] [INFO ] [Nat]Added 102 Read/Feed constraints in 924 ms returned sat
[2023-03-12 06:35:16] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 195 transitions) in 106 ms.
[2023-03-12 06:35:17] [INFO ] Added : 36 causal constraints over 8 iterations in 472 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1721 reset in 593 ms.
Product exploration explored 100000 steps with 1718 reset in 552 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 228 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-12 06:35:18] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:35:18] [INFO ] Invariant cache hit.
[2023-03-12 06:35:19] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-12 06:35:19] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:35:19] [INFO ] Invariant cache hit.
[2023-03-12 06:35:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:20] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
[2023-03-12 06:35:20] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-12 06:35:20] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:35:20] [INFO ] Invariant cache hit.
[2023-03-12 06:35:21] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2622 ms. Remains : 101/101 places, 2226/2226 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 finished in 14845 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 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Applied a total of 3 rules in 206 ms. Remains 105 /108 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:35:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:35:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:35:22] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
[2023-03-12 06:35:22] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:22] [INFO ] Invariant cache hit.
[2023-03-12 06:35:22] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-12 06:35:22] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:22] [INFO ] Invariant cache hit.
[2023-03-12 06:35:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:23] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1739 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 261 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2964 ms. Remains : 103/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s0)], 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 602 reset in 680 ms.
Product exploration explored 100000 steps with 602 reset in 863 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 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 117 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 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Finished Best-First random walk after 381 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=190 )
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 175 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 165 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:35:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 06:35:26] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 06:35:27] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
[2023-03-12 06:35:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:27] [INFO ] Invariant cache hit.
[2023-03-12 06:35:27] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 06:35:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:27] [INFO ] Invariant cache hit.
[2023-03-12 06:35:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:29] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
[2023-03-12 06:35:29] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-12 06:35:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:29] [INFO ] Invariant cache hit.
[2023-03-12 06:35:30] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3743 ms. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 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 114 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 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Finished Best-First random walk after 305 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=152 )
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 166 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 602 reset in 670 ms.
Product exploration explored 100000 steps with 602 reset in 686 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 170 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:35:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:32] [INFO ] Invariant cache hit.
[2023-03-12 06:35:32] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
[2023-03-12 06:35:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:32] [INFO ] Invariant cache hit.
[2023-03-12 06:35:33] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-12 06:35:33] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:33] [INFO ] Invariant cache hit.
[2023-03-12 06:35:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:34] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2023-03-12 06:35:34] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 06:35:34] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:34] [INFO ] Invariant cache hit.
[2023-03-12 06:35:35] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3612 ms. Remains : 103/103 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 finished in 14415 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))&&F(p1)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 2227
Applied a total of 3 rules in 175 ms. Remains 106 /108 variables (removed 2) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:35:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 106 cols
[2023-03-12 06:35:35] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 06:35:36] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
[2023-03-12 06:35:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:36] [INFO ] Invariant cache hit.
[2023-03-12 06:35:36] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-12 06:35:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:36] [INFO ] Invariant cache hit.
[2023-03-12 06:35:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:37] [INFO ] Implicit Places using invariants and state equation in 962 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1231 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 166 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2131 ms. Remains : 105/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s47), p0:(GT 3 s45)], 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 684 reset in 943 ms.
Product exploration explored 100000 steps with 685 reset in 770 ms.
Computed a total of 48 stabilizing places and 83 stable transitions
Graph (complete) has 3143 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 48 stabilizing places and 83 stable transitions
Detected a total of 48/105 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 225 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2227/2227 transitions.
Applied a total of 0 rules in 162 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:35:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:35:40] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 06:35:40] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
[2023-03-12 06:35:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:40] [INFO ] Invariant cache hit.
[2023-03-12 06:35:41] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-12 06:35:41] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:41] [INFO ] Invariant cache hit.
[2023-03-12 06:35:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:42] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2023-03-12 06:35:42] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 06:35:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:35:42] [INFO ] Invariant cache hit.
[2023-03-12 06:35:42] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2618 ms. Remains : 105/105 places, 2227/2227 transitions.
Computed a total of 48 stabilizing places and 83 stable transitions
Graph (complete) has 3143 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 48 stabilizing places and 83 stable transitions
Detected a total of 48/105 stabilizing places and 83/2227 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 116 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 30 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
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 134 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 685 reset in 759 ms.
Product exploration explored 100000 steps with 685 reset in 767 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2227/2227 transitions.
Graph (complete) has 3143 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 102 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 100 transition count 2224
Applied a total of 8 rules in 203 ms. Remains 100 /105 variables (removed 5) and now considering 2224/2227 (removed 3) transitions.
[2023-03-12 06:35:44] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 100 cols
[2023-03-12 06:35:44] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 06:35:45] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-12 06:35:45] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 06:35:45] [INFO ] Invariant cache hit.
[2023-03-12 06:35:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:46] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2023-03-12 06:35:46] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-12 06:35:46] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 06:35:46] [INFO ] Invariant cache hit.
[2023-03-12 06:35:46] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/105 places, 2224/2227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1958 ms. Remains : 100/105 places, 2224/2227 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14 finished in 11071 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 U p1))))'
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)))'
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)||X(G((p1||X((p2&&F(p0))))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 19 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:35:47] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2023-03-12 06:35:47] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 06:35:47] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
[2023-03-12 06:35:47] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:47] [INFO ] Invariant cache hit.
[2023-03-12 06:35:47] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-12 06:35:47] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:47] [INFO ] Invariant cache hit.
[2023-03-12 06:35:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:48] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned [24, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1262 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 23 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1856 ms. Remains : 106/108 places, 2228/2228 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s49 s50)), p1:(LEQ s48 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25032 reset in 780 ms.
Product exploration explored 100000 steps with 25039 reset in 860 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3102 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 272 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 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 46 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 290 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 91 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:35:51] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:35:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:35:52] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
[2023-03-12 06:35:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:52] [INFO ] Invariant cache hit.
[2023-03-12 06:35:52] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-12 06:35:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:52] [INFO ] Invariant cache hit.
[2023-03-12 06:35:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:35:53] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2023-03-12 06:35:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:53] [INFO ] Invariant cache hit.
[2023-03-12 06:35:53] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2456 ms. Remains : 106/106 places, 2228/2228 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3102 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 210 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 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 20 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 299 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 91 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25004 reset in 798 ms.
Product exploration explored 100000 steps with 25077 reset in 969 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 289 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:35:57] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:57] [INFO ] Invariant cache hit.
[2023-03-12 06:35:57] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2023-03-12 06:35:57] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-12 06:35:57] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:57] [INFO ] Invariant cache hit.
[2023-03-12 06:35:58] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1636 ms. Remains : 106/106 places, 2228/2228 transitions.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:35:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:58] [INFO ] Invariant cache hit.
[2023-03-12 06:35:59] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2023-03-12 06:35:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:59] [INFO ] Invariant cache hit.
[2023-03-12 06:35:59] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-12 06:35:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:35:59] [INFO ] Invariant cache hit.
[2023-03-12 06:35:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:00] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
[2023-03-12 06:36:00] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:36:00] [INFO ] Invariant cache hit.
[2023-03-12 06:36:00] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2448 ms. Remains : 106/106 places, 2228/2228 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 finished in 14104 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)))'
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' '!((F(G(p0))&&F(p1)))'
[2023-03-12 06:36:01] [INFO ] Flatten gal took : 111 ms
[2023-03-12 06:36:01] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 06:36:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 2228 transitions and 17190 arcs took 25 ms.
Total runtime 124553 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-00
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14

BK_STOP 1678602965044

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLCardinality-00
ltl formula formula --ltl=/tmp/2104/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 108 places, 2228 transitions and 17190 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.440 real 0.100 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01
ltl formula formula --ltl=/tmp/2104/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: =============================================================================
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 108 places, 2228 transitions and 17190 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.440 real 0.080 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08
ltl formula formula --ltl=/tmp/2104/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 108 places, 2228 transitions and 17190 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.360 real 0.090 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
0: pnml2lts-mc(+0xa23f4) [0x55604c6bb3f4]
1: pnml2lts-mc(+0xa2496) [0x55604c6bb496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f74afb9d140]
3: pnml2lts-mc(+0x405be5) [0x55604ca1ebe5]
4: pnml2lts-mc(+0x164ad3) [0x55604c77dad3]
5: pnml2lts-mc(+0x272e0a) [0x55604c88be0a]
6: pnml2lts-mc(+0xb61f0) [0x55604c6cf1f0]
7: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f74af9f04d7]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f74af9f067a]
9: pnml2lts-mc(+0xa1581) [0x55604c6ba581]
10: pnml2lts-mc(+0xa1910) [0x55604c6ba910]
11: pnml2lts-mc(+0xa32a2) [0x55604c6bc2a2]
12: pnml2lts-mc(+0xa50f4) [0x55604c6be0f4]
13: pnml2lts-mc(+0xa516b) [0x55604c6be16b]
14: pnml2lts-mc(+0x3f34b3) [0x55604ca0c4b3]
15: pnml2lts-mc(+0x7c63d) [0x55604c69563d]
16: pnml2lts-mc(+0x67d86) [0x55604c680d86]
17: pnml2lts-mc(+0x60a8a) [0x55604c679a8a]
18: pnml2lts-mc(+0x5eb15) [0x55604c677b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f74af9d8d0a]
20: pnml2lts-mc(+0x6075e) [0x55604c67975e]
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12
ltl formula formula --ltl=/tmp/2104/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: =============================================================================
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 2228 transitions and 17190 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.450 real 0.070 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13
ltl formula formula --ltl=/tmp/2104/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 108 places, 2228 transitions and 17190 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.420 real 0.060 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_4_
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-V20P20N50-LTLCardinality-14
ltl formula formula --ltl=/tmp/2104/ltl_5_
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 108 places, 2228 transitions and 17190 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.430 real 0.080 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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-V20P20N50"
export BK_EXAMINATION="LTLCardinality"
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-V20P20N50, examination is LTLCardinality"
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-167813694200059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N50.tgz
mv BridgeAndVehicles-COL-V20P20N50 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;