Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764600163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BridgeAndVehicles-COL-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764600163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 37K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748737571334

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-01 00:26:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 00:26:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:26:13] [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.
[2025-06-01 00:26:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 00:26:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 883 ms
[2025-06-01 00:26:14] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 00:26:14] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 10 ms.
[2025-06-01 00:26:14] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Remains 14 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-V04P05N02-LTLCardinality-14 TRUE 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.1 ms
RANDOM walk for 40000 steps (8 resets) in 1955 ms. (20 steps per ms) remains 5/26 properties
BEST_FIRST walk for 40002 steps (8 resets) in 674 ms. (59 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
// Phase 1: matrix 10 rows 12 cols
[2025-06-01 00:26:16] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 00:26:16] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-01 00:26:16] [INFO ] Flatten gal took : 26 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 00:26:16] [INFO ] Flatten gal took : 6 ms
Arc [1:1*[(MOD (ADD $cA 1) 5)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 5) 5) 5)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 3)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2025-06-01 00:26:16] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 30 ms.
[2025-06-01 00:26:16] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 12 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 17 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
Running 49 sub problems to find dead transitions.
[2025-06-01 00:26:16] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2025-06-01 00:26:16] [INFO ] Computed 6 invariants in 3 ms
[2025-06-01 00:26:16] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:17] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:17] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 5 (OVERLAPS) 34/61 variables, 27/35 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 6/41 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 41 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 34/61 variables, 27/35 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 6/41 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 39/80 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/80 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/80 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 80 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 39/49 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3547ms problems are : Problem set: 10 solved, 39 unsolved
Search for dead transitions found 10 dead transitions in 3553ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2025-06-01 00:26:20] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 27 cols
[2025-06-01 00:26:20] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-01 00:26:20] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 00:26:20] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/28 places, 42/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3808 ms. Remains : 27/28 places, 42/52 transitions.
Support contains 12 out of 27 places after structural reductions.
[2025-06-01 00:26:20] [INFO ] Flatten gal took : 23 ms
[2025-06-01 00:26:20] [INFO ] Flatten gal took : 11 ms
[2025-06-01 00:26:20] [INFO ] Input system was already deterministic with 42 transitions.
RANDOM walk for 40000 steps (917 resets) in 409 ms. (97 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40003 steps (379 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (379 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (500 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
[2025-06-01 00:26:20] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:20] [INFO ] Invariant cache hit.
[2025-06-01 00:26:20] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/17 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/43 variables, 17/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/56 variables, 9/33 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 2/38 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/57 variables, 1/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/57 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/57 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 39 constraints, problems are : Problem set: 1 solved, 2 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/25 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/51 variables, 10/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/51 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 4/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/53 variables, 1/34 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/53 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/53 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/57 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/57 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/57 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/57 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 41 constraints, problems are : Problem set: 1 solved, 2 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 42/42 transitions.
Graph (complete) has 137 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 26 /27 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2025-06-01 00:26:21] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2025-06-01 00:26:21] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:26:21] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:21] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 77 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2040ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2050 ms. Remains : 26/27 places, 42/42 transitions.
RANDOM walk for 40000 steps (919 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (380 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (377 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 84 ms. (steps per millisecond=119 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 52 ms. (steps per millisecond=192 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 18 stabilizing places and 18 stable transitions
Graph (complete) has 194 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Graph (complete) has 194 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 26 /27 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2025-06-01 00:26:24] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:24] [INFO ] Invariant cache hit.
[2025-06-01 00:26:24] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:24] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:25] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/56 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2227 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2916ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2917ms
[2025-06-01 00:26:26] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:27] [INFO ] Implicit Places using invariants in 71 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3003 ms. Remains : 24/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 514 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-01
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-01 finished in 3630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(F(p1) U X(p0))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Applied a total of 1 rules in 2 ms. Remains 26 /27 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2025-06-01 00:26:27] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:27] [INFO ] Invariant cache hit.
[2025-06-01 00:26:27] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:27] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:29] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/56 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3068ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3069ms
[2025-06-01 00:26:30] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:30] [INFO ] Implicit Places using invariants in 92 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3168 ms. Remains : 24/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 25 steps with 3 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-02 finished in 3587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Graph (complete) has 194 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 40
Applied a total of 6 rules in 11 ms. Remains 23 /27 variables (removed 4) and now considering 40/42 (removed 2) transitions.
[2025-06-01 00:26:31] [INFO ] Flow matrix only has 28 transitions (discarded 12 similar events)
// Phase 1: matrix 28 rows 23 cols
[2025-06-01 00:26:31] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:31] [INFO ] Implicit Places using invariants in 75 ms returned [6, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/27 places, 40/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 21/27 places, 40/42 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-03
Product exploration explored 100000 steps with 2890 reset in 358 ms.
Product exploration explored 100000 steps with 2891 reset in 276 ms.
Computed a total of 12 stabilizing places and 16 stable transitions
Computed a total of 12 stabilizing places and 16 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 219 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 46 ms :[(NOT p0)]
RANDOM walk for 74 steps (2 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 248 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 40/40 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2025-06-01 00:26:32] [INFO ] Flow matrix only has 28 transitions (discarded 12 similar events)
// Phase 1: matrix 28 rows 21 cols
[2025-06-01 00:26:32] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-01 00:26:32] [INFO ] Flow matrix only has 28 transitions (discarded 12 similar events)
[2025-06-01 00:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 00:26:32] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 00:26:32] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2025-06-01 00:26:32] [INFO ] Flow matrix only has 28 transitions (discarded 12 similar events)
[2025-06-01 00:26:32] [INFO ] Invariant cache hit.
[2025-06-01 00:26:32] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:32] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 28/49 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:33] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 31 constraints, problems are : Problem set: 0 solved, 37 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 28/49 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 68 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1443 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2251ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 2251ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2380 ms. Remains : 21/21 places, 40/40 transitions.
Computed a total of 12 stabilizing places and 16 stable transitions
Computed a total of 12 stabilizing places and 16 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 276 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 46 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 239 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2892 reset in 124 ms.
Product exploration explored 100000 steps with 2891 reset in 145 ms.
Built C files in :
/tmp/ltsmin2290530204360265880
[2025-06-01 00:26:36] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2025-06-01 00:26:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:26:36] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2025-06-01 00:26:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:26:36] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2025-06-01 00:26:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:26:36] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2290530204360265880
Running compilation step : cd /tmp/ltsmin2290530204360265880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin2290530204360265880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin2290530204360265880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11338171833113497328.hoa' '--buchi-type=spotba'
LTSmin run took 182 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-03 finished in 5579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X((p1&&(p2||G(p1))))))) U G(p3)))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 25 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 3 ms. Remains 25 /27 variables (removed 2) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2025-06-01 00:26:36] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2025-06-01 00:26:36] [INFO ] Computed 7 invariants in 12 ms
[2025-06-01 00:26:36] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:37] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 75 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2034ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2035ms
[2025-06-01 00:26:38] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2025-06-01 00:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:38] [INFO ] Implicit Places using invariants in 58 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 41/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2098 ms. Remains : 24/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 1164 ms :[(NOT p3), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 52 steps with 8 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-04 finished in 3339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&X(G(!p1)))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Applied a total of 1 rules in 2 ms. Remains 26 /27 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2025-06-01 00:26:40] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2025-06-01 00:26:40] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:26:40] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:40] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 77 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2646ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2647ms
[2025-06-01 00:26:42] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:42] [INFO ] Implicit Places using invariants in 78 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2732 ms. Remains : 25/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, true, p1, p1]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-05 finished in 2930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 25 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2025-06-01 00:26:43] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2025-06-01 00:26:43] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:26:43] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:43] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 75 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2546ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2547ms
[2025-06-01 00:26:45] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2025-06-01 00:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:45] [INFO ] Implicit Places using invariants in 69 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 41/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2621 ms. Remains : 24/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 15 stabilizing places and 17 stable transitions
Computed a total of 15 stabilizing places and 17 stable transitions
Detected a total of 15/24 stabilizing places and 17/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-06 finished in 3222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p1))))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2025-06-01 00:26:46] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 27 cols
[2025-06-01 00:26:46] [INFO ] Computed 8 invariants in 1 ms
[2025-06-01 00:26:46] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:46] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:47] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 41 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1513 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 80 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1678 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3209ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3210ms
[2025-06-01 00:26:49] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:49] [INFO ] Implicit Places using invariants in 76 ms returned [8, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3290 ms. Remains : 25/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Computed a total of 16 stabilizing places and 18 stable transitions
Graph (complete) has 172 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 18 stable transitions
Detected a total of 16/25 stabilizing places and 18/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-07 finished in 3656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0))) U (p0&&F(p1))))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2025-06-01 00:26:49] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2025-06-01 00:26:49] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:26:49] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:50] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 77 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1885 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2680ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2681ms
[2025-06-01 00:26:52] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:52] [INFO ] Implicit Places using invariants in 73 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2759 ms. Remains : 24/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-08 finished in 3132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Graph (complete) has 194 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 9 ms. Remains 25 /27 variables (removed 2) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2025-06-01 00:26:53] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2025-06-01 00:26:53] [INFO ] Computed 7 invariants in 6 ms
[2025-06-01 00:26:53] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:53] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 75 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1812 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2860ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2861ms
[2025-06-01 00:26:55] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2025-06-01 00:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:55] [INFO ] Implicit Places using invariants in 57 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/27 places, 41/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2933 ms. Remains : 23/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-09
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-09 finished in 3027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 25 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 1 ms. Remains 25 /27 variables (removed 2) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2025-06-01 00:26:56] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2025-06-01 00:26:56] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:26:56] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:56] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 75 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1995ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1996ms
[2025-06-01 00:26:58] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2025-06-01 00:26:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:26:58] [INFO ] Implicit Places using invariants in 57 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/27 places, 41/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2056 ms. Remains : 23/27 places, 41/42 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 13 steps with 6 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-10 finished in 2165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&X(X(X(X(p2)))))))))'
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2025-06-01 00:26:58] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 27 cols
[2025-06-01 00:26:58] [INFO ] Computed 8 invariants in 1 ms
[2025-06-01 00:26:58] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:26:59] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 41 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1184 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 80 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3032ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3033ms
[2025-06-01 00:27:01] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-06-01 00:27:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:27:01] [INFO ] Implicit Places using invariants in 71 ms returned [8, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3107 ms. Remains : 25/27 places, 42/42 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 55 steps with 1 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-13 finished in 3446 ms.
All properties solved by simple procedures.
Total runtime 48083 ms.

BK_STOP 1748737621774

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-V04P05N02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V04P05N02, 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 r016-smll-174853764600163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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