About the Execution of LTSMin+red for BridgeAndVehicles-COL-V80P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8660.644 | 1139663.00 | 3885746.00 | 159.50 | ?F?F??TFTFFFFFTT | 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-167813694300116.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-V80P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694300116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.8K Feb 25 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:13 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.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:35 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 45K 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-V80P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678607730569
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:55:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 07:55:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:55:32] [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:55:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 07:55:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 482 ms
[2023-03-12 07:55:32] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 07:55:32] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2023-03-12 07:55:32] [INFO ] Skeletonized 11 HLPN properties in 1 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-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 5 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Finished random walk after 180 steps, including 0 resets, run visited all 5 properties in 11 ms. (steps per millisecond=16 )
[2023-03-12 07:55:33] [INFO ] Flatten gal took : 14 ms
[2023-03-12 07:55:33] [INFO ] Flatten gal took : 7 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] 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:55:33] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 103 ms.
[2023-03-12 07:55:33] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 185 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 38 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:55:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2023-03-12 07:55:33] [INFO ] Computed 5 place invariants in 29 ms
[2023-03-12 07:55:34] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
[2023-03-12 07:55:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:55:34] [INFO ] Invariant cache hit.
[2023-03-12 07:55:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-12 07:55:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:55:34] [INFO ] Invariant cache hit.
[2023-03-12 07:55:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:55:34] [INFO ] Implicit Places using invariants and state equation in 315 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 375 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 24 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1405 ms. Remains : 185/188 places, 2108/2108 transitions.
Support contains 185 out of 185 places after structural reductions.
[2023-03-12 07:55:35] [INFO ] Flatten gal took : 194 ms
[2023-03-12 07:55:36] [INFO ] Flatten gal took : 171 ms
[2023-03-12 07:55:36] [INFO ] Input system was already deterministic with 2108 transitions.
Finished random walk after 1418 steps, including 2 resets, run visited all 13 properties in 182 ms. (steps per millisecond=7 )
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 168 stabilizing places and 324 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 83 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 44 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:55:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:55:37] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:55:38] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
[2023-03-12 07:55:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:38] [INFO ] Invariant cache hit.
[2023-03-12 07:55:38] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-12 07:55:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:38] [INFO ] Invariant cache hit.
[2023-03-12 07:55:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:55:39] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2023-03-12 07:55:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:39] [INFO ] Invariant cache hit.
[2023-03-12 07:55:40] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/185 places, 2107/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2547 ms. Remains : 184/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s83 1) (GEQ s167 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s83 1) (GEQ s167 1)) (AND (GEQ s0 1) (GEQ s49 1) (GEQ s83 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5544 reset in 1217 ms.
Product exploration explored 100000 steps with 5379 reset in 1029 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-12 07:55:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:43] [INFO ] Invariant cache hit.
[2023-03-12 07:55:44] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 07:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:55:45] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2023-03-12 07:55:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:55:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:55:47] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-12 07:55:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:55:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 430 ms returned sat
[2023-03-12 07:55:48] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 92 ms.
[2023-03-12 07:55:50] [INFO ] Added : 66 causal constraints over 17 iterations in 2311 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 416 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:55:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:50] [INFO ] Invariant cache hit.
[2023-03-12 07:55:51] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
[2023-03-12 07:55:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:51] [INFO ] Invariant cache hit.
[2023-03-12 07:55:52] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 07:55:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:52] [INFO ] Invariant cache hit.
[2023-03-12 07:55:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:55:52] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2023-03-12 07:55:52] [INFO ] Redundant transitions in 216 ms returned []
[2023-03-12 07:55:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:52] [INFO ] Invariant cache hit.
[2023-03-12 07:55:53] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3132 ms. Remains : 184/184 places, 2107/2107 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-12 07:55:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:55:54] [INFO ] Invariant cache hit.
[2023-03-12 07:55:56] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-12 07:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:55:56] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2023-03-12 07:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:55:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 07:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:55:58] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2023-03-12 07:55:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:55:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 304 ms returned sat
[2023-03-12 07:55:59] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 137 ms.
[2023-03-12 07:56:01] [INFO ] Added : 66 causal constraints over 17 iterations in 2033 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5666 reset in 1151 ms.
Product exploration explored 100000 steps with 5450 reset in 963 ms.
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 189 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:56:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:56:03] [INFO ] Invariant cache hit.
[2023-03-12 07:56:04] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
[2023-03-12 07:56:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:56:04] [INFO ] Invariant cache hit.
[2023-03-12 07:56:04] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-12 07:56:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:56:04] [INFO ] Invariant cache hit.
[2023-03-12 07:56:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:56:05] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2023-03-12 07:56:05] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-12 07:56:05] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:56:05] [INFO ] Invariant cache hit.
[2023-03-12 07:56:06] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3017 ms. Remains : 184/184 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-00 finished in 29428 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)||F(!p1)))) U G(p2))))'
Support contains 176 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 20 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:56:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:56:07] [INFO ] Invariant cache hit.
[2023-03-12 07:56:07] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
[2023-03-12 07:56:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:56:07] [INFO ] Invariant cache hit.
[2023-03-12 07:56:07] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-12 07:56:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:56:07] [INFO ] Invariant cache hit.
[2023-03-12 07:56:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:56:08] [INFO ] Implicit Places using invariants and state equation in 437 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 531 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/185 places, 2107/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1161 ms. Remains : 183/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (NOT p2), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (AND (GEQ s34 1) (GEQ s82 1)) (AND (GEQ s24 1) (GEQ s82 1)) (AND (GEQ s5 1) (GEQ s82 1)) (AND (GEQ s54 1) (GEQ s82 1)) (AND (GEQ s73 1) (GEQ s82 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19970 reset in 1019 ms.
Product exploration explored 100000 steps with 19958 reset in 825 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (NOT p2), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 07:56:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:56:14] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 07:56:17] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:56:17] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 07:56:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:56:21] [INFO ] After 3672ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-12 07:56:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:56:24] [INFO ] After 3622ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-03-12 07:56:28] [INFO ] After 6902ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 3864 ms.
[2023-03-12 07:56:31] [INFO ] After 14680ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 176 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 181 transition count 2106
Applied a total of 3 rules in 338 ms. Remains 181 /183 variables (removed 2) and now considering 2106/2107 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 181/183 places, 2106/2107 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 278173 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278173 steps, saw 94413 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:56:36] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2023-03-12 07:56:36] [INFO ] Computed 4 place invariants in 9 ms
[2023-03-12 07:56:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 07:56:40] [INFO ] After 4127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:56:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:56:44] [INFO ] After 3516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:56:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:56:47] [INFO ] After 3326ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:56:51] [INFO ] After 6802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3275 ms.
[2023-03-12 07:56:54] [INFO ] After 13687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 176 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2106/2106 transitions.
Applied a total of 0 rules in 224 ms. Remains 181 /181 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 181/181 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2106/2106 transitions.
Applied a total of 0 rules in 169 ms. Remains 181 /181 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2023-03-12 07:56:55] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
[2023-03-12 07:56:55] [INFO ] Invariant cache hit.
[2023-03-12 07:56:55] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-12 07:56:55] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
[2023-03-12 07:56:55] [INFO ] Invariant cache hit.
[2023-03-12 07:56:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:56:55] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-12 07:56:55] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-12 07:56:55] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
[2023-03-12 07:56:55] [INFO ] Invariant cache hit.
[2023-03-12 07:56:56] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1340 ms. Remains : 181/181 places, 2106/2106 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 181 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 1739 place count 181 transition count 368
Applied a total of 1739 rules in 11 ms. Remains 181 /181 variables (removed 0) and now considering 368/2106 (removed 1738) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 368 rows 181 cols
[2023-03-12 07:56:56] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 07:56:56] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:00] [INFO ] After 3756ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:57:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:57:04] [INFO ] After 3842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:57:08] [INFO ] After 7645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3621 ms.
[2023-03-12 07:57:11] [INFO ] After 11349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), true, (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 8 factoid took 406 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Support contains 82 out of 183 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 181 transition count 2106
Applied a total of 3 rules in 236 ms. Remains 181 /183 variables (removed 2) and now considering 2106/2107 (removed 1) transitions.
[2023-03-12 07:57:12] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2023-03-12 07:57:12] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 07:57:12] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 07:57:12] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
[2023-03-12 07:57:12] [INFO ] Invariant cache hit.
[2023-03-12 07:57:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:12] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-12 07:57:12] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-12 07:57:12] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
[2023-03-12 07:57:12] [INFO ] Invariant cache hit.
[2023-03-12 07:57:13] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/183 places, 2106/2107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1263 ms. Remains : 181/183 places, 2106/2107 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/181 stabilizing places and 322/2106 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p2)]
Finished random walk after 246 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=82 )
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 144 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 37 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 514 steps with 0 reset in 13 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-01 finished in 67222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(p1)))))'
Support contains 94 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 298 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:57:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:57:14] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:57:15] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
[2023-03-12 07:57:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:15] [INFO ] Invariant cache hit.
[2023-03-12 07:57:15] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-12 07:57:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:15] [INFO ] Invariant cache hit.
[2023-03-12 07:57:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:16] [INFO ] Implicit Places using invariants and state equation in 930 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1093 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/185 places, 2107/2108 transitions.
Applied a total of 0 rules in 290 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2449 ms. Remains : 183/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s10 1) (LT s83 1) (LT s167 1) (LT s174 1)) (OR (LT s31 1) (LT s83 1) (LT s167 1) (LT s180 1)) (OR (LT s48 1) (LT s83 1) (LT s167 1) (LT s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 168 reset in 1885 ms.
Product exploration explored 100000 steps with 168 reset in 1762 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 331 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 6714 steps, including 11 resets, run visited all 3 properties in 304 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 389 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 94 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 212 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:57:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:57:22] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-12 07:57:22] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
[2023-03-12 07:57:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:22] [INFO ] Invariant cache hit.
[2023-03-12 07:57:22] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-12 07:57:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:22] [INFO ] Invariant cache hit.
[2023-03-12 07:57:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:23] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-12 07:57:23] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-12 07:57:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:23] [INFO ] Invariant cache hit.
[2023-03-12 07:57:24] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2539 ms. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 356 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 3) seen :2
Finished Best-First random walk after 184 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 369 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 168 reset in 1786 ms.
Product exploration explored 100000 steps with 168 reset in 1536 ms.
Support contains 94 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 196 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:57:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:29] [INFO ] Invariant cache hit.
[2023-03-12 07:57:30] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2023-03-12 07:57:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:30] [INFO ] Invariant cache hit.
[2023-03-12 07:57:30] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-12 07:57:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:30] [INFO ] Invariant cache hit.
[2023-03-12 07:57:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:33] [INFO ] Implicit Places using invariants and state equation in 2933 ms returned []
Implicit Place search using SMT with State Equation took 3126 ms to find 0 implicit places.
[2023-03-12 07:57:33] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-12 07:57:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:57:33] [INFO ] Invariant cache hit.
[2023-03-12 07:57:34] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4826 ms. Remains : 183/183 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-02 finished in 20264 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((X(F((!p0&&X(!p0))))||(X(!p1) U (X(G(!p1))||(!p1&&X(!p1)))))))'
Support contains 83 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 27 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:57:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-12 07:57:34] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:57:35] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
[2023-03-12 07:57:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:57:35] [INFO ] Invariant cache hit.
[2023-03-12 07:57:35] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-12 07:57:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:57:35] [INFO ] Invariant cache hit.
[2023-03-12 07:57:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:36] [INFO ] Implicit Places using invariants and state equation in 750 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 963 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 20 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1655 ms. Remains : 184/185 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 346 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0), p0, p0, (AND p0 p1), (AND p1 p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 6}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 3}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s146 1) (GEQ s166 1)) (AND (GEQ s107 1) (GEQ s166 1)) (AND (GEQ s136 1) (GEQ s166 1)) (AND (GEQ s117 1) (GEQ s166 1)) (AND (GEQ s97 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1446 reset in 625 ms.
Product exploration explored 100000 steps with 1405 reset in 553 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 434 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0), p0, p0, (AND p0 p1), (AND p1 p0)]
Finished random walk after 224 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 646 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0), p0, p0, (AND p0 p1), (AND p1 p0)]
Stuttering acceptance computed with spot in 371 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0), p0, p0, (AND p0 p1), (AND p1 p0)]
[2023-03-12 07:57:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2023-03-12 07:57:39] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:57:41] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 07:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:42] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2023-03-12 07:57:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:43] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-12 07:57:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 07:57:49] [INFO ] [Nat]Added 22 Read/Feed constraints in 6014 ms returned unknown
Could not prove EG (AND p1 p0)
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 25 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:57:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:57:49] [INFO ] Invariant cache hit.
[2023-03-12 07:57:50] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
[2023-03-12 07:57:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:57:50] [INFO ] Invariant cache hit.
[2023-03-12 07:57:50] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 07:57:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:57:50] [INFO ] Invariant cache hit.
[2023-03-12 07:57:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:50] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2023-03-12 07:57:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:57:50] [INFO ] Invariant cache hit.
[2023-03-12 07:57:51] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2177 ms. Remains : 184/184 places, 2108/2108 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 420 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0), p0, p0, (AND p0 p1), (AND p1 p0)]
Finished random walk after 233 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 573 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0), p0, p0, (AND p0 p1), (AND p1 p0)]
Stuttering acceptance computed with spot in 288 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0), p0, p0, (AND p0 p1), (AND p1 p0)]
[2023-03-12 07:57:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:57:53] [INFO ] Invariant cache hit.
[2023-03-12 07:57:54] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:55] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2023-03-12 07:57:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:57:56] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-03-12 07:57:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:57:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 07:58:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 6021 ms returned unknown
Could not prove EG (AND p1 p0)
Stuttering acceptance computed with spot in 315 ms :[(AND p1 p0), (AND p0 p1), (AND p1 p0), p0, p0, (AND p0 p1), (AND p1 p0)]
Product exploration explored 100000 steps with 1420 reset in 602 ms.
Product exploration explored 100000 steps with 1433 reset in 519 ms.
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:58:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:58:04] [INFO ] Invariant cache hit.
[2023-03-12 07:58:05] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
[2023-03-12 07:58:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:58:05] [INFO ] Invariant cache hit.
[2023-03-12 07:58:05] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-12 07:58:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:58:05] [INFO ] Invariant cache hit.
[2023-03-12 07:58:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:05] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2023-03-12 07:58:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:58:05] [INFO ] Invariant cache hit.
[2023-03-12 07:58:06] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2330 ms. Remains : 184/184 places, 2108/2108 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-04 finished in 32379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((X(F(!p2))||p1))))'
Support contains 94 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 19 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:58:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:58:06] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:58:07] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
[2023-03-12 07:58:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:07] [INFO ] Invariant cache hit.
[2023-03-12 07:58:07] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-12 07:58:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:07] [INFO ] Invariant cache hit.
[2023-03-12 07:58:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:10] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2440 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/185 places, 2107/2108 transitions.
Applied a total of 0 rules in 22 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3159 ms. Remains : 183/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p0) p2), (AND p2 p1 (NOT p0)), (AND (NOT p1) (NOT p0) p2), p2, (AND p2 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s146 1) (GEQ s165 1)) (AND (GEQ s107 1) (GEQ s165 1)) (AND (GEQ s136 1) (GEQ s165 1)) (AND (GEQ s117 1) (GEQ s165 1)) (AND (GEQ s97 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 992 reset in 772 ms.
Product exploration explored 100000 steps with 1055 reset in 632 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2)))]
Knowledge based reduction with 7 factoid took 429 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1))]
Finished random walk after 238 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 517 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1))]
Support contains 94 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:58:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:58:13] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:58:14] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
[2023-03-12 07:58:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:14] [INFO ] Invariant cache hit.
[2023-03-12 07:58:14] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-12 07:58:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:14] [INFO ] Invariant cache hit.
[2023-03-12 07:58:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:14] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2023-03-12 07:58:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:14] [INFO ] Invariant cache hit.
[2023-03-12 07:58:15] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2295 ms. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), true, (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1))]
Finished random walk after 267 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 p2 p1), true, (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 351 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1))]
Product exploration explored 100000 steps with 1046 reset in 581 ms.
Product exploration explored 100000 steps with 1133 reset in 605 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1))]
Support contains 94 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 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 183 transition count 2107
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 229 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:58:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:58:18] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:58:19] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
[2023-03-12 07:58:19] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 07:58:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:19] [INFO ] Invariant cache hit.
[2023-03-12 07:58:20] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/183 places, 2107/2107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1597 ms. Remains : 183/183 places, 2107/2107 transitions.
Support contains 94 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 10 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:58:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:58:20] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:58:20] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
[2023-03-12 07:58:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:20] [INFO ] Invariant cache hit.
[2023-03-12 07:58:20] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-12 07:58:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:20] [INFO ] Invariant cache hit.
[2023-03-12 07:58:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:21] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-03-12 07:58:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:21] [INFO ] Invariant cache hit.
[2023-03-12 07:58:22] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1973 ms. Remains : 183/183 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-05 finished in 15321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||G(p1)))||((!p0||G(p1))&&F(!p2)))))'
Support contains 87 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 11 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-12 07:58:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-12 07:58:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:58:22] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
[2023-03-12 07:58:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:58:22] [INFO ] Invariant cache hit.
[2023-03-12 07:58:23] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-12 07:58:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:58:23] [INFO ] Invariant cache hit.
[2023-03-12 07:58:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:24] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2023-03-12 07:58:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-12 07:58:24] [INFO ] Invariant cache hit.
[2023-03-12 07:58:24] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2691 ms. Remains : 185/185 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1) p0), p2, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s83 1) (GEQ s168 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s83 1) (GEQ s168 1)) (AND (GEQ s0 1) (GEQ s49 1) (GEQ s83 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1400 ms.
Product exploration explored 100000 steps with 50000 reset in 1428 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 10 factoid took 219 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-06 finished in 6054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 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 2 place count 184 transition count 2107
Applied a total of 2 rules in 160 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:58:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:58:28] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:58:29] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2023-03-12 07:58:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:29] [INFO ] Invariant cache hit.
[2023-03-12 07:58:29] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 07:58:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:29] [INFO ] Invariant cache hit.
[2023-03-12 07:58:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:30] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1545 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/185 places, 2107/2108 transitions.
Applied a total of 0 rules in 157 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2614 ms. Remains : 183/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 593 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-07 finished in 2705 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)||F(G((!p1||F((X((!p3 U (p4||G(!p3))))&&p2)))))))'
Support contains 177 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 15 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:58:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:58:31] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:58:31] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
[2023-03-12 07:58:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:31] [INFO ] Invariant cache hit.
[2023-03-12 07:58:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-12 07:58:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:31] [INFO ] Invariant cache hit.
[2023-03-12 07:58:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:32] [INFO ] Implicit Places using invariants and state equation in 374 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 437 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/185 places, 2107/2108 transitions.
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1182 ms. Remains : 183/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) p1 (NOT p2))), (OR (AND p1 p3 (NOT p4)) (AND p1 (NOT p2))), (OR (AND p1 p3 (NOT p4)) (AND p1 (NOT p2))), (AND p1 p3 (NOT p4))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4) p3), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p4) p3), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p4) p3), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p4) p3), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s168 1) (GEQ s171 1)) (AND (GEQ s168 1) (GEQ s170 1)) (AND (GEQ s168 1) (GEQ s173 1)) (AND (GEQ s168 1) (GEQ s172 1)) (AND (GEQ s169 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14785 reset in 4508 ms.
Product exploration explored 100000 steps with 14818 reset in 4520 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p4 p3), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2 (NOT p4) p3))), (X (NOT (AND p1 (NOT p2) (NOT p4) p3))), (X (NOT (AND (NOT p1) p2 (NOT p4) p3))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p4) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p3))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 20 factoid took 1727 ms. Reduced automaton from 4 states, 17 edges and 5 AP (stutter sensitive) to 4 states, 17 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) p1 (NOT p2))), (OR (AND p1 p3 (NOT p4)) (AND p1 (NOT p2))), (OR (AND p1 p3 (NOT p4)) (AND p1 (NOT p2))), (AND p1 p3 (NOT p4))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 775 ms. (steps per millisecond=12 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 1051 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 860 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 907 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 899 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 956 ms. (steps per millisecond=10 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 1149 ms. (steps per millisecond=8 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 919 ms. (steps per millisecond=10 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 07:58:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-12 07:58:51] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:58:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:58:55] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-12 07:58:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:58:55] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p4 p3), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2 (NOT p4) p3))), (X (NOT (AND p1 (NOT p2) (NOT p4) p3))), (X (NOT (AND (NOT p1) p2 (NOT p4) p3))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p4) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p3)))), (G (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (G (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (G (NOT (AND p1 p2 p3 (NOT p4)))), (G (NOT (AND p1 (NOT p3) (NOT p4)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) p2 p3 (NOT p4))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p2 (NOT p0))), (F (AND (NOT p1) (NOT p3) (NOT p4)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 (NOT p2))))
Knowledge based reduction with 27 factoid took 1529 ms. Reduced automaton from 4 states, 17 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-08 finished in 25927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0&&F(G(p1)))))))'
Support contains 174 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 18 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:58:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:58:56] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:58:57] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
[2023-03-12 07:58:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:57] [INFO ] Invariant cache hit.
[2023-03-12 07:58:57] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-12 07:58:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:58:57] [INFO ] Invariant cache hit.
[2023-03-12 07:58:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:58] [INFO ] Implicit Places using invariants and state equation in 506 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 615 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/185 places, 2107/2108 transitions.
Applied a total of 0 rules in 20 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1462 ms. Remains : 183/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s34 1) (GEQ s82 1)) (AND (GEQ s24 1) (GEQ s82 1)) (AND (GEQ s5 1) (GEQ s82 1)) (AND (GEQ s54 1) (GEQ s82 1)) (AND (GEQ s73 1) (GEQ s82 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 676 steps with 0 reset in 44 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-09 finished in 1754 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)||G(!p1)))'
Support contains 94 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 182 transition count 2106
Applied a total of 5 rules in 318 ms. Remains 182 /185 variables (removed 3) and now considering 2106/2108 (removed 2) transitions.
[2023-03-12 07:58:58] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 182 cols
[2023-03-12 07:58:58] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 07:58:59] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-12 07:58:59] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
[2023-03-12 07:58:59] [INFO ] Invariant cache hit.
[2023-03-12 07:58:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:58:59] [INFO ] Implicit Places using invariants and state equation in 566 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 750 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/185 places, 2106/2108 transitions.
Applied a total of 0 rules in 286 ms. Remains 181 /181 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1355 ms. Remains : 181/185 places, 2106/2108 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s33 1) (GEQ s81 1)) (AND (GEQ s23 1) (GEQ s81 1)) (AND (GEQ s4 1) (GEQ s81 1)) (AND (GEQ s53 1) (GEQ s81 1)) (AND (GEQ s72 1) (GEQ s81 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-12 finished in 1527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 33 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:59:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2023-03-12 07:59:00] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:59:00] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
[2023-03-12 07:59:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:00] [INFO ] Invariant cache hit.
[2023-03-12 07:59:01] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-12 07:59:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:01] [INFO ] Invariant cache hit.
[2023-03-12 07:59:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:59:02] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/185 places, 2107/2108 transitions.
Applied a total of 0 rules in 16 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2179 ms. Remains : 183/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s0 20) (LT s181 1)) (OR (LT s0 20) (LT s182 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-13 finished in 2266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 83 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 24 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:59:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:02] [INFO ] Invariant cache hit.
[2023-03-12 07:59:03] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
[2023-03-12 07:59:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:03] [INFO ] Invariant cache hit.
[2023-03-12 07:59:03] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-12 07:59:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:03] [INFO ] Invariant cache hit.
[2023-03-12 07:59:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:59:04] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-12 07:59:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:04] [INFO ] Invariant cache hit.
[2023-03-12 07:59:04] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/185 places, 2107/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2366 ms. Remains : 184/185 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 51 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s83 1) (GEQ s167 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s83 1) (GEQ s167 1)) (AND (GEQ s0 1) (GEQ s49 1) (GEQ s83 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1208 ms.
Product exploration explored 100000 steps with 50000 reset in 1103 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P20N10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-15 finished in 4866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-00
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 83 out of 185 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 2107
Applied a total of 2 rules in 40 ms. Remains 184 /185 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2023-03-12 07:59:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:07] [INFO ] Invariant cache hit.
[2023-03-12 07:59:08] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
[2023-03-12 07:59:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:08] [INFO ] Invariant cache hit.
[2023-03-12 07:59:08] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 07:59:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:08] [INFO ] Invariant cache hit.
[2023-03-12 07:59:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:59:09] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
[2023-03-12 07:59:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:09] [INFO ] Invariant cache hit.
[2023-03-12 07:59:09] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 184/185 places, 2107/2108 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2510 ms. Remains : 184/185 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P20N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s83 1) (GEQ s167 1)) (AND (GEQ s0 1) (GEQ s18 1) (GEQ s83 1) (GEQ s167 1)) (AND (GEQ s0 1) (GEQ s49 1) (GEQ s83 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5562 reset in 1085 ms.
Product exploration explored 100000 steps with 5246 reset in 1093 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-12 07:59:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:12] [INFO ] Invariant cache hit.
[2023-03-12 07:59:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 07:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:59:15] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-12 07:59:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:59:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:59:17] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-12 07:59:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:59:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 286 ms returned sat
[2023-03-12 07:59:17] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 86 ms.
[2023-03-12 07:59:19] [INFO ] Added : 66 causal constraints over 17 iterations in 2168 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 230 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:59:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:20] [INFO ] Invariant cache hit.
[2023-03-12 07:59:20] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
[2023-03-12 07:59:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:20] [INFO ] Invariant cache hit.
[2023-03-12 07:59:21] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-12 07:59:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:21] [INFO ] Invariant cache hit.
[2023-03-12 07:59:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:59:21] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2023-03-12 07:59:21] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-12 07:59:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:21] [INFO ] Invariant cache hit.
[2023-03-12 07:59:22] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2878 ms. Remains : 184/184 places, 2107/2107 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-12 07:59:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:23] [INFO ] Invariant cache hit.
[2023-03-12 07:59:24] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 07:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:59:25] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-12 07:59:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:59:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:59:27] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-12 07:59:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:59:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 357 ms returned sat
[2023-03-12 07:59:27] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 75 ms.
[2023-03-12 07:59:29] [INFO ] Added : 66 causal constraints over 17 iterations in 1878 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5379 reset in 1064 ms.
Product exploration explored 100000 steps with 5294 reset in 1055 ms.
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 224 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-12 07:59:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:32] [INFO ] Invariant cache hit.
[2023-03-12 07:59:32] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
[2023-03-12 07:59:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:32] [INFO ] Invariant cache hit.
[2023-03-12 07:59:33] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-12 07:59:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:33] [INFO ] Invariant cache hit.
[2023-03-12 07:59:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:59:33] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2023-03-12 07:59:33] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-12 07:59:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-12 07:59:33] [INFO ] Invariant cache hit.
[2023-03-12 07:59:34] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2703 ms. Remains : 184/184 places, 2107/2107 transitions.
Treatment of property BridgeAndVehicles-COL-V80P20N10-LTLFireability-00 finished in 27414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(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((X(F((!p0&&X(!p0))))||(X(!p1) U (X(G(!p1))||(!p1&&X(!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' '!((X(p0)||G((X(F(!p2))||p1))))'
[2023-03-12 07:59:35] [INFO ] Flatten gal took : 137 ms
[2023-03-12 07:59:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 22 ms.
[2023-03-12 07:59:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 185 places, 2108 transitions and 15787 arcs took 15 ms.
Total runtime 243001 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2463/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2463/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2463/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2463/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393340 kB
MemFree: 7492844 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16120628 kB
Could not compute solution for formula : BridgeAndVehicles-COL-V80P20N10-LTLFireability-00
Could not compute solution for formula : BridgeAndVehicles-COL-V80P20N10-LTLFireability-02
Could not compute solution for formula : BridgeAndVehicles-COL-V80P20N10-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-COL-V80P20N10-LTLFireability-05
BK_STOP 1678608870232
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-COL-V80P20N10-LTLFireability-00
ltl formula formula --ltl=/tmp/2463/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 185 places, 2108 transitions and 15787 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.310 real 0.070 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2463/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2463/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2463/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2463/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** 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:
*** 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:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name BridgeAndVehicles-COL-V80P20N10-LTLFireability-02
ltl formula formula --ltl=/tmp/2463/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 185 places, 2108 transitions and 15787 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.260 real 0.070 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2463/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2463/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2463/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2463/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V80P20N10-LTLFireability-04
ltl formula formula --ltl=/tmp/2463/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 185 places, 2108 transitions and 15787 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.250 real 0.090 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2463/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2463/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2463/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2463/ltl_2_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BridgeAndVehicles-COL-V80P20N10-LTLFireability-05
ltl formula formula --ltl=/tmp/2463/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 185 places, 2108 transitions and 15787 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.230 real 0.080 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2463/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2463/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2463/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2463/ltl_3_
Killing (15) : 2487 2488 2489 2490 2491
Killing (9) : 2487 2488 2489 2490 2491
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-V80P20N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V80P20N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694300116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;