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-171620414700243.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 BugTracking-PT-q8m002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m002-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716644682526

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 13:44:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 13:44:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:44:45] [INFO ] Load time of PNML (sax parser for PT used): 845 ms
[2024-05-25 13:44:45] [INFO ] Transformed 754 places.
[2024-05-25 13:44:45] [INFO ] Transformed 27370 transitions.
[2024-05-25 13:44:45] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 474 places in 148 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m002-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 131 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-25 13:44:46] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-25 13:44:46] [INFO ] Computed 8 invariants in 70 ms
[2024-05-25 13:44:47] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-25 13:44:47] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:44:47] [INFO ] Invariant cache hit.
[2024-05-25 13:44:47] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 13:44:49] [INFO ] Implicit Places using invariants and state equation in 2473 ms returned []
Implicit Place search using SMT with State Equation took 3132 ms to find 0 implicit places.
[2024-05-25 13:44:49] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:44:49] [INFO ] Invariant cache hit.
[2024-05-25 13:44:50] [INFO ] Dead Transitions using invariants and state equation in 1242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4508 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 17 out of 277 places after structural reductions.
[2024-05-25 13:44:51] [INFO ] Flatten gal took : 333 ms
[2024-05-25 13:44:51] [INFO ] Flatten gal took : 217 ms
[2024-05-25 13:44:52] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 220 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 60580 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60580 steps, saw 35026 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-25 13:44:56] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:44:56] [INFO ] Invariant cache hit.
[2024-05-25 13:44:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:44:57] [INFO ] After 1373ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-25 13:44:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:44:59] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-25 13:44:59] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 13:45:00] [INFO ] After 1682ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2024-05-25 13:45:01] [INFO ] Deduced a trap composed of 12 places in 601 ms of which 6 ms to minimize.
[2024-05-25 13:45:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 701 ms
[2024-05-25 13:45:02] [INFO ] Deduced a trap composed of 68 places in 351 ms of which 2 ms to minimize.
[2024-05-25 13:45:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 565 ms
[2024-05-25 13:45:02] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2024-05-25 13:45:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2024-05-25 13:45:03] [INFO ] Deduced a trap composed of 19 places in 468 ms of which 2 ms to minimize.
[2024-05-25 13:45:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 665 ms
[2024-05-25 13:45:03] [INFO ] After 4629ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 593 ms.
[2024-05-25 13:45:04] [INFO ] After 6859ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 12 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 361 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 217 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 93956 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93956 steps, saw 62245 distinct states, run finished after 3005 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:45:08] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-25 13:45:08] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 13:45:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:45:10] [INFO ] After 1180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-25 13:45:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:45:10] [INFO ] After 187ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:45:10] [INFO ] After 1533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:45:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:45:11] [INFO ] After 1192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:45:12] [INFO ] After 925ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:45:13] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 1 ms to minimize.
[2024-05-25 13:45:13] [INFO ] Deduced a trap composed of 71 places in 319 ms of which 1 ms to minimize.
[2024-05-25 13:45:13] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2024-05-25 13:45:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1348 ms
[2024-05-25 13:45:14] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2024-05-25 13:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2024-05-25 13:45:14] [INFO ] After 3047ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 383 ms.
[2024-05-25 13:45:15] [INFO ] After 4749ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 9 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 78 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 270/270 places, 3872/3872 transitions.
Incomplete random walk after 10000 steps, including 274 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 95469 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95469 steps, saw 63313 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 13:45:18] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:45:18] [INFO ] Invariant cache hit.
[2024-05-25 13:45:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:45:19] [INFO ] After 892ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-25 13:45:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:45:20] [INFO ] After 520ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:45:20] [INFO ] After 1512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:45:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:45:21] [INFO ] After 1000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 13:45:21] [INFO ] After 751ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 13:45:22] [INFO ] Deduced a trap composed of 44 places in 362 ms of which 1 ms to minimize.
[2024-05-25 13:45:22] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 1 ms to minimize.
[2024-05-25 13:45:23] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 13 ms to minimize.
[2024-05-25 13:45:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1467 ms
[2024-05-25 13:45:23] [INFO ] After 2757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 454 ms.
[2024-05-25 13:45:24] [INFO ] After 4324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 90 ms.
Support contains 9 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 74 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 87 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-25 13:45:24] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:45:24] [INFO ] Invariant cache hit.
[2024-05-25 13:45:25] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-25 13:45:25] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:45:25] [INFO ] Invariant cache hit.
[2024-05-25 13:45:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:45:27] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 2760 ms to find 0 implicit places.
[2024-05-25 13:45:27] [INFO ] Redundant transitions in 334 ms returned []
[2024-05-25 13:45:27] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:45:27] [INFO ] Invariant cache hit.
[2024-05-25 13:45:29] [INFO ] Dead Transitions using invariants and state equation in 1339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4537 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 263 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 3692 rows 264 cols
[2024-05-25 13:45:29] [INFO ] Computed 9 invariants in 36 ms
[2024-05-25 13:45:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:45:30] [INFO ] After 986ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-25 13:45:30] [INFO ] After 1328ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:45:30] [INFO ] After 1408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:45:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-25 13:45:32] [INFO ] After 997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 13:45:32] [INFO ] After 1364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 214 ms.
[2024-05-25 13:45:32] [INFO ] After 1718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q8m002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 stable transitions
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 U p1) U X(X(G(!p0))))))'
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 18 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:45:32] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-25 13:45:32] [INFO ] Computed 8 invariants in 40 ms
[2024-05-25 13:45:33] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-25 13:45:33] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:45:33] [INFO ] Invariant cache hit.
[2024-05-25 13:45:33] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 13:45:35] [INFO ] Implicit Places using invariants and state equation in 2541 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
[2024-05-25 13:45:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:45:35] [INFO ] Invariant cache hit.
[2024-05-25 13:45:36] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4183 ms. Remains : 277/277 places, 3871/3871 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 517 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Running random walk in product with property : BugTracking-PT-q8m002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s40 1) (GEQ s190 1)), p0:(AND (GEQ s5 1) (GEQ s62 1) (GEQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22248 reset in 1167 ms.
Product exploration explored 100000 steps with 22208 reset in 955 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 148 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 85468 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85468 steps, saw 49336 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:45:43] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:45:43] [INFO ] Invariant cache hit.
[2024-05-25 13:45:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:45:44] [INFO ] After 735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:45:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:45:45] [INFO ] After 1008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:45:45] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 13:45:46] [INFO ] After 1327ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:45:47] [INFO ] Deduced a trap composed of 30 places in 412 ms of which 3 ms to minimize.
[2024-05-25 13:45:48] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 0 ms to minimize.
[2024-05-25 13:45:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1248 ms
[2024-05-25 13:45:48] [INFO ] Deduced a trap composed of 67 places in 349 ms of which 2 ms to minimize.
[2024-05-25 13:45:49] [INFO ] Deduced a trap composed of 34 places in 359 ms of which 1 ms to minimize.
[2024-05-25 13:45:49] [INFO ] Deduced a trap composed of 69 places in 341 ms of which 0 ms to minimize.
[2024-05-25 13:45:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1560 ms
[2024-05-25 13:45:50] [INFO ] Deduced a trap composed of 26 places in 496 ms of which 1 ms to minimize.
[2024-05-25 13:45:51] [INFO ] Deduced a trap composed of 77 places in 479 ms of which 1 ms to minimize.
[2024-05-25 13:45:51] [INFO ] Deduced a trap composed of 52 places in 454 ms of which 1 ms to minimize.
[2024-05-25 13:45:52] [INFO ] Deduced a trap composed of 11 places in 443 ms of which 1 ms to minimize.
[2024-05-25 13:45:52] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 1 ms to minimize.
[2024-05-25 13:45:53] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 1 ms to minimize.
[2024-05-25 13:45:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3131 ms
[2024-05-25 13:45:53] [INFO ] Deduced a trap composed of 73 places in 356 ms of which 1 ms to minimize.
[2024-05-25 13:45:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 584 ms
[2024-05-25 13:45:54] [INFO ] After 8628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 865 ms.
[2024-05-25 13:45:55] [INFO ] After 10599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 125 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 163 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10001 steps, including 234 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 149 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 264 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 91899 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91899 steps, saw 60793 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:45:58] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-25 13:45:59] [INFO ] Computed 8 invariants in 13 ms
[2024-05-25 13:45:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:45:59] [INFO ] After 796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:45:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:46:01] [INFO ] After 1189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:46:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:46:02] [INFO ] After 1317ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:46:03] [INFO ] Deduced a trap composed of 10 places in 477 ms of which 0 ms to minimize.
[2024-05-25 13:46:04] [INFO ] Deduced a trap composed of 83 places in 458 ms of which 1 ms to minimize.
[2024-05-25 13:46:04] [INFO ] Deduced a trap composed of 65 places in 455 ms of which 1 ms to minimize.
[2024-05-25 13:46:05] [INFO ] Deduced a trap composed of 90 places in 521 ms of which 1 ms to minimize.
[2024-05-25 13:46:05] [INFO ] Deduced a trap composed of 63 places in 359 ms of which 0 ms to minimize.
[2024-05-25 13:46:06] [INFO ] Deduced a trap composed of 63 places in 449 ms of which 1 ms to minimize.
[2024-05-25 13:46:06] [INFO ] Deduced a trap composed of 56 places in 444 ms of which 10 ms to minimize.
[2024-05-25 13:46:07] [INFO ] Deduced a trap composed of 66 places in 444 ms of which 1 ms to minimize.
[2024-05-25 13:46:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4684 ms
[2024-05-25 13:46:08] [INFO ] Deduced a trap composed of 16 places in 556 ms of which 1 ms to minimize.
[2024-05-25 13:46:09] [INFO ] Deduced a trap composed of 17 places in 454 ms of which 0 ms to minimize.
[2024-05-25 13:46:09] [INFO ] Deduced a trap composed of 23 places in 515 ms of which 1 ms to minimize.
[2024-05-25 13:46:10] [INFO ] Deduced a trap composed of 73 places in 385 ms of which 1 ms to minimize.
[2024-05-25 13:46:10] [INFO ] Deduced a trap composed of 34 places in 385 ms of which 1 ms to minimize.
[2024-05-25 13:46:11] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 1 ms to minimize.
[2024-05-25 13:46:11] [INFO ] Deduced a trap composed of 31 places in 385 ms of which 0 ms to minimize.
[2024-05-25 13:46:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3859 ms
[2024-05-25 13:46:11] [INFO ] After 10750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 732 ms.
[2024-05-25 13:46:12] [INFO ] After 12771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 167 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 59 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 51 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-25 13:46:12] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:46:12] [INFO ] Invariant cache hit.
[2024-05-25 13:46:13] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-25 13:46:13] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:46:13] [INFO ] Invariant cache hit.
[2024-05-25 13:46:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:46:15] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2385 ms to find 0 implicit places.
[2024-05-25 13:46:15] [INFO ] Redundant transitions in 112 ms returned []
[2024-05-25 13:46:15] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:46:15] [INFO ] Invariant cache hit.
[2024-05-25 13:46:16] [INFO ] Dead Transitions using invariants and state equation in 1179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3739 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 205 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2024-05-25 13:46:16] [INFO ] Computed 9 invariants in 13 ms
[2024-05-25 13:46:16] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:46:17] [INFO ] After 609ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-25 13:46:17] [INFO ] After 718ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:46:17] [INFO ] After 790ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:46:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 13:46:18] [INFO ] After 961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:46:19] [INFO ] After 1467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 379 ms.
[2024-05-25 13:46:19] [INFO ] After 1965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 100 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 255 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 14 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:46:20] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-25 13:46:20] [INFO ] Computed 8 invariants in 21 ms
[2024-05-25 13:46:20] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-25 13:46:20] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:46:20] [INFO ] Invariant cache hit.
[2024-05-25 13:46:21] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 13:46:22] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2564 ms to find 0 implicit places.
[2024-05-25 13:46:22] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:46:22] [INFO ] Invariant cache hit.
[2024-05-25 13:46:23] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3707 ms. Remains : 277/277 places, 3871/3871 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 111 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 212 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 155 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 82060 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82060 steps, saw 47377 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:46:28] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:46:28] [INFO ] Invariant cache hit.
[2024-05-25 13:46:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:46:28] [INFO ] After 779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:46:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:46:29] [INFO ] After 961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:46:29] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 13:46:31] [INFO ] After 1143ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:46:31] [INFO ] Deduced a trap composed of 30 places in 429 ms of which 1 ms to minimize.
[2024-05-25 13:46:32] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 1 ms to minimize.
[2024-05-25 13:46:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1170 ms
[2024-05-25 13:46:32] [INFO ] Deduced a trap composed of 67 places in 294 ms of which 0 ms to minimize.
[2024-05-25 13:46:33] [INFO ] Deduced a trap composed of 34 places in 370 ms of which 1 ms to minimize.
[2024-05-25 13:46:33] [INFO ] Deduced a trap composed of 69 places in 360 ms of which 0 ms to minimize.
[2024-05-25 13:46:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1394 ms
[2024-05-25 13:46:34] [INFO ] Deduced a trap composed of 26 places in 550 ms of which 3 ms to minimize.
[2024-05-25 13:46:35] [INFO ] Deduced a trap composed of 77 places in 527 ms of which 0 ms to minimize.
[2024-05-25 13:46:35] [INFO ] Deduced a trap composed of 52 places in 515 ms of which 1 ms to minimize.
[2024-05-25 13:46:36] [INFO ] Deduced a trap composed of 11 places in 507 ms of which 1 ms to minimize.
[2024-05-25 13:46:36] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2024-05-25 13:46:37] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 0 ms to minimize.
[2024-05-25 13:46:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3220 ms
[2024-05-25 13:46:37] [INFO ] Deduced a trap composed of 73 places in 273 ms of which 11 ms to minimize.
[2024-05-25 13:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2024-05-25 13:46:37] [INFO ] After 7947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 661 ms.
[2024-05-25 13:46:38] [INFO ] After 9651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 139 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 139 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10001 steps, including 272 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 246 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 96858 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96858 steps, saw 64293 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:46:42] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-25 13:46:42] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 13:46:42] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:46:43] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:46:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:46:44] [INFO ] After 1030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:46:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:46:45] [INFO ] After 1360ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:46:46] [INFO ] Deduced a trap composed of 10 places in 406 ms of which 1 ms to minimize.
[2024-05-25 13:46:47] [INFO ] Deduced a trap composed of 83 places in 477 ms of which 1 ms to minimize.
[2024-05-25 13:46:47] [INFO ] Deduced a trap composed of 65 places in 455 ms of which 0 ms to minimize.
[2024-05-25 13:46:48] [INFO ] Deduced a trap composed of 90 places in 454 ms of which 0 ms to minimize.
[2024-05-25 13:46:48] [INFO ] Deduced a trap composed of 63 places in 446 ms of which 1 ms to minimize.
[2024-05-25 13:46:49] [INFO ] Deduced a trap composed of 63 places in 470 ms of which 2 ms to minimize.
[2024-05-25 13:46:50] [INFO ] Deduced a trap composed of 56 places in 447 ms of which 1 ms to minimize.
[2024-05-25 13:46:50] [INFO ] Deduced a trap composed of 66 places in 374 ms of which 1 ms to minimize.
[2024-05-25 13:46:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4721 ms
[2024-05-25 13:46:51] [INFO ] Deduced a trap composed of 16 places in 568 ms of which 5 ms to minimize.
[2024-05-25 13:46:52] [INFO ] Deduced a trap composed of 17 places in 468 ms of which 4 ms to minimize.
[2024-05-25 13:46:52] [INFO ] Deduced a trap composed of 23 places in 470 ms of which 0 ms to minimize.
[2024-05-25 13:46:53] [INFO ] Deduced a trap composed of 73 places in 490 ms of which 0 ms to minimize.
[2024-05-25 13:46:54] [INFO ] Deduced a trap composed of 34 places in 451 ms of which 0 ms to minimize.
[2024-05-25 13:46:54] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 0 ms to minimize.
[2024-05-25 13:46:55] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 1 ms to minimize.
[2024-05-25 13:46:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4025 ms
[2024-05-25 13:46:55] [INFO ] After 10956ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 799 ms.
[2024-05-25 13:46:55] [INFO ] After 12883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 258 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 63 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 76 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-25 13:46:56] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:46:56] [INFO ] Invariant cache hit.
[2024-05-25 13:46:56] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-25 13:46:56] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:46:56] [INFO ] Invariant cache hit.
[2024-05-25 13:46:57] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:46:58] [INFO ] Implicit Places using invariants and state equation in 2077 ms returned []
Implicit Place search using SMT with State Equation took 2536 ms to find 0 implicit places.
[2024-05-25 13:46:59] [INFO ] Redundant transitions in 219 ms returned []
[2024-05-25 13:46:59] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:46:59] [INFO ] Invariant cache hit.
[2024-05-25 13:47:00] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4026 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 209 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2024-05-25 13:47:00] [INFO ] Computed 9 invariants in 40 ms
[2024-05-25 13:47:00] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:47:01] [INFO ] After 799ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-25 13:47:01] [INFO ] After 956ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:47:01] [INFO ] After 1046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:47:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:47:02] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:47:03] [INFO ] After 1875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 604 ms.
[2024-05-25 13:47:04] [INFO ] After 2562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 190 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 293 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 325 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22285 reset in 996 ms.
Product exploration explored 100000 steps with 22191 reset in 879 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 295 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 16 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 3881
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 224 ms. Remains 277 /277 variables (removed 0) and now considering 3881/3871 (removed -10) transitions.
[2024-05-25 13:47:08] [INFO ] Redundant transitions in 110 ms returned []
[2024-05-25 13:47:08] [INFO ] Flow matrix only has 3709 transitions (discarded 172 similar events)
// Phase 1: matrix 3709 rows 277 cols
[2024-05-25 13:47:08] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 13:47:09] [INFO ] Dead Transitions using invariants and state equation in 1379 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/277 places, 3881/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1746 ms. Remains : 277/277 places, 3881/3871 transitions.
Built C files in :
/tmp/ltsmin3280212419532651044
[2024-05-25 13:47:09] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3280212419532651044
Running compilation step : cd /tmp/ltsmin3280212419532651044;'/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/ltsmin3280212419532651044;'/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/ltsmin3280212419532651044;'/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 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 47 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:47:12] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-25 13:47:12] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 13:47:13] [INFO ] Implicit Places using invariants in 791 ms returned []
[2024-05-25 13:47:13] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:47:13] [INFO ] Invariant cache hit.
[2024-05-25 13:47:14] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 13:47:16] [INFO ] Implicit Places using invariants and state equation in 2653 ms returned []
Implicit Place search using SMT with State Equation took 3449 ms to find 0 implicit places.
[2024-05-25 13:47:16] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:47:16] [INFO ] Invariant cache hit.
[2024-05-25 13:47:17] [INFO ] Dead Transitions using invariants and state equation in 1348 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4849 ms. Remains : 277/277 places, 3871/3871 transitions.
Built C files in :
/tmp/ltsmin11270612733213516614
[2024-05-25 13:47:17] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11270612733213516614
Running compilation step : cd /tmp/ltsmin11270612733213516614;'/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/ltsmin11270612733213516614;'/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/ltsmin11270612733213516614;'/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 13:47:21] [INFO ] Flatten gal took : 183 ms
[2024-05-25 13:47:21] [INFO ] Flatten gal took : 174 ms
[2024-05-25 13:47:21] [INFO ] Time to serialize gal into /tmp/LTL12348394107151980902.gal : 70 ms
[2024-05-25 13:47:21] [INFO ] Time to serialize properties into /tmp/LTL17923221042199892145.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/LTL12348394107151980902.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3038317455919896683.hoa' '-atoms' '/tmp/LTL17923221042199892145.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/LTL17923221042199892145.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3038317455919896683.hoa
Detected timeout of ITS tools.
[2024-05-25 13:47:36] [INFO ] Flatten gal took : 201 ms
[2024-05-25 13:47:37] [INFO ] Flatten gal took : 144 ms
[2024-05-25 13:47:37] [INFO ] Time to serialize gal into /tmp/LTL16845017068293068275.gal : 27 ms
[2024-05-25 13:47:37] [INFO ] Time to serialize properties into /tmp/LTL17981117618032268412.ltl : 3 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/LTL16845017068293068275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17981117618032268412.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...277
Read 1 LTL properties
Checking formula 0 : !((X(((!("(((l5>=1)&&(x1_MORE_INFO_q0>=1))&&(ch0_MORE_INFO_q1>=1))"))U("(((l2>=1)&&(x0_FIXED_q7>=1))&&(ch1_MUST_FIX_q7>=1))"))U(X(X(G(...223
Formula 0 simplified : X(("(((l5>=1)&&(x1_MORE_INFO_q0>=1))&&(ch0_MORE_INFO_q1>=1))" R !"(((l2>=1)&&(x0_FIXED_q7>=1))&&(ch1_MUST_FIX_q7>=1))") R XXF"(((l5>...207
Detected timeout of ITS tools.
[2024-05-25 13:47:52] [INFO ] Flatten gal took : 184 ms
[2024-05-25 13:47:52] [INFO ] Applying decomposition
[2024-05-25 13:47:52] [INFO ] Flatten gal took : 197 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/graph3554083954427273358.txt' '-o' '/tmp/graph3554083954427273358.bin' '-w' '/tmp/graph3554083954427273358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3554083954427273358.bin' '-l' '-1' '-v' '-w' '/tmp/graph3554083954427273358.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:47:53] [INFO ] Decomposing Gal with order
[2024-05-25 13:47:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:47:53] [INFO ] Removed a total of 406 redundant transitions.
[2024-05-25 13:47:53] [INFO ] Flatten gal took : 467 ms
[2024-05-25 13:47:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 377 labels/synchronizations in 51 ms.
[2024-05-25 13:47:53] [INFO ] Time to serialize gal into /tmp/LTL5015339930804411695.gal : 49 ms
[2024-05-25 13:47:53] [INFO ] Time to serialize properties into /tmp/LTL14439193056568352123.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/LTL5015339930804411695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14439193056568352123.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 : !((X(((!("(((u1.l5>=1)&&(u1.x1_MORE_INFO_q0>=1))&&(u1.ch0_MORE_INFO_q1>=1))"))U("(((u0.l2>=1)&&(u0.x0_FIXED_q7>=1))&&(u0.ch1_MUST_FIX_...250
Formula 0 simplified : X(("(((u1.l5>=1)&&(u1.x1_MORE_INFO_q0>=1))&&(u1.ch0_MORE_INFO_q1>=1))" R !"(((u0.l2>=1)&&(u0.x0_FIXED_q7>=1))&&(u0.ch1_MUST_FIX_q7>=...234
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13254239786339541447
[2024-05-25 13:48:08] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13254239786339541447
Running compilation step : cd /tmp/ltsmin13254239786339541447;'/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/ltsmin13254239786339541447;'/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/ltsmin13254239786339541447;'/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 BugTracking-PT-q8m002-LTLFireability-10 finished in 159223 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 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 41 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:48:12] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:48:12] [INFO ] Invariant cache hit.
[2024-05-25 13:48:12] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-25 13:48:12] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:48:12] [INFO ] Invariant cache hit.
[2024-05-25 13:48:13] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 13:48:15] [INFO ] Implicit Places using invariants and state equation in 2451 ms returned []
Implicit Place search using SMT with State Equation took 3238 ms to find 0 implicit places.
[2024-05-25 13:48:15] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 13:48:15] [INFO ] Invariant cache hit.
[2024-05-25 13:48:16] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4309 ms. Remains : 277/277 places, 3871/3871 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BugTracking-PT-q8m002-LTLFireability-14 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:(OR (LT s24 1) (LT s154 1) (LT s269 1))], 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]]
Product exploration explored 100000 steps with 50000 reset in 949 ms.
Product exploration explored 100000 steps with 50000 reset in 901 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BugTracking-PT-q8m002-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q8m002-LTLFireability-14 finished in 6315 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 U p1) U X(X(G(!p0))))))'
Found a Lengthening insensitive property : BugTracking-PT-q8m002-LTLFireability-10
Stuttering acceptance computed with spot in 242 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Applied a total of 4 rules in 55 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2024-05-25 13:48:18] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2024-05-25 13:48:18] [INFO ] Computed 8 invariants in 12 ms
[2024-05-25 13:48:19] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-25 13:48:19] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:48:19] [INFO ] Invariant cache hit.
[2024-05-25 13:48:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:48:21] [INFO ] Implicit Places using invariants and state equation in 2554 ms returned []
Implicit Place search using SMT with State Equation took 2938 ms to find 0 implicit places.
[2024-05-25 13:48:21] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:48:21] [INFO ] Invariant cache hit.
[2024-05-25 13:48:22] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4217 ms. Remains : 275/277 places, 3877/3871 transitions.
Running random walk in product with property : BugTracking-PT-q8m002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s38 1) (GEQ s188 1)), p0:(AND (GEQ s5 1) (GEQ s60 1) (GEQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22193 reset in 735 ms.
Product exploration explored 100000 steps with 22216 reset in 783 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 139 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 199 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 169 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 60552 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60552 steps, saw 35010 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:48:28] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:48:28] [INFO ] Invariant cache hit.
[2024-05-25 13:48:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:48:29] [INFO ] After 793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:48:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:48:30] [INFO ] After 1171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:48:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:48:32] [INFO ] After 1439ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:48:33] [INFO ] Deduced a trap composed of 14 places in 562 ms of which 1 ms to minimize.
[2024-05-25 13:48:33] [INFO ] Deduced a trap composed of 48 places in 519 ms of which 1 ms to minimize.
[2024-05-25 13:48:34] [INFO ] Deduced a trap composed of 57 places in 645 ms of which 1 ms to minimize.
[2024-05-25 13:48:35] [INFO ] Deduced a trap composed of 10 places in 566 ms of which 0 ms to minimize.
[2024-05-25 13:48:35] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 2 ms to minimize.
[2024-05-25 13:48:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3320 ms
[2024-05-25 13:48:36] [INFO ] After 5781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 595 ms.
[2024-05-25 13:48:37] [INFO ] After 7651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 174 ms.
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 3872
Applied a total of 10 rules in 155 ms. Remains 270 /275 variables (removed 5) and now considering 3872/3877 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 270/275 places, 3872/3877 transitions.
Incomplete random walk after 10000 steps, including 254 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 140 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 245 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 86969 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86969 steps, saw 57313 distinct states, run finished after 3006 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:48:41] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-25 13:48:41] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 13:48:41] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:48:42] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:48:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:48:43] [INFO ] After 1195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:48:43] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:48:44] [INFO ] After 1385ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:48:45] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 1 ms to minimize.
[2024-05-25 13:48:46] [INFO ] Deduced a trap composed of 83 places in 361 ms of which 0 ms to minimize.
[2024-05-25 13:48:46] [INFO ] Deduced a trap composed of 65 places in 361 ms of which 0 ms to minimize.
[2024-05-25 13:48:47] [INFO ] Deduced a trap composed of 90 places in 363 ms of which 0 ms to minimize.
[2024-05-25 13:48:47] [INFO ] Deduced a trap composed of 63 places in 355 ms of which 1 ms to minimize.
[2024-05-25 13:48:48] [INFO ] Deduced a trap composed of 63 places in 386 ms of which 3 ms to minimize.
[2024-05-25 13:48:48] [INFO ] Deduced a trap composed of 56 places in 390 ms of which 0 ms to minimize.
[2024-05-25 13:48:48] [INFO ] Deduced a trap composed of 66 places in 314 ms of which 0 ms to minimize.
[2024-05-25 13:48:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3833 ms
[2024-05-25 13:48:49] [INFO ] Deduced a trap composed of 16 places in 477 ms of which 0 ms to minimize.
[2024-05-25 13:48:50] [INFO ] Deduced a trap composed of 17 places in 391 ms of which 0 ms to minimize.
[2024-05-25 13:48:50] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 1 ms to minimize.
[2024-05-25 13:48:51] [INFO ] Deduced a trap composed of 73 places in 449 ms of which 1 ms to minimize.
[2024-05-25 13:48:51] [INFO ] Deduced a trap composed of 34 places in 413 ms of which 2 ms to minimize.
[2024-05-25 13:48:52] [INFO ] Deduced a trap composed of 10 places in 420 ms of which 1 ms to minimize.
[2024-05-25 13:48:52] [INFO ] Deduced a trap composed of 31 places in 483 ms of which 1 ms to minimize.
[2024-05-25 13:48:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3648 ms
[2024-05-25 13:48:53] [INFO ] After 9691ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 748 ms.
[2024-05-25 13:48:53] [INFO ] After 11767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 264 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 63 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 62 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-25 13:48:54] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:48:54] [INFO ] Invariant cache hit.
[2024-05-25 13:48:54] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-25 13:48:54] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:48:54] [INFO ] Invariant cache hit.
[2024-05-25 13:48:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:48:57] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 2776 ms to find 0 implicit places.
[2024-05-25 13:48:57] [INFO ] Redundant transitions in 151 ms returned []
[2024-05-25 13:48:57] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:48:57] [INFO ] Invariant cache hit.
[2024-05-25 13:48:58] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4114 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 225 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2024-05-25 13:48:58] [INFO ] Computed 9 invariants in 25 ms
[2024-05-25 13:48:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:48:59] [INFO ] After 742ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-25 13:48:59] [INFO ] After 867ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:48:59] [INFO ] After 965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:48:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:49:00] [INFO ] After 1044ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:49:01] [INFO ] After 1909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 636 ms.
[2024-05-25 13:49:02] [INFO ] After 2614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 212 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 344 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 23 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2024-05-25 13:49:03] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2024-05-25 13:49:03] [INFO ] Computed 8 invariants in 16 ms
[2024-05-25 13:49:03] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-25 13:49:03] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:49:03] [INFO ] Invariant cache hit.
[2024-05-25 13:49:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:49:06] [INFO ] Implicit Places using invariants and state equation in 2599 ms returned []
Implicit Place search using SMT with State Equation took 3125 ms to find 0 implicit places.
[2024-05-25 13:49:06] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:49:06] [INFO ] Invariant cache hit.
[2024-05-25 13:49:07] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4262 ms. Remains : 275/275 places, 3877/3877 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 115 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 70761 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70761 steps, saw 40880 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:49:11] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:49:11] [INFO ] Invariant cache hit.
[2024-05-25 13:49:11] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 13:49:12] [INFO ] After 730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:49:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:49:13] [INFO ] After 1233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:49:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:49:14] [INFO ] After 1379ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:49:15] [INFO ] Deduced a trap composed of 14 places in 559 ms of which 0 ms to minimize.
[2024-05-25 13:49:16] [INFO ] Deduced a trap composed of 48 places in 552 ms of which 0 ms to minimize.
[2024-05-25 13:49:16] [INFO ] Deduced a trap composed of 57 places in 511 ms of which 1 ms to minimize.
[2024-05-25 13:49:17] [INFO ] Deduced a trap composed of 10 places in 517 ms of which 1 ms to minimize.
[2024-05-25 13:49:18] [INFO ] Deduced a trap composed of 9 places in 378 ms of which 1 ms to minimize.
[2024-05-25 13:49:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3108 ms
[2024-05-25 13:49:18] [INFO ] After 5290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 514 ms.
[2024-05-25 13:49:19] [INFO ] After 7108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 174 ms.
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 3872
Applied a total of 10 rules in 171 ms. Remains 270 /275 variables (removed 5) and now considering 3872/3877 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 270/275 places, 3872/3877 transitions.
Incomplete random walk after 10000 steps, including 260 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 238 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 93815 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93815 steps, saw 62145 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:49:23] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-25 13:49:23] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 13:49:23] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:49:24] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:49:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:49:25] [INFO ] After 1175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:49:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:49:26] [INFO ] After 1251ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:49:27] [INFO ] Deduced a trap composed of 10 places in 390 ms of which 1 ms to minimize.
[2024-05-25 13:49:28] [INFO ] Deduced a trap composed of 83 places in 410 ms of which 0 ms to minimize.
[2024-05-25 13:49:28] [INFO ] Deduced a trap composed of 65 places in 469 ms of which 1 ms to minimize.
[2024-05-25 13:49:29] [INFO ] Deduced a trap composed of 90 places in 452 ms of which 0 ms to minimize.
[2024-05-25 13:49:29] [INFO ] Deduced a trap composed of 63 places in 432 ms of which 0 ms to minimize.
[2024-05-25 13:49:30] [INFO ] Deduced a trap composed of 63 places in 429 ms of which 1 ms to minimize.
[2024-05-25 13:49:31] [INFO ] Deduced a trap composed of 56 places in 409 ms of which 1 ms to minimize.
[2024-05-25 13:49:31] [INFO ] Deduced a trap composed of 66 places in 389 ms of which 1 ms to minimize.
[2024-05-25 13:49:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4494 ms
[2024-05-25 13:49:32] [INFO ] Deduced a trap composed of 16 places in 521 ms of which 2 ms to minimize.
[2024-05-25 13:49:33] [INFO ] Deduced a trap composed of 17 places in 516 ms of which 1 ms to minimize.
[2024-05-25 13:49:33] [INFO ] Deduced a trap composed of 23 places in 494 ms of which 1 ms to minimize.
[2024-05-25 13:49:34] [INFO ] Deduced a trap composed of 73 places in 459 ms of which 1 ms to minimize.
[2024-05-25 13:49:34] [INFO ] Deduced a trap composed of 34 places in 475 ms of which 3 ms to minimize.
[2024-05-25 13:49:35] [INFO ] Deduced a trap composed of 10 places in 481 ms of which 1 ms to minimize.
[2024-05-25 13:49:36] [INFO ] Deduced a trap composed of 31 places in 475 ms of which 0 ms to minimize.
[2024-05-25 13:49:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4071 ms
[2024-05-25 13:49:36] [INFO ] After 10563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 773 ms.
[2024-05-25 13:49:36] [INFO ] After 12603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 242 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 62 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 58 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-25 13:49:37] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:49:37] [INFO ] Invariant cache hit.
[2024-05-25 13:49:37] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-25 13:49:37] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:49:37] [INFO ] Invariant cache hit.
[2024-05-25 13:49:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:49:40] [INFO ] Implicit Places using invariants and state equation in 2530 ms returned []
Implicit Place search using SMT with State Equation took 3030 ms to find 0 implicit places.
[2024-05-25 13:49:40] [INFO ] Redundant transitions in 115 ms returned []
[2024-05-25 13:49:40] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-25 13:49:40] [INFO ] Invariant cache hit.
[2024-05-25 13:49:42] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5011 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 230 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2024-05-25 13:49:42] [INFO ] Computed 9 invariants in 21 ms
[2024-05-25 13:49:42] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 13:49:43] [INFO ] After 799ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-25 13:49:43] [INFO ] After 1025ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:49:43] [INFO ] After 1124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:49:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:49:44] [INFO ] After 1251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:49:45] [INFO ] After 2080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 631 ms.
[2024-05-25 13:49:46] [INFO ] After 2794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 156 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 342 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 310 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22266 reset in 930 ms.
Product exploration explored 100000 steps with 22326 reset in 932 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 336 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 64 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2024-05-25 13:49:50] [INFO ] Redundant transitions in 102 ms returned []
[2024-05-25 13:49:50] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2024-05-25 13:49:50] [INFO ] Computed 8 invariants in 24 ms
[2024-05-25 13:49:51] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1347 ms. Remains : 275/275 places, 3877/3877 transitions.
Built C files in :
/tmp/ltsmin9609750341781086235
[2024-05-25 13:49:51] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9609750341781086235
Running compilation step : cd /tmp/ltsmin9609750341781086235;'/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/ltsmin9609750341781086235;'/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/ltsmin9609750341781086235;'/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 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 17 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2024-05-25 13:49:54] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:49:54] [INFO ] Invariant cache hit.
[2024-05-25 13:49:54] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-25 13:49:54] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:49:54] [INFO ] Invariant cache hit.
[2024-05-25 13:49:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:49:57] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 3298 ms to find 0 implicit places.
[2024-05-25 13:49:57] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 13:49:57] [INFO ] Invariant cache hit.
[2024-05-25 13:49:58] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4500 ms. Remains : 275/275 places, 3877/3877 transitions.
Built C files in :
/tmp/ltsmin3615953949137570841
[2024-05-25 13:49:59] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3615953949137570841
Running compilation step : cd /tmp/ltsmin3615953949137570841;'/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/ltsmin3615953949137570841;'/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/ltsmin3615953949137570841;'/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 13:50:02] [INFO ] Flatten gal took : 138 ms
[2024-05-25 13:50:02] [INFO ] Flatten gal took : 140 ms
[2024-05-25 13:50:02] [INFO ] Time to serialize gal into /tmp/LTL9068195657111311645.gal : 20 ms
[2024-05-25 13:50:02] [INFO ] Time to serialize properties into /tmp/LTL1746150751870318439.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/LTL9068195657111311645.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8137461263182527640.hoa' '-atoms' '/tmp/LTL1746150751870318439.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...317
Loading property file /tmp/LTL1746150751870318439.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8137461263182527640.hoa
Detected timeout of ITS tools.
[2024-05-25 13:50:17] [INFO ] Flatten gal took : 172 ms
[2024-05-25 13:50:18] [INFO ] Flatten gal took : 180 ms
[2024-05-25 13:50:18] [INFO ] Time to serialize gal into /tmp/LTL11236992141222968330.gal : 40 ms
[2024-05-25 13:50:18] [INFO ] Time to serialize properties into /tmp/LTL12978260415291691927.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/LTL11236992141222968330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12978260415291691927.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...277
Read 1 LTL properties
Checking formula 0 : !((X(((!("(((l5>=1)&&(x1_MORE_INFO_q0>=1))&&(ch0_MORE_INFO_q1>=1))"))U("(((l2>=1)&&(x0_FIXED_q7>=1))&&(ch1_MUST_FIX_q7>=1))"))U(X(X(G(...223
Formula 0 simplified : X(("(((l5>=1)&&(x1_MORE_INFO_q0>=1))&&(ch0_MORE_INFO_q1>=1))" R !"(((l2>=1)&&(x0_FIXED_q7>=1))&&(ch1_MUST_FIX_q7>=1))") R XXF"(((l5>...207
Detected timeout of ITS tools.
[2024-05-25 13:50:33] [INFO ] Flatten gal took : 128 ms
[2024-05-25 13:50:33] [INFO ] Applying decomposition
[2024-05-25 13:50:33] [INFO ] Flatten gal took : 135 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/graph1595492931971318527.txt' '-o' '/tmp/graph1595492931971318527.bin' '-w' '/tmp/graph1595492931971318527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1595492931971318527.bin' '-l' '-1' '-v' '-w' '/tmp/graph1595492931971318527.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:50:33] [INFO ] Decomposing Gal with order
[2024-05-25 13:50:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:50:33] [INFO ] Removed a total of 424 redundant transitions.
[2024-05-25 13:50:33] [INFO ] Flatten gal took : 183 ms
[2024-05-25 13:50:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 13 ms.
[2024-05-25 13:50:34] [INFO ] Time to serialize gal into /tmp/LTL2413005968583075417.gal : 20 ms
[2024-05-25 13:50:34] [INFO ] Time to serialize properties into /tmp/LTL16716450974991052418.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/LTL2413005968583075417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16716450974991052418.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 : !((X(((!("(((u1.l5>=1)&&(u1.x1_MORE_INFO_q0>=1))&&(u1.ch0_MORE_INFO_q1>=1))"))U("(((u0.l2>=1)&&(u0.x0_FIXED_q7>=1))&&(u0.ch1_MUST_FIX_...250
Formula 0 simplified : X(("(((u1.l5>=1)&&(u1.x1_MORE_INFO_q0>=1))&&(u1.ch0_MORE_INFO_q1>=1))" R !"(((u0.l2>=1)&&(u0.x0_FIXED_q7>=1))&&(u0.ch1_MUST_FIX_q7>=...234
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5203451411462146
[2024-05-25 13:50:49] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5203451411462146
Running compilation step : cd /tmp/ltsmin5203451411462146;'/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/ltsmin5203451411462146;'/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/ltsmin5203451411462146;'/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 BugTracking-PT-q8m002-LTLFireability-10 finished in 153922 ms.
[2024-05-25 13:50:52] [INFO ] Flatten gal took : 130 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6935668050960758742
[2024-05-25 13:50:52] [INFO ] Too many transitions (3871) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:50:52] [INFO ] Applying decomposition
[2024-05-25 13:50:52] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6935668050960758742
Running compilation step : cd /tmp/ltsmin6935668050960758742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 13:50:52] [INFO ] Flatten gal took : 133 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/graph14355416135020034754.txt' '-o' '/tmp/graph14355416135020034754.bin' '-w' '/tmp/graph14355416135020034754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14355416135020034754.bin' '-l' '-1' '-v' '-w' '/tmp/graph14355416135020034754.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:50:52] [INFO ] Decomposing Gal with order
[2024-05-25 13:50:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:50:53] [INFO ] Removed a total of 406 redundant transitions.
[2024-05-25 13:50:53] [INFO ] Flatten gal took : 212 ms
[2024-05-25 13:50:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 377 labels/synchronizations in 9 ms.
[2024-05-25 13:50:53] [INFO ] Time to serialize gal into /tmp/LTLFireability3308866822116258370.gal : 23 ms
[2024-05-25 13:50:53] [INFO ] Time to serialize properties into /tmp/LTLFireability16233878355021447640.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/LTLFireability3308866822116258370.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16233878355021447640.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...277
Read 1 LTL properties
Checking formula 0 : !((X(((!("(((u1.l5>=1)&&(u1.x1_MORE_INFO_q0>=1))&&(u1.ch0_MORE_INFO_q1>=1))"))U("(((u0.l2>=1)&&(u0.x0_FIXED_q7>=1))&&(u0.ch1_MUST_FIX_...250
Formula 0 simplified : X(("(((u1.l5>=1)&&(u1.x1_MORE_INFO_q0>=1))&&(u1.ch0_MORE_INFO_q1>=1))" R !"(((u0.l2>=1)&&(u0.x0_FIXED_q7>=1))&&(u0.ch1_MUST_FIX_q7>=...234
Compilation finished in 13075 ms.
Running link step : cd /tmp/ltsmin6935668050960758742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 120 ms.
Running LTSmin : cd /tmp/ltsmin6935668050960758742;'/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(((!(LTLAPp0==true) U (LTLAPp1==true)) U X(X([](!(LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 14:12:56] [INFO ] Flatten gal took : 439 ms
[2024-05-25 14:12:56] [INFO ] Time to serialize gal into /tmp/LTLFireability17354628497482814206.gal : 26 ms
[2024-05-25 14:12:56] [INFO ] Time to serialize properties into /tmp/LTLFireability11033618546279196514.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/LTLFireability17354628497482814206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11033618546279196514.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...299
Read 1 LTL properties
Checking formula 0 : !((X(((!("(((l5>=1)&&(x1_MORE_INFO_q0>=1))&&(ch0_MORE_INFO_q1>=1))"))U("(((l2>=1)&&(x0_FIXED_q7>=1))&&(ch1_MUST_FIX_q7>=1))"))U(X(X(G(...223
Formula 0 simplified : X(("(((l5>=1)&&(x1_MORE_INFO_q0>=1))&&(ch0_MORE_INFO_q1>=1))" R !"(((l2>=1)&&(x0_FIXED_q7>=1))&&(ch1_MUST_FIX_q7>=1))") R XXF"(((l5>...207
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: LTL layer: formula: X(((!(LTLAPp0==true) U (LTLAPp1==true)) U X(X([](!(LTLAPp0==true))))))
pins2lts-mc-linux64( 5/ 8), 0.030: "X(((!(LTLAPp0==true) U (LTLAPp1==true)) U X(X([](!(LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.032: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.401: There are 3874 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.402: State length is 278, there are 3887 groups
pins2lts-mc-linux64( 0/ 8), 0.402: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.402: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.402: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.402: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.494: [Blue] ~43 levels ~960 states ~1568 transitions
pins2lts-mc-linux64( 7/ 8), 0.611: [Blue] ~49 levels ~1920 states ~2784 transitions
pins2lts-mc-linux64( 6/ 8), 0.742: [Blue] ~102 levels ~3840 states ~7264 transitions
pins2lts-mc-linux64( 6/ 8), 1.057: [Blue] ~154 levels ~7680 states ~13528 transitions
pins2lts-mc-linux64( 6/ 8), 1.642: [Blue] ~200 levels ~15360 states ~25456 transitions
pins2lts-mc-linux64( 2/ 8), 2.791: [Blue] ~1449 levels ~30720 states ~71528 transitions
pins2lts-mc-linux64( 2/ 8), 4.825: [Blue] ~3958 levels ~61440 states ~152776 transitions
pins2lts-mc-linux64( 2/ 8), 8.836: [Blue] ~9096 levels ~122880 states ~317608 transitions
pins2lts-mc-linux64( 2/ 8), 16.150: [Blue] ~19486 levels ~245760 states ~649008 transitions
pins2lts-mc-linux64( 2/ 8), 30.153: [Blue] ~39776 levels ~491520 states ~1301880 transitions
pins2lts-mc-linux64( 2/ 8), 58.698: [Blue] ~81119 levels ~983040 states ~2624216 transitions
pins2lts-mc-linux64( 4/ 8), 115.922: [Blue] ~245757 levels ~1966080 states ~11796864 transitions
pins2lts-mc-linux64( 4/ 8), 237.966: [Blue] ~491517 levels ~3932160 states ~23593344 transitions
pins2lts-mc-linux64( 5/ 8), 459.791: [Blue] ~983034 levels ~7864320 states ~47633048 transitions
pins2lts-mc-linux64( 5/ 8), 908.685: [Blue] ~1966074 levels ~15728640 states ~94818968 transitions
pins2lts-mc-linux64( 5/ 8), 1836.504: [Blue] ~3932154 levels ~31457280 states ~189190808 transitions
pins2lts-mc-linux64( 5/ 8), 2033.142: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2033.250:
pins2lts-mc-linux64( 0/ 8), 2033.250: Explored 33502808 states 164866138 transitions, fanout: 4.921
pins2lts-mc-linux64( 0/ 8), 2033.250: Total exploration time 2032.830 sec (2032.710 sec minimum, 2032.783 sec on average)
pins2lts-mc-linux64( 0/ 8), 2033.251: States per second: 16481, Transitions per second: 81102
pins2lts-mc-linux64( 0/ 8), 2033.251:
pins2lts-mc-linux64( 0/ 8), 2033.251: State space has 134217343 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 2033.251: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2033.251: blue states: 33502808 (24.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2033.251: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2033.251: all-red states: 6423102 (4.79%), bogus 155886 (0.12%)
pins2lts-mc-linux64( 0/ 8), 2033.251:
pins2lts-mc-linux64( 0/ 8), 2033.251: Total memory used for local state coloring: 370.6MB
pins2lts-mc-linux64( 0/ 8), 2033.251:
pins2lts-mc-linux64( 0/ 8), 2033.251: Queue width: 8B, total height: 24286761, memory: 185.29MB
pins2lts-mc-linux64( 0/ 8), 2033.251: Tree memory: 1214.8MB, 9.5 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 2033.251: Tree fill ratio (roots/leafs): 99.0%/74.0%
pins2lts-mc-linux64( 0/ 8), 2033.251: Stored 4065 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2033.251: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2033.251: Est. total memory use: 1400.1MB (~1209.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6935668050960758742;'/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(((!(LTLAPp0==true) U (LTLAPp1==true)) U X(X([](!(LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6935668050960758742;'/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(((!(LTLAPp0==true) U (LTLAPp1==true)) U X(X([](!(LTLAPp0==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)
Detected timeout of ITS tools.
[2024-05-25 14:34:59] [INFO ] Flatten gal took : 135 ms
[2024-05-25 14:34:59] [INFO ] Input system was already deterministic with 3871 transitions.
[2024-05-25 14:34:59] [INFO ] Transformed 277 places.
[2024-05-25 14:34:59] [INFO ] Transformed 3871 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 14:34:59] [INFO ] Time to serialize gal into /tmp/LTLFireability13280902327386170337.gal : 18 ms
[2024-05-25 14:34:59] [INFO ] Time to serialize properties into /tmp/LTLFireability4356162909592340063.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/LTLFireability13280902327386170337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4356162909592340063.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(((!("(((l5>=1)&&(x1_MORE_INFO_q0>=1))&&(ch0_MORE_INFO_q1>=1))"))U("(((l2>=1)&&(x0_FIXED_q7>=1))&&(ch1_MUST_FIX_q7>=1))"))U(X(X(G(...223
Formula 0 simplified : X(("(((l5>=1)&&(x1_MORE_INFO_q0>=1))&&(ch0_MORE_INFO_q1>=1))" R !"(((l2>=1)&&(x0_FIXED_q7>=1))&&(ch1_MUST_FIX_q7>=1))") R XXF"(((l5>...207
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11189808 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16021132 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="BugTracking-PT-q8m002"
export BK_EXAMINATION="LTLFireability"
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 BugTracking-PT-q8m002, examination is LTLFireability"
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-171620414700243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m002.tgz
mv BugTracking-PT-q8m002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;