Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620398700035.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-V20P10N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398700035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.9K Apr 13 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 02:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:35 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.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 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 41K 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-V20P10N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716320791723

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-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 19:46:33] [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 19:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:46:34] [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 19:46:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:46:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 645 ms
[2024-05-21 19:46:34] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 19:46:34] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-05-21 19:46:34] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-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.11 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-V20P10N50-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 40000 steps (8 resets) in 2041 ms. (19 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40003 steps (8 resets) in 454 ms. (87 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/3 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 19:46:36] [INFO ] Computed 4 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 311ms 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.
[2024-05-21 19:46:36] [INFO ] Flatten gal took : 29 ms
[2024-05-21 19:46:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:46:36] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 19:46:36] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 77 ms.
[2024-05-21 19:46:36] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 15 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 51 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 19:46:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 19:46:36] [INFO ] Computed 7 invariants in 20 ms
[2024-05-21 19:46:36] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 19:47:06] [INFO ] Deduced a trap composed of 5 places in 683 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 19:47:32] [INFO ] Deduced a trap composed of 55 places in 278 ms of which 3 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1545 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 7 constraints, problems are : Problem set: 8 solved, 2217 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 59567ms problems are : Problem set: 8 solved, 2217 unsolved
Search for dead transitions found 8 dead transitions in 59629ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 8 transitions.
[2024-05-21 19:47:36] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 19:47:36] [INFO ] Computed 7 invariants in 9 ms
[2024-05-21 19:47:36] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-21 19:47:36] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:47:36] [INFO ] Invariant cache hit.
[2024-05-21 19:47:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:47:37] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 2220/2228 transitions.
Applied a total of 0 rules in 28 ms. Remains 108 /108 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61155 ms. Remains : 108/108 places, 2220/2228 transitions.
Support contains 15 out of 108 places after structural reductions.
[2024-05-21 19:47:38] [INFO ] Flatten gal took : 176 ms
[2024-05-21 19:47:38] [INFO ] Flatten gal took : 144 ms
[2024-05-21 19:47:38] [INFO ] Input system was already deterministic with 2220 transitions.
RANDOM walk for 40001 steps (228 resets) in 1945 ms. (20 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40002 steps (81 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (108 resets) in 277 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (59 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
[2024-05-21 19:47:39] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:47:39] [INFO ] Invariant cache hit.
[2024-05-21 19:47:39] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/15 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 290/305 variables, 15/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 102/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 93/398 variables, 93/214 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 3/217 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 2 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/93 variables, 9/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/345 variables, 46/58 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 2/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 102/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/163 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/163 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/347 variables, 1/164 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 2/166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/398 variables, 51/217 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 1/218 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/398 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 218 constraints, problems are : Problem set: 2 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 304 ms. Remains 106 /108 variables (removed 2) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 19:47:40] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 19:47:40] [INFO ] Computed 5 invariants in 15 ms
[2024-05-21 19:47:40] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 19:48:05] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 59028ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 59060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59375 ms. Remains : 106/108 places, 2220/2220 transitions.
RANDOM walk for 40000 steps (229 resets) in 553 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (59 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 276917 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 276917 steps, saw 72444 distinct states, run finished after 3006 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-21 19:48:42] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:48:42] [INFO ] Invariant cache hit.
[2024-05-21 19:48:42] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/67 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/342 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 102/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/344 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 52/396 variables, 52/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/67 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/342 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 102/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/344 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 52/396 variables, 52/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2220/2220 transitions.
Applied a total of 0 rules in 354 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 106/106 places, 2220/2220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2220/2220 transitions.
Applied a total of 0 rules in 291 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
[2024-05-21 19:48:43] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:48:43] [INFO ] Invariant cache hit.
[2024-05-21 19:48:44] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-21 19:48:44] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:48:44] [INFO ] Invariant cache hit.
[2024-05-21 19:48:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:48:45] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1859 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/106 places, 2220/2220 transitions.
Applied a total of 0 rules in 213 ms. Remains 105 /105 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2369 ms. Remains : 105/106 places, 2220/2220 transitions.
RANDOM walk for 40000 steps (228 resets) in 497 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (59 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 289620 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 289620 steps, saw 75368 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-21 19:48:49] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 105 cols
[2024-05-21 19:48:49] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 19:48:49] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/67 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 274/341 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 102/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/343 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 52/395 variables, 52/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/67 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 274/341 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 102/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 52/395 variables, 52/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/395 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/395 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 560ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2220/2220 transitions.
Applied a total of 0 rules in 196 ms. Remains 105 /105 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 105/105 places, 2220/2220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2220/2220 transitions.
Applied a total of 0 rules in 210 ms. Remains 105 /105 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
[2024-05-21 19:48:50] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:48:50] [INFO ] Invariant cache hit.
[2024-05-21 19:48:50] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-21 19:48:50] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:48:50] [INFO ] Invariant cache hit.
[2024-05-21 19:48:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:48:51] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2024-05-21 19:48:51] [INFO ] Redundant transitions in 134 ms returned []
Running 2217 sub problems to find dead transitions.
[2024-05-21 19:48:51] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:48:51] [INFO ] Invariant cache hit.
[2024-05-21 19:48:51] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 19:49:16] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 2 ms to minimize.
[2024-05-21 19:49:34] [INFO ] Deduced a trap composed of 55 places in 252 ms of which 1 ms to minimize.
Problem TDEAD1588 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2047 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/395 variables, and 7 constraints, problems are : Problem set: 10 solved, 2207 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 2207 unsolved
Problem TDEAD2098 is UNSAT
Problem TDEAD2149 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/395 variables, and 7 constraints, problems are : Problem set: 12 solved, 2205 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 2/2 constraints]
After SMT, in 78734ms problems are : Problem set: 12 solved, 2205 unsolved
Search for dead transitions found 12 dead transitions in 78770ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/105 places, 2208/2220 transitions.
Applied a total of 0 rules in 257 ms. Remains 105 /105 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-21 19:50:11] [INFO ] Redundant transitions in 125 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81070 ms. Remains : 105/105 places, 2208/2220 transitions.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3182 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.45 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' '!(G(F(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Graph (complete) has 3182 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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 105 transition count 2219
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 101 transition count 2216
Applied a total of 10 rules in 680 ms. Remains 101 /108 variables (removed 7) and now considering 2216/2220 (removed 4) transitions.
[2024-05-21 19:50:12] [INFO ] Flow matrix only has 286 transitions (discarded 1930 similar events)
// Phase 1: matrix 286 rows 101 cols
[2024-05-21 19:50:12] [INFO ] Computed 4 invariants in 23 ms
[2024-05-21 19:50:12] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-21 19:50:12] [INFO ] Flow matrix only has 286 transitions (discarded 1930 similar events)
[2024-05-21 19:50:12] [INFO ] Invariant cache hit.
[2024-05-21 19:50:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:50:13] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1568 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/108 places, 2216/2220 transitions.
Applied a total of 0 rules in 287 ms. Remains 99 /99 variables (removed 0) and now considering 2216/2216 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2536 ms. Remains : 99/108 places, 2216/2220 transitions.
Stuttering acceptance computed with spot in 419 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-00
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 11 ms.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-00 finished in 3074 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' '!(X((p0&&G(F(!p0)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2219
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2219
Applied a total of 4 rules in 31 ms. Remains 105 /108 variables (removed 3) and now considering 2219/2220 (removed 1) transitions.
Running 2216 sub problems to find dead transitions.
[2024-05-21 19:50:14] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-05-21 19:50:14] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 19:50:14] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
[2024-05-21 19:50:41] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2216 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2216/2216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
[2024-05-21 19:51:14] [INFO ] Deduced a trap composed of 55 places in 250 ms of which 2 ms to minimize.
Problem TDEAD1587 is UNSAT
Problem TDEAD1638 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 7 constraints, problems are : Problem set: 2 solved, 2214 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2216 constraints, Known Traps: 2/2 constraints]
After SMT, in 60436ms problems are : Problem set: 2 solved, 2214 unsolved
Search for dead transitions found 2 dead transitions in 60477ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 19:51:15] [INFO ] Flow matrix only has 289 transitions (discarded 1928 similar events)
[2024-05-21 19:51:15] [INFO ] Invariant cache hit.
[2024-05-21 19:51:15] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-21 19:51:15] [INFO ] Flow matrix only has 289 transitions (discarded 1928 similar events)
[2024-05-21 19:51:15] [INFO ] Invariant cache hit.
[2024-05-21 19:51:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:51:16] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1851 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/108 places, 2217/2220 transitions.
Applied a total of 0 rules in 10 ms. Remains 103 /103 variables (removed 0) and now considering 2217/2217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62383 ms. Remains : 103/108 places, 2217/2220 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, true, true, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-02
Product exploration explored 100000 steps with 1487 reset in 795 ms.
Product exploration explored 100000 steps with 1480 reset in 576 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 5 states, 8 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
RANDOM walk for 250 steps (0 resets) in 9 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Stuttering acceptance computed with spot in 93 ms :[p0, p0]
[2024-05-21 19:51:19] [INFO ] Flow matrix only has 289 transitions (discarded 1928 similar events)
// Phase 1: matrix 289 rows 103 cols
[2024-05-21 19:51:19] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 19:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 19:51:20] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-21 19:51:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:51:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 19:51:20] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-21 19:51:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:51:21] [INFO ] [Nat]Added 102 Read/Feed constraints in 1351 ms returned sat
[2024-05-21 19:51:22] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 181 ms.
[2024-05-21 19:51:22] [INFO ] Added : 27 causal constraints over 7 iterations in 489 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2217/2217 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 101 transition count 2216
Applied a total of 3 rules in 317 ms. Remains 101 /103 variables (removed 2) and now considering 2216/2217 (removed 1) transitions.
[2024-05-21 19:51:22] [INFO ] Flow matrix only has 288 transitions (discarded 1928 similar events)
// Phase 1: matrix 288 rows 101 cols
[2024-05-21 19:51:22] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 19:51:23] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-21 19:51:23] [INFO ] Flow matrix only has 288 transitions (discarded 1928 similar events)
[2024-05-21 19:51:23] [INFO ] Invariant cache hit.
[2024-05-21 19:51:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:51:24] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2024-05-21 19:51:24] [INFO ] Redundant transitions in 55 ms returned []
Running 2213 sub problems to find dead transitions.
[2024-05-21 19:51:24] [INFO ] Flow matrix only has 288 transitions (discarded 1928 similar events)
[2024-05-21 19:51:24] [INFO ] Invariant cache hit.
[2024-05-21 19:51:24] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2213 unsolved
[2024-05-21 19:51:49] [INFO ] Deduced a trap composed of 5 places in 444 ms of which 2 ms to minimize.
[2024-05-21 19:51:51] [INFO ] Deduced a trap composed of 54 places in 232 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1870 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/389 variables, and 6 constraints, problems are : Problem set: 25 solved, 2188 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2213/2213 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 25 solved, 2188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 25 solved, 2188 unsolved
Problem TDEAD1921 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2125 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/6 constraints. Problems are: Problem set: 30 solved, 2183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 30 solved, 2183 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 3 (OVERLAPS) 288/389 variables, 101/107 constraints. Problems are: Problem set: 32 solved, 2181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 102/209 constraints. Problems are: Problem set: 32 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 2390 constraints, problems are : Problem set: 32 solved, 2181 unsolved in 35553 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2181/2213 constraints, Known Traps: 2/2 constraints]
After SMT, in 84290ms problems are : Problem set: 32 solved, 2181 unsolved
Search for dead transitions found 32 dead transitions in 84325ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/103 places, 2184/2217 transitions.
Applied a total of 0 rules in 209 ms. Remains 101 /101 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-05-21 19:52:49] [INFO ] Redundant transitions in 34 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 86506 ms. Remains : 101/103 places, 2184/2217 transitions.
Computed a total of 44 stabilizing places and 80 stable transitions
Computed a total of 44 stabilizing places and 80 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, p0]
RANDOM walk for 234 steps (0 resets) in 9 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[p0, p0]
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
[2024-05-21 19:52:49] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
// Phase 1: matrix 284 rows 101 cols
[2024-05-21 19:52:49] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 19:52:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 19:52:50] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-21 19:52:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:52:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 19:52:51] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-21 19:52:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-21 19:52:52] [INFO ] [Nat]Added 100 Read/Feed constraints in 471 ms returned sat
[2024-05-21 19:52:52] [INFO ] Computed and/alt/rep : 88/176/88 causal constraints (skipped 193 transitions) in 289 ms.
[2024-05-21 19:52:53] [INFO ] Added : 38 causal constraints over 8 iterations in 823 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 110 ms :[p0, p0]
Product exploration explored 100000 steps with 1697 reset in 604 ms.
Product exploration explored 100000 steps with 1687 reset in 536 ms.
Built C files in :
/tmp/ltsmin1071630534110985119
[2024-05-21 19:52:54] [INFO ] Too many transitions (2184) to apply POR reductions. Disabling POR matrices.
[2024-05-21 19:52:54] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1071630534110985119
Running compilation step : cd /tmp/ltsmin1071630534110985119;'/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/ltsmin1071630534110985119;'/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/ltsmin1071630534110985119;'/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 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 2184/2184 transitions.
Applied a total of 0 rules in 202 ms. Remains 101 /101 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-05-21 19:52:57] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-05-21 19:52:57] [INFO ] Invariant cache hit.
[2024-05-21 19:52:58] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-21 19:52:58] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-05-21 19:52:58] [INFO ] Invariant cache hit.
[2024-05-21 19:52:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-21 19:52:59] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2126 ms to find 0 implicit places.
[2024-05-21 19:53:00] [INFO ] Redundant transitions in 52 ms returned []
Running 2181 sub problems to find dead transitions.
[2024-05-21 19:53:00] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-05-21 19:53:00] [INFO ] Invariant cache hit.
[2024-05-21 19:53:00] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
[2024-05-21 19:53:28] [INFO ] Deduced a trap composed of 5 places in 633 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/385 variables, and 5 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2181/2181 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 101/385 variables, and 5 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/2181 constraints, Known Traps: 1/1 constraints]
After SMT, in 80991ms problems are : Problem set: 0 solved, 2181 unsolved
Search for dead transitions found 0 dead transitions in 81025ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83420 ms. Remains : 101/101 places, 2184/2184 transitions.
Built C files in :
/tmp/ltsmin14096535136761253250
[2024-05-21 19:54:21] [INFO ] Too many transitions (2184) to apply POR reductions. Disabling POR matrices.
[2024-05-21 19:54:21] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14096535136761253250
Running compilation step : cd /tmp/ltsmin14096535136761253250;'/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/ltsmin14096535136761253250;'/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/ltsmin14096535136761253250;'/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 19:54:24] [INFO ] Flatten gal took : 86 ms
[2024-05-21 19:54:24] [INFO ] Flatten gal took : 89 ms
[2024-05-21 19:54:24] [INFO ] Time to serialize gal into /tmp/LTL15832941650436738845.gal : 27 ms
[2024-05-21 19:54:24] [INFO ] Time to serialize properties into /tmp/LTL7785284716001377124.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/LTL15832941650436738845.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7969230724247935969.hoa' '-atoms' '/tmp/LTL7785284716001377124.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...318
Loading property file /tmp/LTL7785284716001377124.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7969230724247935969.hoa
Detected timeout of ITS tools.
[2024-05-21 19:54:39] [INFO ] Flatten gal took : 181 ms
[2024-05-21 19:54:40] [INFO ] Flatten gal took : 178 ms
[2024-05-21 19:54:40] [INFO ] Time to serialize gal into /tmp/LTL5230933942210393205.gal : 70 ms
[2024-05-21 19:54:40] [INFO ] Time to serialize properties into /tmp/LTL6338569549968943929.ltl : 4 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/LTL5230933942210393205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6338569549968943929.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 : !((X(("((CHOIX_0+CHOIX_1)<=ROUTE_B)")&&(G(F("((CHOIX_0+CHOIX_1)>ROUTE_B)"))))))
Formula 0 simplified : X(!"((CHOIX_0+CHOIX_1)<=ROUTE_B)" | FG!"((CHOIX_0+CHOIX_1)>ROUTE_B)")
Detected timeout of ITS tools.
[2024-05-21 19:54:55] [INFO ] Flatten gal took : 113 ms
[2024-05-21 19:54:55] [INFO ] Applying decomposition
[2024-05-21 19:54:55] [INFO ] Flatten gal took : 84 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/graph8057336377356976925.txt' '-o' '/tmp/graph8057336377356976925.bin' '-w' '/tmp/graph8057336377356976925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8057336377356976925.bin' '-l' '-1' '-v' '-w' '/tmp/graph8057336377356976925.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:54:55] [INFO ] Decomposing Gal with order
[2024-05-21 19:54:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:54:57] [INFO ] Removed a total of 4058 redundant transitions.
[2024-05-21 19:54:57] [INFO ] Flatten gal took : 1448 ms
[2024-05-21 19:54:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 140 ms.
[2024-05-21 19:54:57] [INFO ] Time to serialize gal into /tmp/LTL252172268252350704.gal : 17 ms
[2024-05-21 19:54:57] [INFO ] Time to serialize properties into /tmp/LTL13486627771603155149.ltl : 0 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/LTL252172268252350704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13486627771603155149.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 : !((X(("((gu0.CHOIX_0+gu0.CHOIX_1)<=gu0.ROUTE_B)")&&(G(F("((gu0.CHOIX_0+gu0.CHOIX_1)>gu0.ROUTE_B)"))))))
Formula 0 simplified : X(!"((gu0.CHOIX_0+gu0.CHOIX_1)<=gu0.ROUTE_B)" | FG!"((gu0.CHOIX_0+gu0.CHOIX_1)>gu0.ROUTE_B)")
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-02 finished in 298338 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' '!(X((G(F(p0)) U (p1||G(!p0)))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2220
Applied a total of 2 rules in 19 ms. Remains 106 /108 variables (removed 2) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 19:55:13] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 19:55:13] [INFO ] Computed 5 invariants in 14 ms
[2024-05-21 19:55:13] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 19:55:38] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 59752ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 59791ms
[2024-05-21 19:56:12] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:56:12] [INFO ] Invariant cache hit.
[2024-05-21 19:56:13] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-21 19:56:13] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:56:13] [INFO ] Invariant cache hit.
[2024-05-21 19:56:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:56:14] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1658 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61485 ms. Remains : 104/108 places, 2220/2220 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-03
Stuttering criterion allowed to conclude after 167 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-03 finished in 61704 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' '!(X(!(X(X((((p0 U p1)||p2) U p0))) U p3)))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 19:56:14] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 19:56:14] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 19:56:14] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 19:56:41] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
[2024-05-21 19:57:14] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:57:14] [INFO ] Invariant cache hit.
[2024-05-21 19:57:15] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-21 19:57:15] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:57:15] [INFO ] Invariant cache hit.
[2024-05-21 19:57:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:57:16] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned [24, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2011 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62164 ms. Remains : 106/108 places, 2220/2220 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, p3, p0, (AND p0 p3), p3, (AND p0 p3)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-05
Product exploration explored 100000 steps with 23355 reset in 918 ms.
Product exploration explored 100000 steps with 23499 reset in 685 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3094 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 406 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
RANDOM walk for 1512 steps (8 resets) in 35 ms. (42 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p3) (NOT p0)) (OR (NOT p3) (NOT p2)) (OR (NOT p3) (NOT p1))))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F p1), (F p0), (F p2), (F (NOT (AND (OR p3 (NOT p0)) (OR p3 (NOT p2)) (OR p3 (NOT p1))))), (F p3)]
Knowledge based reduction with 6 factoid took 1073 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 353 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2220/2220 transitions.
Applied a total of 0 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 19:57:21] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 19:57:21] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 19:57:21] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 19:57:49] [INFO ] Deduced a trap composed of 5 places in 599 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 60624ms
[2024-05-21 19:58:22] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:58:22] [INFO ] Invariant cache hit.
[2024-05-21 19:58:22] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-21 19:58:22] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:58:22] [INFO ] Invariant cache hit.
[2024-05-21 19:58:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 19:58:24] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 2596 ms to find 0 implicit places.
Running 2217 sub problems to find dead transitions.
[2024-05-21 19:58:24] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:58:24] [INFO ] Invariant cache hit.
[2024-05-21 19:58:24] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 19:58:56] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 84306ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 84337ms
Finished structural reductions in LTL mode , in 1 iterations and 147587 ms. Remains : 106/106 places, 2220/2220 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3094 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
RANDOM walk for 1749 steps (10 resets) in 59 ms. (29 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (OR (NOT p0) p3) (OR (NOT p2) p3) (OR p3 (NOT p1))))), (F p1), (F (NOT (AND (OR (NOT p0) (NOT p3)) (OR (NOT p2) (NOT p3)) (OR (NOT p3) (NOT p1))))), (F p2), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F p3)]
Knowledge based reduction with 4 factoid took 701 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 410 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 371 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
Product exploration explored 100000 steps with 23442 reset in 997 ms.
Product exploration explored 100000 steps with 23280 reset in 698 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 435 ms :[true, p0, (AND p0 p3), (AND p0 p3), (AND p0 p3), (AND p0 p3)]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2220/2220 transitions.
Applied a total of 0 rules in 665 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 19:59:54] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 19:59:54] [INFO ] Invariant cache hit.
[2024-05-21 19:59:54] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:00:23] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 61723ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 61751ms
[2024-05-21 20:00:56] [INFO ] Redundant transitions in 66 ms returned []
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:00:56] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:00:56] [INFO ] Invariant cache hit.
[2024-05-21 20:00:56] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:01:23] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 3 ms to minimize.
[2024-05-21 20:01:47] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 1 ms to minimize.
Problem TDEAD1588 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 7 constraints, problems are : Problem set: 1 solved, 2216 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2216 unsolved
Problem TDEAD1639 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2149 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 2205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 2205 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 3 (OVERLAPS) 290/394 variables, 104/111 constraints. Problems are: Problem set: 14 solved, 2203 unsolved
SMT process timed out in 81052ms, After SMT, problems are : Problem set: 14 solved, 2203 unsolved
Search for dead transitions found 14 dead transitions in 81099ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 106/106 places, 2206/2220 transitions.
Applied a total of 0 rules in 339 ms. Remains 106 /106 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-21 20:02:18] [INFO ] Redundant transitions in 46 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 144021 ms. Remains : 106/106 places, 2206/2220 transitions.
Built C files in :
/tmp/ltsmin11722797353279289944
[2024-05-21 20:02:18] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11722797353279289944
Running compilation step : cd /tmp/ltsmin11722797353279289944;'/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/ltsmin11722797353279289944;'/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/ltsmin11722797353279289944;'/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 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2220/2220 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:02:21] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:02:21] [INFO ] Invariant cache hit.
[2024-05-21 20:02:21] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:02:48] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 61314ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 61344ms
[2024-05-21 20:03:22] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:03:22] [INFO ] Invariant cache hit.
[2024-05-21 20:03:22] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 20:03:22] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:03:22] [INFO ] Invariant cache hit.
[2024-05-21 20:03:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:03:24] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:03:24] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:03:24] [INFO ] Invariant cache hit.
[2024-05-21 20:03:24] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:04:04] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:04:42] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 1 ms to minimize.
Problem TDEAD1588 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1843 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 7 constraints, problems are : Problem set: 6 solved, 2211 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 2/2 constraints]
After SMT, in 83308ms problems are : Problem set: 6 solved, 2211 unsolved
Search for dead transitions found 6 dead transitions in 83345ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 106/106 places, 2214/2220 transitions.
Applied a total of 0 rules in 22 ms. Remains 106 /106 variables (removed 0) and now considering 2214/2214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146556 ms. Remains : 106/106 places, 2214/2220 transitions.
Built C files in :
/tmp/ltsmin5868342648050746363
[2024-05-21 20:04:47] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5868342648050746363
Running compilation step : cd /tmp/ltsmin5868342648050746363;'/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/ltsmin5868342648050746363;'/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/ltsmin5868342648050746363;'/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 20:04:51] [INFO ] Flatten gal took : 235 ms
[2024-05-21 20:04:51] [INFO ] Flatten gal took : 226 ms
[2024-05-21 20:04:51] [INFO ] Time to serialize gal into /tmp/LTL16798045882593077838.gal : 32 ms
[2024-05-21 20:04:51] [INFO ] Time to serialize properties into /tmp/LTL4460857749991344324.prop : 0 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/LTL16798045882593077838.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7427235015891687494.hoa' '-atoms' '/tmp/LTL4460857749991344324.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...318
Loading property file /tmp/LTL4460857749991344324.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7427235015891687494.hoa
Detected timeout of ITS tools.
[2024-05-21 20:05:06] [INFO ] Flatten gal took : 56 ms
[2024-05-21 20:05:06] [INFO ] Flatten gal took : 55 ms
[2024-05-21 20:05:06] [INFO ] Time to serialize gal into /tmp/LTL8433142941681726395.gal : 17 ms
[2024-05-21 20:05:06] [INFO ] Time to serialize properties into /tmp/LTL7826587138710569550.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/LTL8433142941681726395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7826587138710569550.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 : !((X(!((X(X(((("(SORTI_A>=1)")U("((VIDANGE_0+VIDANGE_1)>=1)"))||("(SUR_PONT_A>=2)"))U("(SORTI_A>=1)"))))U("(SORTI_B>=3)")))))
Formula 0 simplified : X("(SORTI_B>=3)" | X("(SORTI_B>=3)" M X(("(SUR_PONT_A>=2)" | ("(SORTI_A>=1)" U "((VIDANGE_0+VIDANGE_1)>=1)")) U "(SORTI_A>=1)")))
Detected timeout of ITS tools.
[2024-05-21 20:05:21] [INFO ] Flatten gal took : 61 ms
[2024-05-21 20:05:21] [INFO ] Applying decomposition
[2024-05-21 20:05:21] [INFO ] Flatten gal took : 62 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/graph3926892273120784423.txt' '-o' '/tmp/graph3926892273120784423.bin' '-w' '/tmp/graph3926892273120784423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3926892273120784423.bin' '-l' '-1' '-v' '-w' '/tmp/graph3926892273120784423.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:05:22] [INFO ] Decomposing Gal with order
[2024-05-21 20:05:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:05:24] [INFO ] Removed a total of 2071 redundant transitions.
[2024-05-21 20:05:24] [INFO ] Flatten gal took : 2796 ms
[2024-05-21 20:05:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4108 labels/synchronizations in 210 ms.
[2024-05-21 20:05:25] [INFO ] Time to serialize gal into /tmp/LTL7669331127522454791.gal : 11 ms
[2024-05-21 20:05:25] [INFO ] Time to serialize properties into /tmp/LTL8593636957678491111.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/LTL7669331127522454791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8593636957678491111.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 : !((X(!((X(X(((("(gi0.gu0.SORTI_A>=1)")U("((gu2.VIDANGE_0+gu2.VIDANGE_1)>=1)"))||("(gi0.gu0.SUR_PONT_A>=2)"))U("(gi0.gu0.SORTI_A>=1)"))...186
Formula 0 simplified : X("(gi0.gu0.SORTI_B>=3)" | X("(gi0.gu0.SORTI_B>=3)" M X(("(gi0.gu0.SUR_PONT_A>=2)" | ("(gi0.gu0.SORTI_A>=1)" U "((gu2.VIDANGE_0+gu2....200
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-05 finished in 565811 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' '!(X((p0||(p1 U p2))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2220
Applied a total of 2 rules in 10 ms. Remains 106 /108 variables (removed 2) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:05:40] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 20:05:40] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:05:40] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:06:09] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 61600ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 61634ms
[2024-05-21 20:06:42] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:06:42] [INFO ] Invariant cache hit.
[2024-05-21 20:06:42] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-21 20:06:42] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:06:42] [INFO ] Invariant cache hit.
[2024-05-21 20:06:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:06:44] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2436 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64093 ms. Remains : 105/108 places, 2220/2220 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 58 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-07 finished in 64330 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' '!((G((G(p0)||X(p1)))||X(X(F(p1)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 2220
Applied a total of 1 rules in 23 ms. Remains 107 /108 variables (removed 1) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:06:44] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-05-21 20:06:44] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 20:06:44] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:07:15] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 64212ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 64266ms
[2024-05-21 20:07:49] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:07:49] [INFO ] Invariant cache hit.
[2024-05-21 20:07:49] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-21 20:07:49] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:07:49] [INFO ] Invariant cache hit.
[2024-05-21 20:07:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:07:51] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2023 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66327 ms. Remains : 105/108 places, 2220/2220 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-08
Product exploration explored 100000 steps with 1341 reset in 704 ms.
Product exploration explored 100000 steps with 1355 reset in 628 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 3093 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 381 steps (0 resets) in 20 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0))), (F p1)]
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2220/2220 transitions.
Applied a total of 0 rules in 13 ms. Remains 105 /105 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:07:53] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 105 cols
[2024-05-21 20:07:53] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:07:53] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:08:22] [INFO ] Deduced a trap composed of 5 places in 371 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 62416ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 62459ms
[2024-05-21 20:08:56] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:08:56] [INFO ] Invariant cache hit.
[2024-05-21 20:08:56] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-21 20:08:56] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:08:56] [INFO ] Invariant cache hit.
[2024-05-21 20:08:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:08:58] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:08:58] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:08:58] [INFO ] Invariant cache hit.
[2024-05-21 20:08:58] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:09:30] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 84730ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 84778ms
Finished structural reductions in LTL mode , in 1 iterations and 149304 ms. Remains : 105/105 places, 2220/2220 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 3093 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 365 steps (0 resets) in 7 ms. (45 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 297 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1389 reset in 718 ms.
Product exploration explored 100000 steps with 1334 reset in 727 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2220/2220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 2220
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 277 ms. Remains 105 /105 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:10:26] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 105 cols
[2024-05-21 20:10:26] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:10:26] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:10:54] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 61901ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 61932ms
[2024-05-21 20:11:28] [INFO ] Redundant transitions in 79 ms returned []
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:11:28] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:11:28] [INFO ] Invariant cache hit.
[2024-05-21 20:11:28] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:11:57] [INFO ] Deduced a trap composed of 5 places in 416 ms of which 1 ms to minimize.
[2024-05-21 20:12:17] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 1 ms to minimize.
Problem TDEAD1588 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1843 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/395 variables, and 7 constraints, problems are : Problem set: 6 solved, 2211 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 2211 unsolved
Problem TDEAD1894 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2149 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/395 variables, and 7 constraints, problems are : Problem set: 12 solved, 2205 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 2/2 constraints]
After SMT, in 82541ms problems are : Problem set: 12 solved, 2205 unsolved
Search for dead transitions found 12 dead transitions in 82577ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/105 places, 2208/2220 transitions.
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 0 rules in 341 ms. Remains 105 /105 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-21 20:12:51] [INFO ] Redundant transitions in 52 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 145295 ms. Remains : 105/105 places, 2208/2220 transitions.
Built C files in :
/tmp/ltsmin7410716026696628090
[2024-05-21 20:12:51] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7410716026696628090
Running compilation step : cd /tmp/ltsmin7410716026696628090;'/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/ltsmin7410716026696628090;'/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/ltsmin7410716026696628090;'/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 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2220/2220 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:12:54] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 105 cols
[2024-05-21 20:12:54] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:12:54] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:13:25] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 62181ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 62228ms
[2024-05-21 20:13:56] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:13:56] [INFO ] Invariant cache hit.
[2024-05-21 20:13:57] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-21 20:13:57] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:13:57] [INFO ] Invariant cache hit.
[2024-05-21 20:13:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:13:59] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:13:59] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:13:59] [INFO ] Invariant cache hit.
[2024-05-21 20:13:59] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:14:24] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
[2024-05-21 20:14:47] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 1 ms to minimize.
Problem TDEAD1588 is UNSAT
Problem TDEAD1639 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/395 variables, and 7 constraints, problems are : Problem set: 2 solved, 2215 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2215 unsolved
Problem TDEAD1690 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2149 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/395 variables, and 7 constraints, problems are : Problem set: 12 solved, 2205 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 2/2 constraints]
After SMT, in 79314ms problems are : Problem set: 12 solved, 2205 unsolved
Search for dead transitions found 12 dead transitions in 79353ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/105 places, 2208/2220 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143902 ms. Remains : 105/105 places, 2208/2220 transitions.
Built C files in :
/tmp/ltsmin17386546475346211513
[2024-05-21 20:15:18] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17386546475346211513
Running compilation step : cd /tmp/ltsmin17386546475346211513;'/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/ltsmin17386546475346211513;'/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/ltsmin17386546475346211513;'/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 20:15:21] [INFO ] Flatten gal took : 174 ms
[2024-05-21 20:15:22] [INFO ] Flatten gal took : 125 ms
[2024-05-21 20:15:22] [INFO ] Time to serialize gal into /tmp/LTL5388382295961276875.gal : 15 ms
[2024-05-21 20:15:22] [INFO ] Time to serialize properties into /tmp/LTL9815616717747267802.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/LTL5388382295961276875.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7306145275378966263.hoa' '-atoms' '/tmp/LTL9815616717747267802.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...317
Loading property file /tmp/LTL9815616717747267802.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7306145275378966263.hoa
Detected timeout of ITS tools.
[2024-05-21 20:15:37] [INFO ] Flatten gal took : 58 ms
[2024-05-21 20:15:37] [INFO ] Flatten gal took : 64 ms
[2024-05-21 20:15:37] [INFO ] Time to serialize gal into /tmp/LTL14248852496319601800.gal : 31 ms
[2024-05-21 20:15:37] [INFO ] Time to serialize properties into /tmp/LTL13898157638311114503.ltl : 4 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/LTL14248852496319601800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13898157638311114503.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 : !(((G((G("(SORTI_B<=(VIDANGE_0+VIDANGE_1))"))||(X("((VIDANGE_0+VIDANGE_1)>=1)"))))||(X(X(F("((VIDANGE_0+VIDANGE_1)>=1)"))))))
Formula 0 simplified : F(F!"(SORTI_B<=(VIDANGE_0+VIDANGE_1))" & X!"((VIDANGE_0+VIDANGE_1)>=1)") & XXG!"((VIDANGE_0+VIDANGE_1)>=1)"
Detected timeout of ITS tools.
[2024-05-21 20:15:52] [INFO ] Flatten gal took : 105 ms
[2024-05-21 20:15:52] [INFO ] Applying decomposition
[2024-05-21 20:15:52] [INFO ] Flatten gal took : 84 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/graph17648017793882344230.txt' '-o' '/tmp/graph17648017793882344230.bin' '-w' '/tmp/graph17648017793882344230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17648017793882344230.bin' '-l' '-1' '-v' '-w' '/tmp/graph17648017793882344230.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:15:52] [INFO ] Decomposing Gal with order
[2024-05-21 20:15:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:15:55] [INFO ] Removed a total of 2032 redundant transitions.
[2024-05-21 20:15:55] [INFO ] Flatten gal took : 2486 ms
[2024-05-21 20:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2034 labels/synchronizations in 59 ms.
[2024-05-21 20:15:55] [INFO ] Time to serialize gal into /tmp/LTL13117373288676311260.gal : 11 ms
[2024-05-21 20:15:55] [INFO ] Time to serialize properties into /tmp/LTL7359494870149033864.ltl : 0 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/LTL13117373288676311260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7359494870149033864.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...276
Read 1 LTL properties
Checking formula 0 : !(((G((G("(gu1.SORTI_B<=(gu1.VIDANGE_0+gu1.VIDANGE_1))"))||(X("((gu1.VIDANGE_0+gu1.VIDANGE_1)>=1)"))))||(X(X(F("((gu1.VIDANGE_0+gu1.VI...174
Formula 0 simplified : F(F!"(gu1.SORTI_B<=(gu1.VIDANGE_0+gu1.VIDANGE_1))" & X!"((gu1.VIDANGE_0+gu1.VIDANGE_1)>=1)") & XXG!"((gu1.VIDANGE_0+gu1.VIDANGE_1)>=...158
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-08 finished in 565892 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((G(p0)||(p0&&G(F(p1))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 233 ms. Remains 108 /108 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:16:10] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 20:16:10] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 20:16:10] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:16:42] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 62368ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 62398ms
[2024-05-21 20:17:13] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:17:13] [INFO ] Invariant cache hit.
[2024-05-21 20:17:13] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-21 20:17:13] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:17:13] [INFO ] Invariant cache hit.
[2024-05-21 20:17:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:17:16] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned [24, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2768 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 318 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65726 ms. Remains : 106/108 places, 2220/2220 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-10
Product exploration explored 100000 steps with 1771 reset in 1090 ms.
Product exploration explored 100000 steps with 1785 reset in 1265 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3094 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 229 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), false, false]
RANDOM walk for 1233 steps (5 resets) in 42 ms. (28 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 10 factoid took 485 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 407 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), false, false]
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), false, false]
[2024-05-21 20:17:20] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 20:17:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:17:21] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 20:17:21] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-21 20:17:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:17:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 20:17:22] [INFO ] [Nat]Absence check using state equation in 1006 ms returned sat
[2024-05-21 20:17:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:17:22] [INFO ] [Nat]Added 102 Read/Feed constraints in 100 ms returned sat
[2024-05-21 20:17:23] [INFO ] Deduced a trap composed of 5 places in 379 ms of which 1 ms to minimize.
[2024-05-21 20:17:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1768 ms
[2024-05-21 20:17:24] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 130 ms.
[2024-05-21 20:17:25] [INFO ] Added : 26 causal constraints over 6 iterations in 380 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2220/2220 transitions.
Applied a total of 0 rules in 315 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:17:25] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:17:25] [INFO ] Invariant cache hit.
[2024-05-21 20:17:25] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:17:55] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20073 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 63408ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 63451ms
[2024-05-21 20:18:28] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:18:28] [INFO ] Invariant cache hit.
[2024-05-21 20:18:29] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-21 20:18:29] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:18:29] [INFO ] Invariant cache hit.
[2024-05-21 20:18:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:18:30] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-21 20:18:30] [INFO ] Redundant transitions in 71 ms returned []
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:18:30] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:18:30] [INFO ] Invariant cache hit.
[2024-05-21 20:18:30] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:18:55] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 79216ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 79251ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 144448 ms. Remains : 106/106 places, 2220/2220 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3094 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 349 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), false, false]
RANDOM walk for 2227 steps (12 resets) in 33 ms. (65 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 12 factoid took 578 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), false, false]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), false, false]
[2024-05-21 20:19:51] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:19:51] [INFO ] Invariant cache hit.
[2024-05-21 20:19:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 20:19:51] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-21 20:19:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:19:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 20:19:52] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2024-05-21 20:19:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:19:52] [INFO ] [Nat]Added 102 Read/Feed constraints in 83 ms returned sat
[2024-05-21 20:19:53] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 1 ms to minimize.
[2024-05-21 20:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1492 ms
[2024-05-21 20:19:54] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 126 ms.
[2024-05-21 20:19:54] [INFO ] Added : 26 causal constraints over 6 iterations in 429 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), false, false]
Product exploration explored 100000 steps with 1831 reset in 778 ms.
Product exploration explored 100000 steps with 1843 reset in 661 ms.
Built C files in :
/tmp/ltsmin2252231285256026341
[2024-05-21 20:19:56] [INFO ] Too many transitions (2220) to apply POR reductions. Disabling POR matrices.
[2024-05-21 20:19:56] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2252231285256026341
Running compilation step : cd /tmp/ltsmin2252231285256026341;'/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/ltsmin2252231285256026341;'/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/ltsmin2252231285256026341;'/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 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2220/2220 transitions.
Applied a total of 0 rules in 260 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:19:59] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:19:59] [INFO ] Invariant cache hit.
[2024-05-21 20:19:59] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:20:31] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 62307ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 62337ms
[2024-05-21 20:21:02] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:21:02] [INFO ] Invariant cache hit.
[2024-05-21 20:21:02] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-21 20:21:02] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:21:02] [INFO ] Invariant cache hit.
[2024-05-21 20:21:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:21:03] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
[2024-05-21 20:21:03] [INFO ] Redundant transitions in 83 ms returned []
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:21:03] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:21:03] [INFO ] Invariant cache hit.
[2024-05-21 20:21:03] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:21:31] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2024-05-21 20:21:50] [INFO ] Deduced a trap composed of 55 places in 240 ms of which 1 ms to minimize.
Problem TDEAD1588 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1894 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/396 variables, and 7 constraints, problems are : Problem set: 7 solved, 2210 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 7 solved, 2210 unsolved
Problem TDEAD1945 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2149 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/396 variables, and 7 constraints, problems are : Problem set: 12 solved, 2205 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 2/2 constraints]
After SMT, in 81038ms problems are : Problem set: 12 solved, 2205 unsolved
Search for dead transitions found 12 dead transitions in 81074ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 106/106 places, 2208/2220 transitions.
Applied a total of 0 rules in 216 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-21 20:22:25] [INFO ] Redundant transitions in 35 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 145391 ms. Remains : 106/106 places, 2208/2220 transitions.
Built C files in :
/tmp/ltsmin17555923670788734798
[2024-05-21 20:22:25] [INFO ] Too many transitions (2208) to apply POR reductions. Disabling POR matrices.
[2024-05-21 20:22:25] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17555923670788734798
Running compilation step : cd /tmp/ltsmin17555923670788734798;'/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/ltsmin17555923670788734798;'/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/ltsmin17555923670788734798;'/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 20:22:28] [INFO ] Flatten gal took : 101 ms
[2024-05-21 20:22:28] [INFO ] Flatten gal took : 165 ms
[2024-05-21 20:22:28] [INFO ] Time to serialize gal into /tmp/LTL14927684088467653282.gal : 30 ms
[2024-05-21 20:22:28] [INFO ] Time to serialize properties into /tmp/LTL3285067173102533148.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/LTL14927684088467653282.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17052130879478578101.hoa' '-atoms' '/tmp/LTL3285067173102533148.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...319
Loading property file /tmp/LTL3285067173102533148.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17052130879478578101.hoa
Detected timeout of ITS tools.
[2024-05-21 20:22:43] [INFO ] Flatten gal took : 72 ms
[2024-05-21 20:22:43] [INFO ] Flatten gal took : 73 ms
[2024-05-21 20:22:43] [INFO ] Time to serialize gal into /tmp/LTL18259259827537037280.gal : 15 ms
[2024-05-21 20:22:43] [INFO ] Time to serialize properties into /tmp/LTL6297129577042054731.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/LTL18259259827537037280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6297129577042054731.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(SORTI_B>(CONTROLEUR_0+CONTROLEUR_1))"))||(("(SORTI_B>(CONTROLEUR_0+CONTROLEUR_1))")&&(G(F("(SORTI_A>=2)")))))))
Formula 0 simplified : G(F!"(SORTI_B>(CONTROLEUR_0+CONTROLEUR_1))" & (!"(SORTI_B>(CONTROLEUR_0+CONTROLEUR_1))" | FG!"(SORTI_A>=2)"))
Detected timeout of ITS tools.
[2024-05-21 20:22:59] [INFO ] Flatten gal took : 114 ms
[2024-05-21 20:22:59] [INFO ] Applying decomposition
[2024-05-21 20:22:59] [INFO ] Flatten gal took : 70 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/graph6037744025576024722.txt' '-o' '/tmp/graph6037744025576024722.bin' '-w' '/tmp/graph6037744025576024722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6037744025576024722.bin' '-l' '-1' '-v' '-w' '/tmp/graph6037744025576024722.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:22:59] [INFO ] Decomposing Gal with order
[2024-05-21 20:22:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:22:59] [INFO ] Removed a total of 6222 redundant transitions.
[2024-05-21 20:22:59] [INFO ] Flatten gal took : 341 ms
[2024-05-21 20:22:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 456 labels/synchronizations in 44 ms.
[2024-05-21 20:22:59] [INFO ] Time to serialize gal into /tmp/LTL10672181164321650205.gal : 1 ms
[2024-05-21 20:22:59] [INFO ] Time to serialize properties into /tmp/LTL8283011605030934750.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/LTL10672181164321650205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8283011605030934750.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu3.SORTI_B>(gu3.CONTROLEUR_0+gu3.CONTROLEUR_1))"))||(("(gu3.SORTI_B>(gu3.CONTROLEUR_0+gu3.CONTROLEUR_1))")&&(G(F("(gi0.gu0....174
Formula 0 simplified : G(F!"(gu3.SORTI_B>(gu3.CONTROLEUR_0+gu3.CONTROLEUR_1))" & (!"(gu3.SORTI_B>(gu3.CONTROLEUR_0+gu3.CONTROLEUR_1))" | FG!"(gi0.gu0.SORTI...164
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-10 finished in 424281 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||X(p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 2220
Applied a total of 1 rules in 9 ms. Remains 107 /108 variables (removed 1) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:23:15] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-05-21 20:23:15] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 20:23:15] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:23:42] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
[2024-05-21 20:24:15] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:24:15] [INFO ] Invariant cache hit.
[2024-05-21 20:24:15] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-21 20:24:15] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:24:15] [INFO ] Invariant cache hit.
[2024-05-21 20:24:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:24:17] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2395 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62776 ms. Remains : 106/108 places, 2220/2220 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 986 ms.
Product exploration explored 100000 steps with 50000 reset in 735 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3137 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (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 9 factoid took 39 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-11 finished in 64701 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' '!(X(F(!p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2220
Applied a total of 2 rules in 9 ms. Remains 106 /108 variables (removed 2) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:24:19] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 20:24:19] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:24:19] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:24:48] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 62459ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 62490ms
[2024-05-21 20:25:22] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:25:22] [INFO ] Invariant cache hit.
[2024-05-21 20:25:22] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-21 20:25:22] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
[2024-05-21 20:25:22] [INFO ] Invariant cache hit.
[2024-05-21 20:25:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:25:23] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1617 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 2220/2220 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64130 ms. Remains : 104/108 places, 2220/2220 transitions.
Stuttering acceptance computed with spot in 117 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 714 ms.
Product exploration explored 100000 steps with 50000 reset in 711 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/104 stabilizing places and 84/2220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 25 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-V20P10N50-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-13 finished in 65732 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' '!(X(p0))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2219
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2219
Applied a total of 4 rules in 14 ms. Remains 105 /108 variables (removed 3) and now considering 2219/2220 (removed 1) transitions.
Running 2216 sub problems to find dead transitions.
[2024-05-21 20:25:25] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-05-21 20:25:25] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:25:25] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
[2024-05-21 20:25:54] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2216 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2216/2216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2216 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2216 constraints, Known Traps: 1/1 constraints]
After SMT, in 62917ms problems are : Problem set: 0 solved, 2216 unsolved
Search for dead transitions found 0 dead transitions in 62943ms
[2024-05-21 20:26:28] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
[2024-05-21 20:26:28] [INFO ] Invariant cache hit.
[2024-05-21 20:26:28] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-21 20:26:28] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
[2024-05-21 20:26:28] [INFO ] Invariant cache hit.
[2024-05-21 20:26:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:26:29] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1476 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/108 places, 2219/2220 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 2219/2219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64446 ms. Remains : 103/108 places, 2219/2220 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-14 finished in 64625 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(G(p0)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Graph (complete) has 3182 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 192 ms. Remains 106 /108 variables (removed 2) and now considering 2220/2220 (removed 0) transitions.
Running 2217 sub problems to find dead transitions.
[2024-05-21 20:26:30] [INFO ] Flow matrix only has 290 transitions (discarded 1930 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 20:26:30] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:26:30] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:26:56] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-05-21 20:27:29] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 6 ms to minimize.
Problem TDEAD1588 is UNSAT
Problem TDEAD1639 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 2 solved, 2215 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 2/2 constraints]
After SMT, in 60248ms problems are : Problem set: 2 solved, 2215 unsolved
Search for dead transitions found 2 dead transitions in 60279ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 20:27:30] [INFO ] Flow matrix only has 290 transitions (discarded 1928 similar events)
[2024-05-21 20:27:30] [INFO ] Invariant cache hit.
[2024-05-21 20:27:30] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-21 20:27:30] [INFO ] Flow matrix only has 290 transitions (discarded 1928 similar events)
[2024-05-21 20:27:30] [INFO ] Invariant cache hit.
[2024-05-21 20:27:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:27:32] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1646 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 2218/2220 transitions.
Applied a total of 0 rules in 239 ms. Remains 105 /105 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62366 ms. Remains : 105/108 places, 2218/2220 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-15
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V20P10N50-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N50-LTLCardinality-15 finished in 62472 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' '!(X((p0&&G(F(!p0)))))'
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' '!(X(!(X(X((((p0 U p1)||p2) U p0))) U p3)))'
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' '!((G((G(p0)||X(p1)))||X(X(F(p1)))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-08
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 2220/2220 transitions.
Graph (complete) has 3182 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 2219
Applied a total of 3 rules in 59 ms. Remains 106 /108 variables (removed 2) and now considering 2219/2220 (removed 1) transitions.
Running 2216 sub problems to find dead transitions.
[2024-05-21 20:27:33] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 20:27:33] [INFO ] Computed 6 invariants in 8 ms
[2024-05-21 20:27:33] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
[2024-05-21 20:27:59] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2216 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2216/2216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2216 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2216 constraints, Known Traps: 1/1 constraints]
After SMT, in 59096ms problems are : Problem set: 0 solved, 2216 unsolved
Search for dead transitions found 0 dead transitions in 59131ms
[2024-05-21 20:28:32] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
[2024-05-21 20:28:32] [INFO ] Invariant cache hit.
[2024-05-21 20:28:32] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-21 20:28:32] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
[2024-05-21 20:28:32] [INFO ] Invariant cache hit.
[2024-05-21 20:28:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:28:34] [INFO ] Implicit Places using invariants and state equation in 2013 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2413 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 104/108 places, 2219/2220 transitions.
Applied a total of 0 rules in 19 ms. Remains 104 /104 variables (removed 0) and now considering 2219/2219 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 61641 ms. Remains : 104/108 places, 2219/2220 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N50-LTLCardinality-08
Product exploration explored 100000 steps with 1681 reset in 753 ms.
Product exploration explored 100000 steps with 1638 reset in 988 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 3091 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 276 steps (0 resets) in 49 ms. (5 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0))), (F p1)]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 2219/2219 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 2219/2219 (removed 0) transitions.
Running 2216 sub problems to find dead transitions.
[2024-05-21 20:28:37] [INFO ] Flow matrix only has 289 transitions (discarded 1930 similar events)
// Phase 1: matrix 289 rows 104 cols
[2024-05-21 20:28:37] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:28:37] [INFO ] State equation strengthened by 102 read => feed constraints.

BK_STOP 1716323334682

--------------------
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-V20P10N50"
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-V20P10N50, 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-171620398700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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