Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414500172.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 gold2023
Input is BridgeAndVehicles-PT-V80P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414500172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 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 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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-PT-V80P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716635781736

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 11:16:23] [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-25 11:16:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:16:23] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-25 11:16:23] [INFO ] Transformed 188 places.
[2024-05-25 11:16:23] [INFO ] Transformed 2108 transitions.
[2024-05-25 11:16:23] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 67 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 11:16:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-25 11:16:24] [INFO ] Computed 7 invariants in 28 ms
[2024-05-25 11:16:25] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
[2024-05-25 11:16:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:16:25] [INFO ] Invariant cache hit.
[2024-05-25 11:16:25] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-25 11:16:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:16:25] [INFO ] Invariant cache hit.
[2024-05-25 11:16:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:26] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
[2024-05-25 11:16:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:16:26] [INFO ] Invariant cache hit.
[2024-05-25 11:16:27] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3315 ms. Remains : 188/188 places, 2108/2108 transitions.
Support contains 21 out of 188 places after structural reductions.
[2024-05-25 11:16:27] [INFO ] Flatten gal took : 193 ms
[2024-05-25 11:16:28] [INFO ] Flatten gal took : 141 ms
[2024-05-25 11:16:28] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 28) seen :22
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10009 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-25 11:16:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:16:29] [INFO ] Invariant cache hit.
[2024-05-25 11:16:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 11:16:29] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-25 11:16:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 11:16:29] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2024-05-25 11:16:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:29] [INFO ] After 145ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2024-05-25 11:16:30] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 539 ms.
[2024-05-25 11:16:30] [INFO ] After 1280ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 402 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:16:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:16:31] [INFO ] Computed 5 invariants in 7 ms
[2024-05-25 11:16:32] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1256 ms. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10004 steps, including 5 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 283463 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283463 steps, saw 77824 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:16:35] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:35] [INFO ] Invariant cache hit.
[2024-05-25 11:16:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:16:35] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:16:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:16:35] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:16:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:35] [INFO ] After 100ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:16:35] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2024-05-25 11:16:35] [INFO ] After 565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 220 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 233 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:16:36] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:36] [INFO ] Invariant cache hit.
[2024-05-25 11:16:36] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-25 11:16:36] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:36] [INFO ] Invariant cache hit.
[2024-05-25 11:16:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:37] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1540 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 151 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1925 ms. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 331851 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331851 steps, saw 91100 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 11:16:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:16:41] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 11:16:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 11:16:41] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:16:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 11:16:41] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:16:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:41] [INFO ] After 112ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:16:41] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-25 11:16:41] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 152 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 144 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:16:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:42] [INFO ] Invariant cache hit.
[2024-05-25 11:16:42] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-25 11:16:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:42] [INFO ] Invariant cache hit.
[2024-05-25 11:16:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:43] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2024-05-25 11:16:43] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-25 11:16:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:43] [INFO ] Invariant cache hit.
[2024-05-25 11:16:43] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1786 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1744 place count 181 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1746 place count 179 transition count 365
Applied a total of 1746 rules in 26 ms. Remains 179 /183 variables (removed 4) and now considering 365/2107 (removed 1742) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 365 rows 179 cols
[2024-05-25 11:16:43] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 11:16:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:16:43] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 11:16:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:16:44] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 11:16:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 11:16:44] [INFO ] After 63ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 11:16:44] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 128 ms.
[2024-05-25 11:16:44] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.32 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 36 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:16:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:16:44] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 11:16:45] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
[2024-05-25 11:16:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:45] [INFO ] Invariant cache hit.
[2024-05-25 11:16:46] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-25 11:16:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:46] [INFO ] Invariant cache hit.
[2024-05-25 11:16:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:46] [INFO ] Implicit Places using invariants and state equation in 953 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1263 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2093 ms. Remains : 184/188 places, 2107/2108 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s82 s172)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1070 ms.
Product exploration explored 100000 steps with 50000 reset in 1118 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X 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 24 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-PT-V80P20N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-00 finished in 4619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 26 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 11:16:49] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-25 11:16:49] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 11:16:50] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
[2024-05-25 11:16:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:16:50] [INFO ] Invariant cache hit.
[2024-05-25 11:16:50] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-25 11:16:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:16:50] [INFO ] Invariant cache hit.
[2024-05-25 11:16:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:51] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1336 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1946 ms. Remains : 184/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s169), p1:(LEQ s172 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 937 ms.
Product exploration explored 100000 steps with 50000 reset in 873 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT 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 5 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-01 finished in 3929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((X(F(p0))||F(p1)))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 28 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:16:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:16:53] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 11:16:54] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
[2024-05-25 11:16:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:54] [INFO ] Invariant cache hit.
[2024-05-25 11:16:54] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-25 11:16:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:54] [INFO ] Invariant cache hit.
[2024-05-25 11:16:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:16:55] [INFO ] Implicit Places using invariants and state equation in 902 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1955 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s83 s0), p1:(GT 3 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 815 ms.
Product exploration explored 100000 steps with 33333 reset in 1176 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 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 p0)), (X (X (NOT (AND (NOT p0) (NOT 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 5 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-02 finished in 4100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&G((!p0||(p1 U (p2||G(p1)))))) U p3))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 583 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:16:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-05-25 11:16:58] [INFO ] Computed 6 invariants in 9 ms
[2024-05-25 11:16:58] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2024-05-25 11:16:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:58] [INFO ] Invariant cache hit.
[2024-05-25 11:16:59] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-25 11:16:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:16:59] [INFO ] Invariant cache hit.
[2024-05-25 11:16:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:17:00] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1447 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 267 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2935 ms. Remains : 185/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={0} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p0) p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ s0 1), p0:(GT 1 (ADD s170 s171)), p2:(AND (GT s172 s166) (LEQ (ADD s170 s171) s172)), p1:(LEQ (ADD s170 s171) s172)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 24 steps with 7 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-06 finished in 3196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 26 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 11:17:00] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2024-05-25 11:17:00] [INFO ] Computed 6 invariants in 3 ms
[2024-05-25 11:17:01] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2024-05-25 11:17:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:17:01] [INFO ] Invariant cache hit.
[2024-05-25 11:17:01] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-25 11:17:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:17:01] [INFO ] Invariant cache hit.
[2024-05-25 11:17:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:17:02] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned [82, 169]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1299 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 20 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1946 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-07 finished in 2051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 25 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:17:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:17:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 11:17:03] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
[2024-05-25 11:17:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:17:03] [INFO ] Invariant cache hit.
[2024-05-25 11:17:03] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-25 11:17:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:17:03] [INFO ] Invariant cache hit.
[2024-05-25 11:17:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:17:04] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1405 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2113 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s172 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-08 finished in 2202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 183 transition count 2106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 182 transition count 2105
Applied a total of 8 rules in 248 ms. Remains 182 /188 variables (removed 6) and now considering 2105/2108 (removed 3) transitions.
[2024-05-25 11:17:05] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
// Phase 1: matrix 367 rows 182 cols
[2024-05-25 11:17:05] [INFO ] Computed 4 invariants in 3 ms
[2024-05-25 11:17:05] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-25 11:17:05] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-25 11:17:05] [INFO ] Invariant cache hit.
[2024-05-25 11:17:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:17:06] [INFO ] Implicit Places using invariants and state equation in 986 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1285 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/188 places, 2105/2108 transitions.
Applied a total of 0 rules in 171 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1705 ms. Remains : 180/188 places, 2105/2108 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 197 reset in 660 ms.
Product exploration explored 100000 steps with 197 reset in 760 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 149 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 2105/2105 transitions.
Applied a total of 0 rules in 200 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2024-05-25 11:17:08] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
// Phase 1: matrix 367 rows 180 cols
[2024-05-25 11:17:08] [INFO ] Computed 4 invariants in 2 ms
[2024-05-25 11:17:09] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-25 11:17:09] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-25 11:17:09] [INFO ] Invariant cache hit.
[2024-05-25 11:17:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:17:09] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2024-05-25 11:17:10] [INFO ] Redundant transitions in 137 ms returned []
[2024-05-25 11:17:10] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-25 11:17:10] [INFO ] Invariant cache hit.
[2024-05-25 11:17:10] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2336 ms. Remains : 180/180 places, 2105/2105 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 118 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 197 reset in 625 ms.
Product exploration explored 100000 steps with 197 reset in 630 ms.
Built C files in :
/tmp/ltsmin212361053912401007
[2024-05-25 11:17:12] [INFO ] Too many transitions (2105) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:17:12] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin212361053912401007
Running compilation step : cd /tmp/ltsmin212361053912401007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin212361053912401007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin212361053912401007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 2105/2105 transitions.
Applied a total of 0 rules in 169 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2024-05-25 11:17:15] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-25 11:17:15] [INFO ] Invariant cache hit.
[2024-05-25 11:17:16] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-25 11:17:16] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-25 11:17:16] [INFO ] Invariant cache hit.
[2024-05-25 11:17:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:17:16] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2024-05-25 11:17:16] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-25 11:17:16] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-25 11:17:16] [INFO ] Invariant cache hit.
[2024-05-25 11:17:17] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1908 ms. Remains : 180/180 places, 2105/2105 transitions.
Built C files in :
/tmp/ltsmin1962200602285723195
[2024-05-25 11:17:17] [INFO ] Too many transitions (2105) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:17:17] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1962200602285723195
Running compilation step : cd /tmp/ltsmin1962200602285723195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1962200602285723195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1962200602285723195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 11:17:20] [INFO ] Flatten gal took : 113 ms
[2024-05-25 11:17:20] [INFO ] Flatten gal took : 67 ms
[2024-05-25 11:17:20] [INFO ] Time to serialize gal into /tmp/LTL12832598980791325480.gal : 27 ms
[2024-05-25 11:17:20] [INFO ] Time to serialize properties into /tmp/LTL14127307703893308347.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12832598980791325480.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2780592413008114373.hoa' '-atoms' '/tmp/LTL14127307703893308347.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14127307703893308347.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2780592413008114373.hoa
Detected timeout of ITS tools.
[2024-05-25 11:17:36] [INFO ] Flatten gal took : 77 ms
[2024-05-25 11:17:36] [INFO ] Flatten gal took : 76 ms
[2024-05-25 11:17:36] [INFO ] Time to serialize gal into /tmp/LTL5665533221028762424.gal : 17 ms
[2024-05-25 11:17:36] [INFO ] Time to serialize properties into /tmp/LTL13652288444281737670.ltl : 2 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5665533221028762424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13652288444281737670.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(VIDANGE_1<1)"))))
Formula 0 simplified : GF!"(VIDANGE_1<1)"
Detected timeout of ITS tools.
[2024-05-25 11:17:51] [INFO ] Flatten gal took : 97 ms
[2024-05-25 11:17:51] [INFO ] Applying decomposition
[2024-05-25 11:17:51] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12326905915827380779.txt' '-o' '/tmp/graph12326905915827380779.bin' '-w' '/tmp/graph12326905915827380779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12326905915827380779.bin' '-l' '-1' '-v' '-w' '/tmp/graph12326905915827380779.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:17:51] [INFO ] Decomposing Gal with order
[2024-05-25 11:17:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:17:52] [INFO ] Removed a total of 4437 redundant transitions.
[2024-05-25 11:17:52] [INFO ] Flatten gal took : 762 ms
[2024-05-25 11:17:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 514 labels/synchronizations in 43 ms.
[2024-05-25 11:17:52] [INFO ] Time to serialize gal into /tmp/LTL1095060342505069152.gal : 4 ms
[2024-05-25 11:17:52] [INFO ] Time to serialize properties into /tmp/LTL13482930533626511375.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1095060342505069152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13482930533626511375.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u2.VIDANGE_1<1)"))))
Formula 0 simplified : GF!"(i0.u2.VIDANGE_1<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1544334105641702625
[2024-05-25 11:18:07] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1544334105641702625
Running compilation step : cd /tmp/ltsmin1544334105641702625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1544334105641702625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1544334105641702625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-09 finished in 66048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0) U G(p0))||F(p1))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 52 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:18:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:18:11] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 11:18:11] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
[2024-05-25 11:18:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:11] [INFO ] Invariant cache hit.
[2024-05-25 11:18:12] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-25 11:18:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:12] [INFO ] Invariant cache hit.
[2024-05-25 11:18:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:13] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1457 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 19 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2273 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s123 s171), p1:(LEQ 2 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 148 reset in 743 ms.
Product exploration explored 100000 steps with 148 reset in 763 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 234 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 291967 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291967 steps, saw 80497 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:18:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:18:18] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 11:18:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 11:18:19] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:18:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:18:19] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:19] [INFO ] After 399ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:20] [INFO ] After 782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 245 ms.
[2024-05-25 11:18:20] [INFO ] After 1392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 176 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:18:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:20] [INFO ] Invariant cache hit.
[2024-05-25 11:18:21] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 822 ms. Remains : 183/183 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 293216 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293216 steps, saw 80827 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:18:24] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:24] [INFO ] Invariant cache hit.
[2024-05-25 11:18:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:18:25] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:18:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:18:25] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:25] [INFO ] After 518ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:26] [INFO ] After 950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 295 ms.
[2024-05-25 11:18:26] [INFO ] After 1629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 37 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 168 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 183 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:18:27] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:27] [INFO ] Invariant cache hit.
[2024-05-25 11:18:27] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-25 11:18:27] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:27] [INFO ] Invariant cache hit.
[2024-05-25 11:18:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:28] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2024-05-25 11:18:28] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-25 11:18:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:28] [INFO ] Invariant cache hit.
[2024-05-25 11:18:28] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2039 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1743 place count 181 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1744 place count 180 transition count 366
Applied a total of 1744 rules in 14 ms. Remains 180 /183 variables (removed 3) and now considering 366/2107 (removed 1741) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 366 rows 180 cols
[2024-05-25 11:18:28] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 11:18:28] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:18:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 11:18:29] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 11:18:29] [INFO ] After 124ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:29] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-05-25 11:18:29] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 251 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 21 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:18:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:18:30] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 11:18:30] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
[2024-05-25 11:18:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:30] [INFO ] Invariant cache hit.
[2024-05-25 11:18:31] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-25 11:18:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:31] [INFO ] Invariant cache hit.
[2024-05-25 11:18:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:32] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
[2024-05-25 11:18:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:32] [INFO ] Invariant cache hit.
[2024-05-25 11:18:33] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2974 ms. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 253 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 281368 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281368 steps, saw 77429 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:18:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:37] [INFO ] Invariant cache hit.
[2024-05-25 11:18:37] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:18:37] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:18:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 11:18:37] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:38] [INFO ] After 461ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:38] [INFO ] After 867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 331 ms.
[2024-05-25 11:18:38] [INFO ] After 1533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 173 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:18:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:39] [INFO ] Invariant cache hit.
[2024-05-25 11:18:39] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 801 ms. Remains : 183/183 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 264751 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264751 steps, saw 72715 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:18:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:43] [INFO ] Invariant cache hit.
[2024-05-25 11:18:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:18:43] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:18:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:18:43] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:44] [INFO ] After 562ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:44] [INFO ] After 1121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 346 ms.
[2024-05-25 11:18:45] [INFO ] After 1841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 57 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 163 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 154 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:18:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:45] [INFO ] Invariant cache hit.
[2024-05-25 11:18:45] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-25 11:18:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:45] [INFO ] Invariant cache hit.
[2024-05-25 11:18:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:46] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2024-05-25 11:18:46] [INFO ] Redundant transitions in 82 ms returned []
[2024-05-25 11:18:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:46] [INFO ] Invariant cache hit.
[2024-05-25 11:18:47] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2122 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1743 place count 181 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1744 place count 180 transition count 366
Applied a total of 1744 rules in 18 ms. Remains 180 /183 variables (removed 3) and now considering 366/2107 (removed 1741) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 366 rows 180 cols
[2024-05-25 11:18:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 11:18:47] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:18:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 11:18:47] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 11:18:48] [INFO ] After 110ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:18:48] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-25 11:18:48] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 148 reset in 596 ms.
Product exploration explored 100000 steps with 148 reset in 607 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 171 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:18:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:18:50] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 11:18:51] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
[2024-05-25 11:18:51] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-25 11:18:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:51] [INFO ] Invariant cache hit.
[2024-05-25 11:18:51] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1432 ms. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin15231346333064942171
[2024-05-25 11:18:51] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15231346333064942171
Running compilation step : cd /tmp/ltsmin15231346333064942171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15231346333064942171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15231346333064942171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 11 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:18:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:54] [INFO ] Invariant cache hit.
[2024-05-25 11:18:55] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
[2024-05-25 11:18:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:55] [INFO ] Invariant cache hit.
[2024-05-25 11:18:55] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-25 11:18:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:55] [INFO ] Invariant cache hit.
[2024-05-25 11:18:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:18:56] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2024-05-25 11:18:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:18:56] [INFO ] Invariant cache hit.
[2024-05-25 11:18:57] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2220 ms. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin7717093418801678226
[2024-05-25 11:18:57] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7717093418801678226
Running compilation step : cd /tmp/ltsmin7717093418801678226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7717093418801678226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7717093418801678226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 11:19:00] [INFO ] Flatten gal took : 78 ms
[2024-05-25 11:19:00] [INFO ] Flatten gal took : 85 ms
[2024-05-25 11:19:00] [INFO ] Time to serialize gal into /tmp/LTL17464763655379344448.gal : 35 ms
[2024-05-25 11:19:00] [INFO ] Time to serialize properties into /tmp/LTL10697648748408129330.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17464763655379344448.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10179551243851710880.hoa' '-atoms' '/tmp/LTL10697648748408129330.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10697648748408129330.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10179551243851710880.hoa
Detected timeout of ITS tools.
[2024-05-25 11:19:15] [INFO ] Flatten gal took : 82 ms
[2024-05-25 11:19:15] [INFO ] Flatten gal took : 93 ms
[2024-05-25 11:19:15] [INFO ] Time to serialize gal into /tmp/LTL7577588503584456241.gal : 18 ms
[2024-05-25 11:19:15] [INFO ] Time to serialize properties into /tmp/LTL10732092895064209417.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7577588503584456241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10732092895064209417.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((X("(NB_ATTENTE_B_37<=ROUTE_B)"))U(G("(NB_ATTENTE_B_37<=ROUTE_B)")))||(F("(CAPACITE>=2)")))))
Formula 0 simplified : F((X!"(NB_ATTENTE_B_37<=ROUTE_B)" R F!"(NB_ATTENTE_B_37<=ROUTE_B)") & G!"(CAPACITE>=2)")
Detected timeout of ITS tools.
[2024-05-25 11:19:31] [INFO ] Flatten gal took : 113 ms
[2024-05-25 11:19:31] [INFO ] Applying decomposition
[2024-05-25 11:19:31] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16682881454220138009.txt' '-o' '/tmp/graph16682881454220138009.bin' '-w' '/tmp/graph16682881454220138009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16682881454220138009.bin' '-l' '-1' '-v' '-w' '/tmp/graph16682881454220138009.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:19:31] [INFO ] Decomposing Gal with order
[2024-05-25 11:19:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:19:31] [INFO ] Removed a total of 2083 redundant transitions.
[2024-05-25 11:19:31] [INFO ] Flatten gal took : 493 ms
[2024-05-25 11:19:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 420 labels/synchronizations in 30 ms.
[2024-05-25 11:19:32] [INFO ] Time to serialize gal into /tmp/LTL647795166551313426.gal : 18 ms
[2024-05-25 11:19:32] [INFO ] Time to serialize properties into /tmp/LTL17316176106273313732.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL647795166551313426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17316176106273313732.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((X("(gu3.NB_ATTENTE_B_37<=gu3.ROUTE_B)"))U(G("(gu3.NB_ATTENTE_B_37<=gu3.ROUTE_B)")))||(F("(gi0.gu1.CAPACITE>=2)")))))
Formula 0 simplified : F((X!"(gu3.NB_ATTENTE_B_37<=gu3.ROUTE_B)" R F!"(gu3.NB_ATTENTE_B_37<=gu3.ROUTE_B)") & G!"(gi0.gu1.CAPACITE>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin299500323972620201
[2024-05-25 11:19:47] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin299500323972620201
Running compilation step : cd /tmp/ltsmin299500323972620201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin299500323972620201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin299500323972620201;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10 finished in 99343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F((p0||G(p1)))))))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 40 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:19:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:19:50] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 11:19:50] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
[2024-05-25 11:19:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:19:50] [INFO ] Invariant cache hit.
[2024-05-25 11:19:51] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-25 11:19:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:19:51] [INFO ] Invariant cache hit.
[2024-05-25 11:19:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:19:52] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1369 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2013 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s167), p1:(GT 1 s171)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 314 reset in 637 ms.
Product exploration explored 100000 steps with 339 reset in 636 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 7019 steps, including 10 resets, run visited all 5 properties in 71 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-25 11:19:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-05-25 11:19:55] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 11:19:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 11:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:19:56] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2024-05-25 11:19:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:19:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 11:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:19:56] [INFO ] [Nat]Absence check using state equation in 85 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-11 finished in 6791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X(G(p1))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 151 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:19:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:19:57] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 11:19:57] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
[2024-05-25 11:19:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:19:57] [INFO ] Invariant cache hit.
[2024-05-25 11:19:58] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-25 11:19:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:19:58] [INFO ] Invariant cache hit.
[2024-05-25 11:19:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:19:59] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1655 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 133 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2516 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p0, acceptance={1} source=2 dest: 4}, { cond=p0, acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s167), p1:(GT s112 s83)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 674 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-12 finished in 2824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 27 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 11:19:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-25 11:19:59] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 11:20:00] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
[2024-05-25 11:20:00] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:20:00] [INFO ] Invariant cache hit.
[2024-05-25 11:20:00] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-25 11:20:00] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:20:00] [INFO ] Invariant cache hit.
[2024-05-25 11:20:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:02] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1468 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 19 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2223 ms. Remains : 184/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s82 s174)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 896 ms.
Product exploration explored 100000 steps with 50000 reset in 1081 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 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-PT-V80P20N10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-13 finished in 4328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||G(p1))) U p2)))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 13 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 11:20:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2024-05-25 11:20:04] [INFO ] Computed 6 invariants in 6 ms
[2024-05-25 11:20:04] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2024-05-25 11:20:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:20:04] [INFO ] Invariant cache hit.
[2024-05-25 11:20:05] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-25 11:20:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 11:20:05] [INFO ] Invariant cache hit.
[2024-05-25 11:20:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:06] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned [82, 169]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1679 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2302 ms. Remains : 185/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s171 s82), p0:(GT s183 s83), p1:(LEQ s169 s170)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1003 ms.
Product exploration explored 100000 steps with 50000 reset in 833 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 3981 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 12 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-14 finished in 4316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0) U G(p0))||F(p1))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 36 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:20:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:20:08] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 11:20:09] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
[2024-05-25 11:20:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:09] [INFO ] Invariant cache hit.
[2024-05-25 11:20:09] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-25 11:20:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:09] [INFO ] Invariant cache hit.
[2024-05-25 11:20:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:11] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1909 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 27 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2613 ms. Remains : 183/188 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s123 s171), p1:(LEQ 2 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 148 reset in 801 ms.
Product exploration explored 100000 steps with 148 reset in 807 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 213 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 274724 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 274724 steps, saw 75305 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:20:17] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:20:17] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 11:20:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:20:17] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:20:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:20:17] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:18] [INFO ] After 539ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:18] [INFO ] After 1014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 310 ms.
[2024-05-25 11:20:18] [INFO ] After 1644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 162 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:20:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:19] [INFO ] Invariant cache hit.
[2024-05-25 11:20:19] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 183/183 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10004 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 281444 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281444 steps, saw 77480 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:20:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:23] [INFO ] Invariant cache hit.
[2024-05-25 11:20:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:20:23] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:20:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 11:20:23] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:24] [INFO ] After 402ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:24] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 298 ms.
[2024-05-25 11:20:24] [INFO ] After 1395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 156 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 153 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:20:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:25] [INFO ] Invariant cache hit.
[2024-05-25 11:20:25] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-25 11:20:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:25] [INFO ] Invariant cache hit.
[2024-05-25 11:20:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:26] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2024-05-25 11:20:26] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-25 11:20:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:26] [INFO ] Invariant cache hit.
[2024-05-25 11:20:26] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2022 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1743 place count 181 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1744 place count 180 transition count 366
Applied a total of 1744 rules in 13 ms. Remains 180 /183 variables (removed 3) and now considering 366/2107 (removed 1741) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 366 rows 180 cols
[2024-05-25 11:20:26] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 11:20:27] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:20:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:20:27] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 11:20:27] [INFO ] After 114ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:27] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2024-05-25 11:20:27] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 10 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:20:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:20:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 11:20:28] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
[2024-05-25 11:20:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:28] [INFO ] Invariant cache hit.
[2024-05-25 11:20:28] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-25 11:20:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:28] [INFO ] Invariant cache hit.
[2024-05-25 11:20:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:29] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
[2024-05-25 11:20:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:29] [INFO ] Invariant cache hit.
[2024-05-25 11:20:30] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2085 ms. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 150 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 292751 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292751 steps, saw 80689 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:20:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:33] [INFO ] Invariant cache hit.
[2024-05-25 11:20:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:20:34] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:20:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 11:20:34] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:35] [INFO ] After 561ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:35] [INFO ] After 1023ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 364 ms.
[2024-05-25 11:20:35] [INFO ] After 1799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 168 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:20:36] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:36] [INFO ] Invariant cache hit.
[2024-05-25 11:20:36] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 880 ms. Remains : 183/183 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 275511 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275511 steps, saw 75516 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 11:20:40] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:40] [INFO ] Invariant cache hit.
[2024-05-25 11:20:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:20:40] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:20:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:20:40] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:41] [INFO ] After 398ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:41] [INFO ] After 744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 259 ms.
[2024-05-25 11:20:41] [INFO ] After 1286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 163 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 132 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:20:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:42] [INFO ] Invariant cache hit.
[2024-05-25 11:20:42] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-25 11:20:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:42] [INFO ] Invariant cache hit.
[2024-05-25 11:20:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:43] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-25 11:20:43] [INFO ] Redundant transitions in 51 ms returned []
[2024-05-25 11:20:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:43] [INFO ] Invariant cache hit.
[2024-05-25 11:20:43] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1885 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1743 place count 181 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1744 place count 180 transition count 366
Applied a total of 1744 rules in 13 ms. Remains 180 /183 variables (removed 3) and now considering 366/2107 (removed 1741) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 366 rows 180 cols
[2024-05-25 11:20:43] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 11:20:43] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 11:20:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 11:20:44] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 11:20:44] [INFO ] After 116ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 11:20:44] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-05-25 11:20:44] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 188 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 148 reset in 722 ms.
Product exploration explored 100000 steps with 148 reset in 622 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 154 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:20:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:20:46] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 11:20:47] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
[2024-05-25 11:20:47] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-25 11:20:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:47] [INFO ] Invariant cache hit.
[2024-05-25 11:20:47] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1365 ms. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin196349674458137521
[2024-05-25 11:20:48] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin196349674458137521
Running compilation step : cd /tmp/ltsmin196349674458137521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin196349674458137521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin196349674458137521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 14 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:20:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:51] [INFO ] Invariant cache hit.
[2024-05-25 11:20:51] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
[2024-05-25 11:20:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:51] [INFO ] Invariant cache hit.
[2024-05-25 11:20:51] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-25 11:20:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:51] [INFO ] Invariant cache hit.
[2024-05-25 11:20:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:20:52] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
[2024-05-25 11:20:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:20:52] [INFO ] Invariant cache hit.
[2024-05-25 11:20:53] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2238 ms. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin10193734759408711249
[2024-05-25 11:20:53] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10193734759408711249
Running compilation step : cd /tmp/ltsmin10193734759408711249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10193734759408711249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10193734759408711249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 11:20:56] [INFO ] Flatten gal took : 152 ms
[2024-05-25 11:20:56] [INFO ] Flatten gal took : 202 ms
[2024-05-25 11:20:56] [INFO ] Time to serialize gal into /tmp/LTL1941318139882131193.gal : 21 ms
[2024-05-25 11:20:56] [INFO ] Time to serialize properties into /tmp/LTL724407499330761736.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1941318139882131193.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4985789970698583803.hoa' '-atoms' '/tmp/LTL724407499330761736.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL724407499330761736.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4985789970698583803.hoa
Detected timeout of ITS tools.
[2024-05-25 11:21:11] [INFO ] Flatten gal took : 59 ms
[2024-05-25 11:21:12] [INFO ] Flatten gal took : 61 ms
[2024-05-25 11:21:12] [INFO ] Time to serialize gal into /tmp/LTL1625081284838745427.gal : 11 ms
[2024-05-25 11:21:12] [INFO ] Time to serialize properties into /tmp/LTL12940534404038643855.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1625081284838745427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12940534404038643855.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((X("(NB_ATTENTE_B_37<=ROUTE_B)"))U(G("(NB_ATTENTE_B_37<=ROUTE_B)")))||(F("(CAPACITE>=2)")))))
Formula 0 simplified : F((X!"(NB_ATTENTE_B_37<=ROUTE_B)" R F!"(NB_ATTENTE_B_37<=ROUTE_B)") & G!"(CAPACITE>=2)")
Detected timeout of ITS tools.
[2024-05-25 11:21:27] [INFO ] Flatten gal took : 94 ms
[2024-05-25 11:21:27] [INFO ] Applying decomposition
[2024-05-25 11:21:27] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10592805852213222404.txt' '-o' '/tmp/graph10592805852213222404.bin' '-w' '/tmp/graph10592805852213222404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10592805852213222404.bin' '-l' '-1' '-v' '-w' '/tmp/graph10592805852213222404.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:21:27] [INFO ] Decomposing Gal with order
[2024-05-25 11:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:21:28] [INFO ] Removed a total of 2083 redundant transitions.
[2024-05-25 11:21:28] [INFO ] Flatten gal took : 580 ms
[2024-05-25 11:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 420 labels/synchronizations in 12 ms.
[2024-05-25 11:21:28] [INFO ] Time to serialize gal into /tmp/LTL3742052116889836912.gal : 6 ms
[2024-05-25 11:21:28] [INFO ] Time to serialize properties into /tmp/LTL18336817907693616652.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3742052116889836912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18336817907693616652.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((X("(gu3.NB_ATTENTE_B_37<=gu3.ROUTE_B)"))U(G("(gu3.NB_ATTENTE_B_37<=gu3.ROUTE_B)")))||(F("(gi0.gu0.CAPACITE>=2)")))))
Formula 0 simplified : F((X!"(gu3.NB_ATTENTE_B_37<=gu3.ROUTE_B)" R F!"(gu3.NB_ATTENTE_B_37<=gu3.ROUTE_B)") & G!"(gi0.gu0.CAPACITE>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9721438868272838609
[2024-05-25 11:21:43] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9721438868272838609
Running compilation step : cd /tmp/ltsmin9721438868272838609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9721438868272838609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9721438868272838609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLCardinality-10 finished in 97585 ms.
[2024-05-25 11:21:46] [INFO ] Flatten gal took : 100 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16932586205391965479
[2024-05-25 11:21:46] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:21:46] [INFO ] Applying decomposition
[2024-05-25 11:21:46] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16932586205391965479
Running compilation step : cd /tmp/ltsmin16932586205391965479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 11:21:46] [INFO ] Flatten gal took : 144 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8187827831023247792.txt' '-o' '/tmp/graph8187827831023247792.bin' '-w' '/tmp/graph8187827831023247792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8187827831023247792.bin' '-l' '-1' '-v' '-w' '/tmp/graph8187827831023247792.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:21:46] [INFO ] Decomposing Gal with order
[2024-05-25 11:21:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:21:47] [INFO ] Removed a total of 1922 redundant transitions.
[2024-05-25 11:21:47] [INFO ] Flatten gal took : 255 ms
[2024-05-25 11:21:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 433 labels/synchronizations in 11 ms.
[2024-05-25 11:21:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality9301216047077696739.gal : 20 ms
[2024-05-25 11:21:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality11335035434608759528.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9301216047077696739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11335035434608759528.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(G("(gi0.gu0.VIDANGE_1<1)"))))
Formula 0 simplified : GF!"(gi0.gu0.VIDANGE_1<1)"
Compilation finished in 4977 ms.
Running link step : cd /tmp/ltsmin16932586205391965479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin16932586205391965479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 11:43:34] [INFO ] Flatten gal took : 182 ms
[2024-05-25 11:43:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality8851282406929327919.gal : 23 ms
[2024-05-25 11:43:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality16706426712545156289.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8851282406929327919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16706426712545156289.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(G("(VIDANGE_1<1)"))))
Formula 0 simplified : GF!"(VIDANGE_1<1)"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin16932586205391965479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16932586205391965479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((X((LTLAPp1==true)) U []((LTLAPp1==true)))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 12:05:23] [INFO ] Flatten gal took : 121 ms
[2024-05-25 12:05:23] [INFO ] Input system was already deterministic with 2108 transitions.
[2024-05-25 12:05:23] [INFO ] Transformed 188 places.
[2024-05-25 12:05:23] [INFO ] Transformed 2108 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 12:05:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality17364991708793504926.gal : 18 ms
[2024-05-25 12:05:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality11058344420302783255.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17364991708793504926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11058344420302783255.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(VIDANGE_1<1)"))))
Formula 0 simplified : GF!"(VIDANGE_1<1)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: LTL layer: formula: [](((X((LTLAPp1==true)) U []((LTLAPp1==true)))||<>((LTLAPp2==true))))
pins2lts-mc-linux64( 0/ 8), 0.007: "[](((X((LTLAPp1==true)) U []((LTLAPp1==true)))||<>((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.043: buchi has 5 states
pins2lts-mc-linux64( 5/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.222: There are 2112 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.222: State length is 189, there are 2119 groups
pins2lts-mc-linux64( 0/ 8), 0.222: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.222: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.222: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.222: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.389: [Blue] ~120 levels ~960 states ~3256 transitions
pins2lts-mc-linux64( 4/ 8), 0.553: [Blue] ~240 levels ~1920 states ~6528 transitions
pins2lts-mc-linux64( 4/ 8), 0.884: [Blue] ~480 levels ~3840 states ~11064 transitions
pins2lts-mc-linux64( 0/ 8), 1.458: [Blue] ~674 levels ~7680 states ~17736 transitions
pins2lts-mc-linux64( 0/ 8), 2.261: [Blue] ~674 levels ~15360 states ~36264 transitions
pins2lts-mc-linux64( 3/ 8), 4.025: [Blue] ~674 levels ~30720 states ~78688 transitions
pins2lts-mc-linux64( 3/ 8), 6.592: [Blue] ~674 levels ~61440 states ~161976 transitions
pins2lts-mc-linux64( 0/ 8), 11.546: [Blue] ~675 levels ~122880 states ~327760 transitions
pins2lts-mc-linux64( 3/ 8), 21.955: [Blue] ~674 levels ~245760 states ~660584 transitions
pins2lts-mc-linux64( 4/ 8), 45.026: [Blue] ~675 levels ~491520 states ~1412112 transitions
pins2lts-mc-linux64( 2/ 8), 85.766: [Blue] ~675 levels ~983040 states ~3158296 transitions
pins2lts-mc-linux64( 4/ 8), 137.589: [Blue] ~675 levels ~1966080 states ~6557168 transitions
pins2lts-mc-linux64( 4/ 8), 197.444: [Blue] ~675 levels ~3932160 states ~13477032 transitions
pins2lts-mc-linux64( 4/ 8), 316.797: [Blue] ~675 levels ~7864320 states ~27386472 transitions
pins2lts-mc-linux64( 4/ 8), 552.238: [Blue] ~675 levels ~15728640 states ~55571384 transitions
pins2lts-mc-linux64( 2/ 8), 1055.827: [Blue] ~675 levels ~31457280 states ~112179152 transitions
pins2lts-mc-linux64( 7/ 8), 1154.343: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1154.397:
pins2lts-mc-linux64( 0/ 8), 1154.400: Explored 33445152 states 119096010 transitions, fanout: 3.561
pins2lts-mc-linux64( 0/ 8), 1154.400: Total exploration time 1154.140 sec (1154.080 sec minimum, 1154.120 sec on average)
pins2lts-mc-linux64( 0/ 8), 1154.400: States per second: 28978, Transitions per second: 103190
pins2lts-mc-linux64( 0/ 8), 1154.400:
pins2lts-mc-linux64( 0/ 8), 1154.400: State space has 25977034 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1154.400: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1154.400: blue states: 33445152 (128.75%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1154.400: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1154.400: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1154.400:
pins2lts-mc-linux64( 0/ 8), 1154.400: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 1154.400:
pins2lts-mc-linux64( 0/ 8), 1154.400: Queue width: 8B, total height: 5403, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 1154.400: Tree memory: 454.2MB, 18.3 B/state, compr.: 2.4%
pins2lts-mc-linux64( 0/ 8), 1154.400: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1154.400: Stored 2200 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1154.400: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1154.400: Est. total memory use: 454.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16932586205391965479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((X((LTLAPp1==true)) U []((LTLAPp1==true)))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16932586205391965479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((X((LTLAPp1==true)) U []((LTLAPp1==true)))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 11838756 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16031220 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-PT-V80P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is BridgeAndVehicles-PT-V80P20N10, 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 r065-tajo-171620414500172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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