About the Execution of LTSMin+red for BridgeAndVehicles-COL-V50P20N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 995.144 | 121844.00 | 178488.00 | 242.40 | T?TFFTF??F?FFFTF | normal |
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-167813694200075.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-V50P20N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694200075
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:18 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.5K 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.9K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678605245983
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-V50P20N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:14:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 07:14:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:14:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 07:14:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 07:14:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 520 ms
[2023-03-12 07:14:08] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.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 07:14:08] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2023-03-12 07:14:08] [INFO ] Skeletonized 16 HLPN properties in 18 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-14 TRUE 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.2 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 07:14:09] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 07:14:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 07:14:09] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2023-03-12 07:14:09] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 07:14:09] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-12 07:14:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:14:09] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-12 07:14:09] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 07:14:09] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 3 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2023-03-12 07:14:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-12 07:14:09] [INFO ] Flatten gal took : 16 ms
[2023-03-12 07:14:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 07:14:09] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 07:14:09] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 167 ms.
[2023-03-12 07:14:09] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 15 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 85 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:14:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-12 07:14:09] [INFO ] Computed 7 place invariants in 23 ms
[2023-03-12 07:14:10] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
[2023-03-12 07:14:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:10] [INFO ] Invariant cache hit.
[2023-03-12 07:14:11] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 07:14:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:11] [INFO ] Invariant cache hit.
[2023-03-12 07:14:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:11] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-12 07:14:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:11] [INFO ] Invariant cache hit.
[2023-03-12 07:14:12] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3027 ms. Remains : 138/138 places, 2348/2348 transitions.
Support contains 15 out of 138 places after structural reductions.
[2023-03-12 07:14:13] [INFO ] Flatten gal took : 307 ms
[2023-03-12 07:14:13] [INFO ] Flatten gal took : 268 ms
[2023-03-12 07:14:13] [INFO ] Input system was already deterministic with 2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 17) seen :16
Finished Best-First random walk after 519 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=32 )
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.92 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) U p1)))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 60 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:14:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:14:15] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 07:14:16] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
[2023-03-12 07:14:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:16] [INFO ] Invariant cache hit.
[2023-03-12 07:14:16] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 07:14:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:16] [INFO ] Invariant cache hit.
[2023-03-12 07:14:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:17] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1327 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2357 ms. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LEQ 1 (ADD s106 s107)) (GT 1 s52)), p0:(LEQ s105 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 560 reset in 652 ms.
Product exploration explored 100000 steps with 558 reset in 659 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Finished random walk after 143 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
[2023-03-12 07:14:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 07:14:20] [INFO ] Computed 5 place invariants in 39 ms
[2023-03-12 07:14:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:14:20] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-12 07:14:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:14:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:14:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:14:21] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-12 07:14:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:22] [INFO ] [Nat]Added 42 Read/Feed constraints in 1687 ms returned sat
[2023-03-12 07:14:23] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 132 ms.
[2023-03-12 07:14:23] [INFO ] Added : 20 causal constraints over 5 iterations in 327 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 18 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:14:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:23] [INFO ] Invariant cache hit.
[2023-03-12 07:14:24] [INFO ] Dead Transitions using invariants and state equation in 1123 ms found 0 transitions.
[2023-03-12 07:14:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:24] [INFO ] Invariant cache hit.
[2023-03-12 07:14:24] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 07:14:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:24] [INFO ] Invariant cache hit.
[2023-03-12 07:14:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:25] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2023-03-12 07:14:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:25] [INFO ] Invariant cache hit.
[2023-03-12 07:14:26] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3288 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Finished random walk after 174 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
[2023-03-12 07:14:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:27] [INFO ] Invariant cache hit.
[2023-03-12 07:14:27] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:14:28] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-12 07:14:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:14:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:14:28] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2023-03-12 07:14:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 2853 ms returned sat
[2023-03-12 07:14:31] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 123 ms.
[2023-03-12 07:14:31] [INFO ] Added : 19 causal constraints over 4 iterations in 418 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 561 reset in 785 ms.
Product exploration explored 100000 steps with 559 reset in 595 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 2347
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 573 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:14:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 07:14:34] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:14:35] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
[2023-03-12 07:14:35] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-12 07:14:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:35] [INFO ] Invariant cache hit.
[2023-03-12 07:14:36] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2347/2347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2296 ms. Remains : 133/133 places, 2347/2347 transitions.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 26 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:14:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 07:14:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:14:37] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
[2023-03-12 07:14:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:37] [INFO ] Invariant cache hit.
[2023-03-12 07:14:37] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-12 07:14:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:37] [INFO ] Invariant cache hit.
[2023-03-12 07:14:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:38] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2023-03-12 07:14:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:38] [INFO ] Invariant cache hit.
[2023-03-12 07:14:39] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3096 ms. Remains : 133/133 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLCardinality-01 finished in 24839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(p0)))))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 26 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:14:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:14:39] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:14:40] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
[2023-03-12 07:14:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:40] [INFO ] Invariant cache hit.
[2023-03-12 07:14:40] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 07:14:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:14:40] [INFO ] Invariant cache hit.
[2023-03-12 07:14:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:41] [INFO ] Implicit Places using invariants and state equation in 942 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1266 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 26 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2024 ms. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 517 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(GT 1 (ADD s131 s132))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 151 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLCardinality-04 finished in 2567 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 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 377 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:14:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:14:42] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:14:43] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
[2023-03-12 07:14:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:43] [INFO ] Invariant cache hit.
[2023-03-12 07:14:43] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-12 07:14:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:43] [INFO ] Invariant cache hit.
[2023-03-12 07:14:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:45] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1607 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 355 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3218 ms. Remains : 134/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ (ADD s109 s110) s105) (LEQ 2 s0))], 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 15136 reset in 989 ms.
Product exploration explored 100000 steps with 15003 reset in 771 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 194 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 134 ms :[(NOT p0), (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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 183 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 102 ms :[(NOT p0), (NOT p0)]
[2023-03-12 07:14:48] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2023-03-12 07:14:48] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:14:49] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:14:49] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2023-03-12 07:14:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:14:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:14:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:14:50] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-12 07:14:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:52] [INFO ] [Nat]Added 42 Read/Feed constraints in 1743 ms returned sat
[2023-03-12 07:14:52] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 84 ms.
[2023-03-12 07:14:53] [INFO ] Added : 25 causal constraints over 6 iterations in 393 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 216 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:14:53] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:53] [INFO ] Invariant cache hit.
[2023-03-12 07:14:54] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
[2023-03-12 07:14:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:54] [INFO ] Invariant cache hit.
[2023-03-12 07:14:54] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-12 07:14:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:54] [INFO ] Invariant cache hit.
[2023-03-12 07:14:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:14:55] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
[2023-03-12 07:14:55] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-12 07:14:55] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:55] [INFO ] Invariant cache hit.
[2023-03-12 07:14:57] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3994 ms. Remains : 134/134 places, 2348/2348 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 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 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 144 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2023-03-12 07:14:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:14:57] [INFO ] Invariant cache hit.
[2023-03-12 07:14:59] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:14:59] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2023-03-12 07:14:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:15:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:00] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-12 07:15:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 130 ms returned sat
[2023-03-12 07:15:00] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 80 ms.
[2023-03-12 07:15:01] [INFO ] Added : 27 causal constraints over 6 iterations in 701 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14813 reset in 994 ms.
Product exploration explored 100000 steps with 14925 reset in 845 ms.
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 241 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:15:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:03] [INFO ] Invariant cache hit.
[2023-03-12 07:15:04] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
[2023-03-12 07:15:04] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:04] [INFO ] Invariant cache hit.
[2023-03-12 07:15:04] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-03-12 07:15:04] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:04] [INFO ] Invariant cache hit.
[2023-03-12 07:15:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:06] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
[2023-03-12 07:15:06] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 07:15:06] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:06] [INFO ] Invariant cache hit.
[2023-03-12 07:15:07] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3875 ms. Remains : 134/134 places, 2348/2348 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLCardinality-07 finished in 24934 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 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 232 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:15:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 07:15:07] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-12 07:15:08] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
[2023-03-12 07:15:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:08] [INFO ] Invariant cache hit.
[2023-03-12 07:15:08] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-12 07:15:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:08] [INFO ] Invariant cache hit.
[2023-03-12 07:15:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:09] [INFO ] Implicit Places using invariants and state equation in 851 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1198 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 233 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2447 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s52 s106)], 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 241 reset in 902 ms.
Product exploration explored 100000 steps with 241 reset in 789 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3641 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/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 183 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 58 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
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 256 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
[2023-03-12 07:15:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2023-03-12 07:15:12] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:15:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:16] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-12 07:15:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:15:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:19] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-12 07:15:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 661 ms returned sat
[2023-03-12 07:15:20] [INFO ] Deduced a trap composed of 5 places in 576 ms of which 2 ms to minimize.
[2023-03-12 07:15:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 827 ms
[2023-03-12 07:15:21] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 112 ms.
[2023-03-12 07:15:21] [INFO ] Added : 46 causal constraints over 10 iterations in 778 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 221 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:15:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:22] [INFO ] Invariant cache hit.
[2023-03-12 07:15:23] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
[2023-03-12 07:15:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:23] [INFO ] Invariant cache hit.
[2023-03-12 07:15:23] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-12 07:15:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:23] [INFO ] Invariant cache hit.
[2023-03-12 07:15:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:24] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-03-12 07:15:24] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-12 07:15:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:24] [INFO ] Invariant cache hit.
[2023-03-12 07:15:25] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3642 ms. Remains : 135/135 places, 2348/2348 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3641 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/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 203 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 33 ms :[(NOT p0)]
Finished random walk after 142 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=47 )
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 161 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 33 ms :[(NOT p0)]
[2023-03-12 07:15:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:26] [INFO ] Invariant cache hit.
[2023-03-12 07:15:26] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:26] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-12 07:15:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:15:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:15:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:27] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-12 07:15:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:28] [INFO ] [Nat]Added 42 Read/Feed constraints in 572 ms returned sat
[2023-03-12 07:15:28] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 91 ms.
[2023-03-12 07:15:29] [INFO ] Added : 49 causal constraints over 16 iterations in 902 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 241 reset in 773 ms.
Product exploration explored 100000 steps with 241 reset in 831 ms.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 261 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:15:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:31] [INFO ] Invariant cache hit.
[2023-03-12 07:15:31] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
[2023-03-12 07:15:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:31] [INFO ] Invariant cache hit.
[2023-03-12 07:15:32] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-12 07:15:32] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:32] [INFO ] Invariant cache hit.
[2023-03-12 07:15:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:33] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2023-03-12 07:15:33] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-12 07:15:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:33] [INFO ] Invariant cache hit.
[2023-03-12 07:15:34] [INFO ] Dead Transitions using invariants and state equation in 1156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4089 ms. Remains : 135/135 places, 2348/2348 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLCardinality-08 finished in 27791 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 X((G(p1) U X(X(G(!p0)))))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 18 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:15:35] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 07:15:35] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 07:15:35] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
[2023-03-12 07:15:35] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:35] [INFO ] Invariant cache hit.
[2023-03-12 07:15:36] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-12 07:15:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:36] [INFO ] Invariant cache hit.
[2023-03-12 07:15:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:37] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1596 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 24 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2452 ms. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 441 ms :[p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0), p0, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}]], initial=6, aps=[p1:(LEQ (ADD s109 s110) s108), p0:(GT 3 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 404 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLCardinality-09 finished in 2950 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(F((p0||(!p0 U !p1))))||G(p2))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 2347
Applied a total of 3 rules in 249 ms. Remains 136 /138 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:15:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2023-03-12 07:15:38] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-12 07:15:39] [INFO ] Dead Transitions using invariants and state equation in 1249 ms found 0 transitions.
[2023-03-12 07:15:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:39] [INFO ] Invariant cache hit.
[2023-03-12 07:15:39] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-12 07:15:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:39] [INFO ] Invariant cache hit.
[2023-03-12 07:15:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:40] [INFO ] Implicit Places using invariants and state equation in 950 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1273 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 267 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3042 ms. Remains : 135/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 2 s54), p0:(GT s52 s106), p1:(GT 3 s106)], 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 6458 reset in 1029 ms.
Product exploration explored 100000 steps with 6490 reset in 812 ms.
Computed a total of 108 stabilizing places and 203 stable transitions
Graph (complete) has 3743 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/135 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 287 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Finished random walk after 3004 steps, including 8 resets, run visited all 2 properties in 52 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (AND p2 p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
[2023-03-12 07:15:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:15:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:15:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:44] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-12 07:15:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:15:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:45] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-12 07:15:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:45] [INFO ] [Nat]Added 42 Read/Feed constraints in 26 ms returned sat
[2023-03-12 07:15:45] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 87 ms.
[2023-03-12 07:15:46] [INFO ] Added : 51 causal constraints over 12 iterations in 397 ms. Result :sat
Could not prove EG (AND (NOT p2) p1 (NOT p0))
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 229 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:15:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:46] [INFO ] Invariant cache hit.
[2023-03-12 07:15:47] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
[2023-03-12 07:15:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:47] [INFO ] Invariant cache hit.
[2023-03-12 07:15:47] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 07:15:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:47] [INFO ] Invariant cache hit.
[2023-03-12 07:15:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:48] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2023-03-12 07:15:48] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-12 07:15:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:48] [INFO ] Invariant cache hit.
[2023-03-12 07:15:49] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3113 ms. Remains : 135/135 places, 2347/2347 transitions.
Computed a total of 108 stabilizing places and 203 stable transitions
Graph (complete) has 3743 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/135 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Finished random walk after 759 steps, including 2 resets, run visited all 2 properties in 15 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 8 factoid took 287 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 98 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
[2023-03-12 07:15:50] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:50] [INFO ] Invariant cache hit.
[2023-03-12 07:15:51] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:15:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:51] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-03-12 07:15:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:15:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:15:52] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2023-03-12 07:15:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:52] [INFO ] [Nat]Added 42 Read/Feed constraints in 88 ms returned sat
[2023-03-12 07:15:52] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 87 ms.
[2023-03-12 07:15:52] [INFO ] Added : 52 causal constraints over 11 iterations in 547 ms. Result :sat
Could not prove EG (AND p1 (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 95 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 6851 reset in 886 ms.
Product exploration explored 100000 steps with 6431 reset in 1085 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 218 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:15:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:55] [INFO ] Invariant cache hit.
[2023-03-12 07:15:56] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
[2023-03-12 07:15:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:56] [INFO ] Invariant cache hit.
[2023-03-12 07:15:56] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-12 07:15:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:56] [INFO ] Invariant cache hit.
[2023-03-12 07:15:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:15:57] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2023-03-12 07:15:57] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-12 07:15:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:15:57] [INFO ] Invariant cache hit.
[2023-03-12 07:15:58] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3118 ms. Remains : 135/135 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLCardinality-10 finished in 20261 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(p0) U ((p1||X(p2)) U X(p1))) U (p3&&G(p2))))'
Support contains 8 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 13 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:15:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:15:58] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:15:59] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
[2023-03-12 07:15:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:59] [INFO ] Invariant cache hit.
[2023-03-12 07:15:59] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-12 07:15:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:15:59] [INFO ] Invariant cache hit.
[2023-03-12 07:15:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:00] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1415 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 17 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2138 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) p0), (NOT p2), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p2) p0)), acceptance={} source=0 dest: 4}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p3 p2), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(LEQ s107 (ADD s133 s134)), p2:(LEQ s106 (ADD s108 s109)), p1:(LEQ s52 1), p0:(LEQ s53 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 627 steps with 142 reset in 8 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLCardinality-11 finished in 2631 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(!p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 21 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:16:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:16:00] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:16:02] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
[2023-03-12 07:16:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:02] [INFO ] Invariant cache hit.
[2023-03-12 07:16:02] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-12 07:16:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:02] [INFO ] Invariant cache hit.
[2023-03-12 07:16:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:03] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1627 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 22 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2814 ms. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, p0, (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLCardinality-15 finished in 2938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) 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(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(F((p0||(!p0 U !p1))))||G(p2))))'
[2023-03-12 07:16:04] [INFO ] Flatten gal took : 118 ms
[2023-03-12 07:16:04] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 07:16:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 2348 transitions and 18090 arcs took 27 ms.
Total runtime 116343 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1531/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1531/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1531/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1531/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-01
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-07
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-08
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-LTLCardinality-10
BK_STOP 1678605367827
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-COL-V50P20N20-LTLCardinality-01
ltl formula formula --ltl=/tmp/1531/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 138 places, 2348 transitions and 18090 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.520 real 0.140 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1531/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1531/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1531/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1531/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 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-V50P20N20-LTLCardinality-07
ltl formula formula --ltl=/tmp/1531/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 138 places, 2348 transitions and 18090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.100 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1531/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1531/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1531/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1531/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
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-COL-V50P20N20-LTLCardinality-08
ltl formula formula --ltl=/tmp/1531/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: =============================================================================
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 138 places, 2348 transitions and 18090 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.510 real 0.110 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1531/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1531/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1531/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1531/ltl_2_
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-V50P20N20-LTLCardinality-10
ltl formula formula --ltl=/tmp/1531/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 2348 transitions and 18090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.120 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1531/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1531/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1531/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1531/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
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:
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-V50P20N20"
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-V50P20N20, 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-167813694200075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P20N20.tgz
mv BridgeAndVehicles-COL-V50P20N20 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 '
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 ;