Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620398900147.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-COL-V80P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398900147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.8K Apr 13 00:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 13 00:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 00:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 45K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716325295471

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-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 21:01:37] [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]
[2024-05-21 21:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:01:37] [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.
[2024-05-21 21:01:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 21:01:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 795 ms
[2024-05-21 21:01:38] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 21:01:38] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-05-21 21:01:38] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Remains 15 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-V80P50N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLCardinality-11 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 1604 ms. (24 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 21:01:39] [INFO ] Computed 4 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/22 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 0 solved, 2 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 2 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 947ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 229 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=114 )
Parikh walk visited 2 properties in 69 ms.
[2024-05-21 21:01:40] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:01:40] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 21:01:40] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 219 ms.
[2024-05-21 21:01:40] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 15 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Applied a total of 0 rules in 121 ms. Remains 198 /198 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:01:41] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-05-21 21:01:41] [INFO ] Computed 7 invariants in 55 ms
[2024-05-21 21:01:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/608 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20094 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/198 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:03:07] [INFO ] Deduced a trap composed of 5 places in 479 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/608 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/198 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 97959ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 98061ms
[2024-05-21 21:03:19] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:03:19] [INFO ] Invariant cache hit.
[2024-05-21 21:03:19] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-21 21:03:19] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:03:19] [INFO ] Invariant cache hit.
[2024-05-21 21:03:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:03:21] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:03:21] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:03:21] [INFO ] Invariant cache hit.
[2024-05-21 21:03:21] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:04:39] [INFO ] Deduced a trap composed of 5 places in 696 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/608 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/198 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/608 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/198 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 113262ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 113322ms
Finished structural reductions in LTL mode , in 1 iterations and 213563 ms. Remains : 198/198 places, 3728/3728 transitions.
Support contains 15 out of 198 places after structural reductions.
[2024-05-21 21:05:14] [INFO ] Flatten gal took : 321 ms
[2024-05-21 21:05:15] [INFO ] Flatten gal took : 268 ms
[2024-05-21 21:05:15] [INFO ] Input system was already deterministic with 3728 transitions.
RANDOM walk for 40001 steps (56 resets) in 2801 ms. (14 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40002 steps (20 resets) in 385 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40006 steps (20 resets) in 356 ms. (112 steps per ms) remains 2/2 properties
[2024-05-21 21:05:16] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:05:16] [INFO ] Invariant cache hit.
[2024-05-21 21:05:16] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 252/585 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 42/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/587 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 21/608 variables, 21/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/608 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/608 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/608 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 247 constraints, problems are : Problem set: 0 solved, 2 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 252/585 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 42/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/587 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/608 variables, 21/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/608 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/608 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/608 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 249 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2712 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3071ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 778 ms.
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 881 ms. Remains 195 /198 variables (removed 3) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 21:05:21] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-05-21 21:05:21] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 21:05:21] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20079 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 21:06:54] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 103244ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 103301ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104195 ms. Remains : 195/198 places, 3727/3728 transitions.
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 6010 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.32 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(F(p2))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 3728
Applied a total of 2 rules in 41 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:07:05] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2024-05-21 21:07:05] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 21:07:05] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:08:26] [INFO ] Deduced a trap composed of 5 places in 439 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20100 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 92907ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 92966ms
[2024-05-21 21:08:38] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:08:38] [INFO ] Invariant cache hit.
[2024-05-21 21:08:39] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-21 21:08:39] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:08:39] [INFO ] Invariant cache hit.
[2024-05-21 21:08:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:08:41] [INFO ] Implicit Places using invariants and state equation in 2505 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3340 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/198 places, 3728/3728 transitions.
Applied a total of 0 rules in 25 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96402 ms. Remains : 195/198 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLCardinality-00
Product exploration explored 100000 steps with 441 reset in 1442 ms.
Product exploration explored 100000 steps with 455 reset in 1149 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p0), (X (AND (NOT p1) p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1145 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), false, false, false, false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (56 resets) in 1877 ms. (21 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40018 steps (17 resets) in 428 ms. (93 steps per ms) remains 1/2 properties
BEST_FIRST walk for 5362 steps (0 resets) in 53 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p0), (X (AND (NOT p1) p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p2), (F (NOT (AND (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 14 factoid took 2727 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter insensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 538 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), false, false, false, false, false]
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), false, false, false, false, false]
[2024-05-21 21:08:51] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2024-05-21 21:08:51] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 21:08:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 21:08:53] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2024-05-21 21:08:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:08:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 21:08:54] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-05-21 21:08:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:08:54] [INFO ] [Nat]Added 42 Read/Feed constraints in 236 ms returned sat
[2024-05-21 21:08:56] [INFO ] Deduced a trap composed of 5 places in 1020 ms of which 2 ms to minimize.
[2024-05-21 21:08:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1108 ms
[2024-05-21 21:08:56] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 304 ms.
[2024-05-21 21:08:57] [INFO ] Added : 38 causal constraints over 10 iterations in 1034 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 21:08:57] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:08:57] [INFO ] Invariant cache hit.
[2024-05-21 21:08:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 21:09:00] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2024-05-21 21:09:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:09:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-21 21:09:02] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2024-05-21 21:09:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:09:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 291 ms returned sat
[2024-05-21 21:09:02] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 264 ms.
[2024-05-21 21:09:03] [INFO ] Added : 19 causal constraints over 6 iterations in 813 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 753 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:09:04] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:09:04] [INFO ] Invariant cache hit.
[2024-05-21 21:09:04] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/605 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:10:38] [INFO ] Deduced a trap composed of 5 places in 615 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/605 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 103717ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 103773ms
[2024-05-21 21:10:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:10:48] [INFO ] Invariant cache hit.
[2024-05-21 21:10:48] [INFO ] Implicit Places using invariants in 858 ms returned []
[2024-05-21 21:10:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:10:48] [INFO ] Invariant cache hit.
[2024-05-21 21:10:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:10:52] [INFO ] Implicit Places using invariants and state equation in 3609 ms returned []
Implicit Place search using SMT with State Equation took 4472 ms to find 0 implicit places.
[2024-05-21 21:10:52] [INFO ] Redundant transitions in 307 ms returned []
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:10:52] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:10:52] [INFO ] Invariant cache hit.
[2024-05-21 21:10:52] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:12:08] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/605 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/605 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 110951ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 111010ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 220352 ms. Remains : 195/195 places, 3728/3728 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 758 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter insensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), false, false, false, false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40001 steps (56 resets) in 984 ms. (40 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40002 steps (17 resets) in 226 ms. (176 steps per ms) remains 1/2 properties
BEST_FIRST walk for 5368 steps (0 resets) in 27 ms. (191 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p2), (F (NOT (AND (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 24 factoid took 1969 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter insensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), false, false, false, false, false]
Stuttering acceptance computed with spot in 450 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), false, false, false, false, false]
[2024-05-21 21:12:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:12:48] [INFO ] Invariant cache hit.
[2024-05-21 21:12:50] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 21:12:50] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2024-05-21 21:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:12:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 21:12:52] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-21 21:12:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:12:52] [INFO ] [Nat]Added 42 Read/Feed constraints in 263 ms returned sat
[2024-05-21 21:12:53] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 2 ms to minimize.
[2024-05-21 21:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 774 ms
[2024-05-21 21:12:53] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 241 ms.
[2024-05-21 21:12:54] [INFO ] Added : 38 causal constraints over 10 iterations in 1124 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 21:12:54] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:12:54] [INFO ] Invariant cache hit.
[2024-05-21 21:12:58] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 21:12:59] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2024-05-21 21:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:13:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 21:13:01] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-05-21 21:13:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:13:01] [INFO ] [Nat]Added 42 Read/Feed constraints in 287 ms returned sat
[2024-05-21 21:13:01] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 114 ms.
[2024-05-21 21:13:02] [INFO ] Added : 19 causal constraints over 6 iterations in 695 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), false, false, false, false, false]
Product exploration explored 100000 steps with 431 reset in 1139 ms.
Product exploration explored 100000 steps with 464 reset in 1587 ms.
Built C files in :
/tmp/ltsmin3073256824635292173
[2024-05-21 21:13:05] [INFO ] Too many transitions (3728) to apply POR reductions. Disabling POR matrices.
[2024-05-21 21:13:05] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3073256824635292173
Running compilation step : cd /tmp/ltsmin3073256824635292173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3073256824635292173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3073256824635292173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 762 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:13:09] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:13:09] [INFO ] Invariant cache hit.
[2024-05-21 21:13:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/605 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:14:38] [INFO ] Deduced a trap composed of 5 places in 851 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/605 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 95549ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 95586ms
[2024-05-21 21:14:44] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:14:44] [INFO ] Invariant cache hit.
[2024-05-21 21:14:45] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-21 21:14:45] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:14:45] [INFO ] Invariant cache hit.
[2024-05-21 21:14:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:14:47] [INFO ] Implicit Places using invariants and state equation in 2250 ms returned []
Implicit Place search using SMT with State Equation took 2949 ms to find 0 implicit places.
[2024-05-21 21:14:48] [INFO ] Redundant transitions in 303 ms returned []
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:14:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:14:48] [INFO ] Invariant cache hit.
[2024-05-21 21:14:48] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:16:06] [INFO ] Deduced a trap composed of 5 places in 664 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/605 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/605 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 119425ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 119496ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 219129 ms. Remains : 195/195 places, 3728/3728 transitions.
Built C files in :
/tmp/ltsmin1605644232654424181
[2024-05-21 21:16:47] [INFO ] Too many transitions (3728) to apply POR reductions. Disabling POR matrices.
[2024-05-21 21:16:47] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1605644232654424181
Running compilation step : cd /tmp/ltsmin1605644232654424181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1605644232654424181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1605644232654424181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 21:16:51] [INFO ] Flatten gal took : 210 ms
[2024-05-21 21:16:51] [INFO ] Flatten gal took : 206 ms
[2024-05-21 21:16:52] [INFO ] Time to serialize gal into /tmp/LTL15501460903140208918.gal : 157 ms
[2024-05-21 21:16:52] [INFO ] Time to serialize properties into /tmp/LTL17044354660204996234.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15501460903140208918.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15305423230917937166.hoa' '-atoms' '/tmp/LTL17044354660204996234.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17044354660204996234.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15305423230917937166.hoa
Detected timeout of ITS tools.
[2024-05-21 21:17:07] [INFO ] Flatten gal took : 121 ms
[2024-05-21 21:17:07] [INFO ] Flatten gal took : 124 ms
[2024-05-21 21:17:07] [INFO ] Time to serialize gal into /tmp/LTL4327621469559721147.gal : 39 ms
[2024-05-21 21:17:07] [INFO ] Time to serialize properties into /tmp/LTL6598460950414045684.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4327621469559721147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6598460950414045684.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("(ROUTE_A>=1)")U("(CAPACITE>ROUTE_B)"))&&(X(F("(SUR_PONT_A>ATTENTE_A)")))))
Formula 0 simplified : (!"(ROUTE_A>=1)" R !"(CAPACITE>ROUTE_B)") | XG!"(SUR_PONT_A>ATTENTE_A)"
Detected timeout of ITS tools.
[2024-05-21 21:17:22] [INFO ] Flatten gal took : 111 ms
[2024-05-21 21:17:22] [INFO ] Applying decomposition
[2024-05-21 21:17:23] [INFO ] Flatten gal took : 149 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2423621682721560039.txt' '-o' '/tmp/graph2423621682721560039.bin' '-w' '/tmp/graph2423621682721560039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2423621682721560039.bin' '-l' '-1' '-v' '-w' '/tmp/graph2423621682721560039.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:17:23] [INFO ] Decomposing Gal with order
[2024-05-21 21:17:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:17:24] [INFO ] Removed a total of 3835 redundant transitions.
[2024-05-21 21:17:25] [INFO ] Flatten gal took : 1241 ms
[2024-05-21 21:17:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 752 labels/synchronizations in 44 ms.
[2024-05-21 21:17:25] [INFO ] Time to serialize gal into /tmp/LTL11741678669612101324.gal : 15 ms
[2024-05-21 21:17:25] [INFO ] Time to serialize properties into /tmp/LTL16852478277839212788.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11741678669612101324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16852478277839212788.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(gi2.gu2.ROUTE_A>=1)")U("(gu0.CAPACITE>gu0.ROUTE_B)"))&&(X(F("(gu1.SUR_PONT_A>gu1.ATTENTE_A)")))))
Formula 0 simplified : (!"(gi2.gu2.ROUTE_A>=1)" R !"(gu0.CAPACITE>gu0.ROUTE_B)") | XG!"(gu1.SUR_PONT_A>gu1.ATTENTE_A)"
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLCardinality-00 finished in 635125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 6010 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 493 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:17:41] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2024-05-21 21:17:41] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 21:17:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:19:11] [INFO ] Deduced a trap composed of 5 places in 541 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 49)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20102 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 99080ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 99117ms
[2024-05-21 21:19:20] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:19:20] [INFO ] Invariant cache hit.
[2024-05-21 21:19:20] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-21 21:19:20] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:19:20] [INFO ] Invariant cache hit.
[2024-05-21 21:19:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:19:23] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3106 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/198 places, 3728/3728 transitions.
Applied a total of 0 rules in 585 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103321 ms. Remains : 194/198 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLCardinality-01
Product exploration explored 100000 steps with 2097 reset in 1084 ms.
Product exploration explored 100000 steps with 2168 reset in 825 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/194 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (56 resets) in 1042 ms. (38 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 622 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40013 steps (20 resets) in 591 ms. (67 steps per ms) remains 2/2 properties
[2024-05-21 21:19:26] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2024-05-21 21:19:26] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 21:19:26] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 248/257 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 345/602 variables, 183/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 42/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/604 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/604 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 241 constraints, problems are : Problem set: 0 solved, 2 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 248/257 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 345/602 variables, 183/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 42/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/604 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 243 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2266ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 377 ms.
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 652 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:19:30] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:19:30] [INFO ] Invariant cache hit.
[2024-05-21 21:19:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:21:01] [INFO ] Deduced a trap composed of 5 places in 510 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20085 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 101008ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 101097ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101761 ms. Remains : 194/194 places, 3728/3728 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 407 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 978 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:21:12] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:21:12] [INFO ] Invariant cache hit.
[2024-05-21 21:21:12] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:22:44] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20152 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 103393ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 103436ms
[2024-05-21 21:22:56] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:22:56] [INFO ] Invariant cache hit.
[2024-05-21 21:23:02] [INFO ] Implicit Places using invariants in 6574 ms returned []
[2024-05-21 21:23:02] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:23:02] [INFO ] Invariant cache hit.
[2024-05-21 21:23:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:23:05] [INFO ] Implicit Places using invariants and state equation in 2469 ms returned []
Implicit Place search using SMT with State Equation took 9063 ms to find 0 implicit places.
[2024-05-21 21:23:05] [INFO ] Redundant transitions in 127 ms returned []
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:23:05] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:23:05] [INFO ] Invariant cache hit.
[2024-05-21 21:23:05] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:24:23] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3725 unsolved

BK_STOP 1716326695444

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-V80P50N20"
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-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V80P50N20, 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 r048-tajo-171620398900147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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