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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 12:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678606410640

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:33:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 07:33:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:33: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:33:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 07:33:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 435 ms
[2023-03-12 07:33:32] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 07:33:33] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-12 07:33:33] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15 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.1 ms
Remains 9 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.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Finished Best-First random walk after 1363 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=454 )
[2023-03-12 07:33:33] [INFO ] Flatten gal took : 13 ms
[2023-03-12 07:33:33] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 07:33:33] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 92 ms.
[2023-03-12 07:33:33] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 52 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:33:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-12 07:33:33] [INFO ] Computed 7 place invariants in 21 ms
[2023-03-12 07:33:34] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
[2023-03-12 07:33:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:33:34] [INFO ] Invariant cache hit.
[2023-03-12 07:33:34] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-12 07:33:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:33:34] [INFO ] Invariant cache hit.
[2023-03-12 07:33:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:33:35] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2023-03-12 07:33:35] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:33:35] [INFO ] Invariant cache hit.
[2023-03-12 07:33:36] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2893 ms. Remains : 138/138 places, 2348/2348 transitions.
Support contains 13 out of 138 places after structural reductions.
[2023-03-12 07:33:36] [INFO ] Flatten gal took : 168 ms
[2023-03-12 07:33:36] [INFO ] Flatten gal took : 188 ms
[2023-03-12 07:33:37] [INFO ] Input system was already deterministic with 2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:33:37] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:33:37] [INFO ] Invariant cache hit.
[2023-03-12 07:33:37] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:33:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-12 07:33:37] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:33:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:33:38] [INFO ] After 94ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:33:38] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 554 ms.
[2023-03-12 07:33:38] [INFO ] After 1222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 534 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:33:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:33:39] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-12 07:33:40] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1562 ms. Remains : 135/138 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267102 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267102 steps, saw 71522 distinct states, run finished after 3005 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:33:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:33:43] [INFO ] Invariant cache hit.
[2023-03-12 07:33:43] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:33:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:33:43] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:33:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:33:45] [INFO ] After 1042ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:33:45] [INFO ] After 1632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-12 07:33:45] [INFO ] After 2139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 415 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 329 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:33:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:33:46] [INFO ] Invariant cache hit.
[2023-03-12 07:33:46] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-12 07:33:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:33:46] [INFO ] Invariant cache hit.
[2023-03-12 07:33:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:33:48] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1504 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 256 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2103 ms. Remains : 133/135 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 257374 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257374 steps, saw 68959 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:33:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 07:33:51] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 07:33:51] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:33:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:33:51] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:33:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:33:51] [INFO ] After 173ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:33:52] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-12 07:33:52] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 215 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 211 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:33:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:33:52] [INFO ] Invariant cache hit.
[2023-03-12 07:33:53] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-12 07:33:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:33:53] [INFO ] Invariant cache hit.
[2023-03-12 07:33:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:33:53] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2023-03-12 07:33:53] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-12 07:33:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:33:53] [INFO ] Invariant cache hit.
[2023-03-12 07:33:54] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2107 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 20 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2023-03-12 07:33:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:33:54] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 07:33:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 07:33:54] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 07:33:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 07:33:54] [INFO ] After 75ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 07:33:54] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-12 07:33:55] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 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 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 2347
Applied a total of 3 rules in 313 ms. Remains 136 /138 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:33:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2023-03-12 07:33:55] [INFO ] Computed 6 place invariants in 12 ms
[2023-03-12 07:33:56] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
[2023-03-12 07:33:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:33:56] [INFO ] Invariant cache hit.
[2023-03-12 07:33:56] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 07:33:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:33:56] [INFO ] Invariant cache hit.
[2023-03-12 07:33:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:33:57] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned [54, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1515 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 234 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2884 ms. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 274 reset in 942 ms.
Product exploration explored 100000 steps with 274 reset in 1022 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 3639 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-12 07:34:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 07:34:00] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:34:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:34:01] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-12 07:34:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:34:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:34:02] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-12 07:34:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 831 ms returned sat
[2023-03-12 07:34:03] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 1 ms to minimize.
[2023-03-12 07:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1601 ms
[2023-03-12 07:34:05] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 143 ms.
[2023-03-12 07:34:05] [INFO ] Added : 20 causal constraints over 5 iterations in 434 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 360 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:34:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:05] [INFO ] Invariant cache hit.
[2023-03-12 07:34:06] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
[2023-03-12 07:34:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:06] [INFO ] Invariant cache hit.
[2023-03-12 07:34:07] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-12 07:34:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:07] [INFO ] Invariant cache hit.
[2023-03-12 07:34:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:07] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2023-03-12 07:34:07] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 07:34:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:07] [INFO ] Invariant cache hit.
[2023-03-12 07:34:08] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3138 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 3639 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 132 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 154 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-12 07:34:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:09] [INFO ] Invariant cache hit.
[2023-03-12 07:34:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:34:10] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-12 07:34:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:34:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:34:10] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-12 07:34:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:11] [INFO ] [Nat]Added 42 Read/Feed constraints in 630 ms returned sat
[2023-03-12 07:34:11] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2023-03-12 07:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1184 ms
[2023-03-12 07:34:12] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 85 ms.
[2023-03-12 07:34:12] [INFO ] Added : 20 causal constraints over 5 iterations in 196 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 274 reset in 783 ms.
Product exploration explored 100000 steps with 274 reset in 775 ms.
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 212 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:34:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:14] [INFO ] Invariant cache hit.
[2023-03-12 07:34:15] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
[2023-03-12 07:34:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:15] [INFO ] Invariant cache hit.
[2023-03-12 07:34:15] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-12 07:34:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:15] [INFO ] Invariant cache hit.
[2023-03-12 07:34:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:16] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2023-03-12 07:34:16] [INFO ] Redundant transitions in 160 ms returned []
[2023-03-12 07:34:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:16] [INFO ] Invariant cache hit.
[2023-03-12 07:34:17] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3103 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00 finished in 22757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 13 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:34:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 07:34:18] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 07:34:18] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
[2023-03-12 07:34:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:18] [INFO ] Invariant cache hit.
[2023-03-12 07:34:19] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-12 07:34:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:19] [INFO ] Invariant cache hit.
[2023-03-12 07:34:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:20] [INFO ] Implicit Places using invariants and state equation in 956 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1255 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 21 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2048 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02 finished in 2272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 217 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:34:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-12 07:34:20] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-12 07:34:21] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
[2023-03-12 07:34:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:21] [INFO ] Invariant cache hit.
[2023-03-12 07:34:21] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-12 07:34:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:21] [INFO ] Invariant cache hit.
[2023-03-12 07:34:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:22] [INFO ] Implicit Places using invariants and state equation in 819 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1206 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 420 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2578 ms. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s108 s52), p0:(LEQ 1 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 241 reset in 1044 ms.
Product exploration explored 100000 steps with 241 reset in 880 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3642 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 291 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 234 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 275 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:34:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:34:25] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 07:34:26] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
[2023-03-12 07:34:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:26] [INFO ] Invariant cache hit.
[2023-03-12 07:34:26] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-12 07:34:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:26] [INFO ] Invariant cache hit.
[2023-03-12 07:34:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:27] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2023-03-12 07:34:27] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-12 07:34:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:27] [INFO ] Invariant cache hit.
[2023-03-12 07:34:28] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2769 ms. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3642 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 607 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 241 reset in 744 ms.
Product exploration explored 100000 steps with 241 reset in 759 ms.
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 211 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:34:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:30] [INFO ] Invariant cache hit.
[2023-03-12 07:34:31] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
[2023-03-12 07:34:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:31] [INFO ] Invariant cache hit.
[2023-03-12 07:34:31] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-12 07:34:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:31] [INFO ] Invariant cache hit.
[2023-03-12 07:34:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:32] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2023-03-12 07:34:32] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-12 07:34:32] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:32] [INFO ] Invariant cache hit.
[2023-03-12 07:34:33] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2644 ms. Remains : 136/136 places, 2348/2348 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03 finished in 13170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 216 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:34:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:34:33] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:34:34] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
[2023-03-12 07:34:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:34] [INFO ] Invariant cache hit.
[2023-03-12 07:34:34] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-12 07:34:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:34] [INFO ] Invariant cache hit.
[2023-03-12 07:34:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:35] [INFO ] Implicit Places using invariants and state equation in 773 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1157 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 213 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2394 ms. Remains : 134/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s105 s53)], 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 415 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 finished in 2524 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)&&F(p1)))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 20 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:34:35] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:35] [INFO ] Invariant cache hit.
[2023-03-12 07:34:36] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
[2023-03-12 07:34:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:36] [INFO ] Invariant cache hit.
[2023-03-12 07:34:37] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-12 07:34:37] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:34:37] [INFO ] Invariant cache hit.
[2023-03-12 07:34:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:37] [INFO ] Implicit Places using invariants and state equation in 810 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1089 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 14 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1905 ms. Remains : 134/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s107 s108)), p0:(LEQ 1 s53)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08 finished in 2047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 226 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:34:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:34:38] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-12 07:34:39] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
[2023-03-12 07:34:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:39] [INFO ] Invariant cache hit.
[2023-03-12 07:34:39] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-12 07:34:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:39] [INFO ] Invariant cache hit.
[2023-03-12 07:34:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:40] [INFO ] Implicit Places using invariants and state equation in 922 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1234 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 239 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2523 ms. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s104), p1:(LEQ 1 (ADD s108 s109))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1472 steps with 7 reset in 23 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09 finished in 2724 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 U p1)||G(p2)||G(F(!p0)))))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 37 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:34:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:34:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:34:41] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
[2023-03-12 07:34:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:41] [INFO ] Invariant cache hit.
[2023-03-12 07:34:41] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-12 07:34:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:41] [INFO ] Invariant cache hit.
[2023-03-12 07:34:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:42] [INFO ] Implicit Places using invariants and state equation in 925 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 21 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2118 ms. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND p0 (NOT p2)), false, (AND (NOT p1) p0), p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s53 (ADD s109 s110)), p0:(GT 3 s106), p2:(LEQ (ADD s107 s108) s0)], 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1048 ms.
Product exploration explored 100000 steps with 50000 reset in 791 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0) p2)
Knowledge based reduction with 14 factoid took 645 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13 finished in 4963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((G(p2)||p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 41 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:34:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:45] [INFO ] Invariant cache hit.
[2023-03-12 07:34:46] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
[2023-03-12 07:34:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:46] [INFO ] Invariant cache hit.
[2023-03-12 07:34:46] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 07:34:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:46] [INFO ] Invariant cache hit.
[2023-03-12 07:34:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:47] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-12 07:34:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:47] [INFO ] Invariant cache hit.
[2023-03-12 07:34:48] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2347/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2635 ms. Remains : 135/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s53 s107), p1:(OR (GT 1 s107) (GT 3 s106)), p2:(GT 3 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 926 reset in 638 ms.
Product exploration explored 100000 steps with 934 reset in 699 ms.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/135 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 448 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 07:34:50] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:50] [INFO ] Invariant cache hit.
[2023-03-12 07:34:50] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 14 factoid took 710 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:34:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:51] [INFO ] Invariant cache hit.
[2023-03-12 07:34:52] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
[2023-03-12 07:34:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:52] [INFO ] Invariant cache hit.
[2023-03-12 07:34:52] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-12 07:34:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:52] [INFO ] Invariant cache hit.
[2023-03-12 07:34:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:34:53] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-12 07:34:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:53] [INFO ] Invariant cache hit.
[2023-03-12 07:34:54] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2808 ms. Remains : 135/135 places, 2347/2347 transitions.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/135 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 342 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 103 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 351 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 928 reset in 680 ms.
Product exploration explored 100000 steps with 925 reset in 603 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
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 135 transition count 2347
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 268 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:34:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:34:57] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:34:58] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
[2023-03-12 07:34:58] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 07:34:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:58] [INFO ] Invariant cache hit.
[2023-03-12 07:34:58] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/135 places, 2347/2347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1837 ms. Remains : 135/135 places, 2347/2347 transitions.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 15 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:34:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:34:58] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:34:59] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
[2023-03-12 07:34:59] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:59] [INFO ] Invariant cache hit.
[2023-03-12 07:34:59] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-12 07:34:59] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:34:59] [INFO ] Invariant cache hit.
[2023-03-12 07:35:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:35:00] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2023-03-12 07:35:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:35:00] [INFO ] Invariant cache hit.
[2023-03-12 07:35:01] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2690 ms. Remains : 135/135 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14 finished in 16009 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||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' '!(X((F(p0)||G((G(p2)||p1)))))'
[2023-03-12 07:35:02] [INFO ] Flatten gal took : 143 ms
[2023-03-12 07:35:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 07:35:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 2348 transitions and 18090 arcs took 26 ms.
Total runtime 89887 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1442/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1442/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1442/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14

BK_STOP 1678606504013

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00
ltl formula formula --ltl=/tmp/1442/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 2348 transitions and 18090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.110 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1442/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1442/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1442/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1442/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03
ltl formula formula --ltl=/tmp/1442/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 2348 transitions and 18090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.080 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1442/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1442/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1442/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1442/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5613f72013f4]
1: pnml2lts-mc(+0xa2496) [0x5613f7201496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f49791f6140]
3: pnml2lts-mc(+0x405be5) [0x5613f7564be5]
4: pnml2lts-mc(+0x16b3f9) [0x5613f72ca3f9]
5: pnml2lts-mc(+0x164ac4) [0x5613f72c3ac4]
6: pnml2lts-mc(+0x272e0a) [0x5613f73d1e0a]
7: pnml2lts-mc(+0xb61f0) [0x5613f72151f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f49790494d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f497904967a]
10: pnml2lts-mc(+0xa1581) [0x5613f7200581]
11: pnml2lts-mc(+0xa1910) [0x5613f7200910]
12: pnml2lts-mc(+0xa32a2) [0x5613f72022a2]
13: pnml2lts-mc(+0xa50f4) [0x5613f72040f4]
14: pnml2lts-mc(+0x3f34b3) [0x5613f75524b3]
15: pnml2lts-mc(+0x7c63d) [0x5613f71db63d]
16: pnml2lts-mc(+0x67d86) [0x5613f71c6d86]
17: pnml2lts-mc(+0x60a8a) [0x5613f71bfa8a]
18: pnml2lts-mc(+0x5eb15) [0x5613f71bdb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f4979031d0a]
20: pnml2lts-mc(+0x6075e) [0x5613f71bf75e]
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14
ltl formula formula --ltl=/tmp/1442/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 138 places, 2348 transitions and 18090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.100 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1442/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1442/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1442/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1442/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V50P50N20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694200099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N20.tgz
mv BridgeAndVehicles-COL-V50P50N20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;