About the Execution of 2023-gold for BugTracking-PT-q3m256
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13118.056 | 3600000.00 | 13986643.00 | 232.10 | FFFTFFT?FFFFFFFT | normal |
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-171620414700238.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-q3m256, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700238
=====================================================================
--------------------
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 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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-q3m256-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716644115917
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-q3m256
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 13:35:18] [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:35:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:35:19] [INFO ] Load time of PNML (sax parser for PT used): 780 ms
[2024-05-25 13:35:19] [INFO ] Transformed 754 places.
[2024-05-25 13:35:19] [INFO ] Transformed 27370 transitions.
[2024-05-25 13:35:19] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 979 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 49 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 514 places in 167 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 4 formulas.
FORMULA BugTracking-PT-q3m256-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 78 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-25 13:35:19] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:35:19] [INFO ] Computed 8 invariants in 42 ms
[2024-05-25 13:35:20] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-25 13:35:20] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:35:20] [INFO ] Invariant cache hit.
[2024-05-25 13:35:21] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:35:22] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 3056 ms to find 0 implicit places.
[2024-05-25 13:35:22] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:35:22] [INFO ] Invariant cache hit.
[2024-05-25 13:35:23] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4066 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 8 out of 237 places after structural reductions.
[2024-05-25 13:35:24] [INFO ] Flatten gal took : 289 ms
[2024-05-25 13:35:24] [INFO ] Flatten gal took : 197 ms
[2024-05-25 13:35:24] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 134724 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134724 steps, saw 64998 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:35:28] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:35:28] [INFO ] Invariant cache hit.
[2024-05-25 13:35:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:35:29] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:35:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:35:29] [INFO ] After 699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:35:29] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:35:30] [INFO ] After 615ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:35:31] [INFO ] Deduced a trap composed of 14 places in 365 ms of which 8 ms to minimize.
[2024-05-25 13:35:31] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 1 ms to minimize.
[2024-05-25 13:35:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 864 ms
[2024-05-25 13:35:32] [INFO ] Deduced a trap composed of 10 places in 448 ms of which 1 ms to minimize.
[2024-05-25 13:35:32] [INFO ] Deduced a trap composed of 43 places in 353 ms of which 2 ms to minimize.
[2024-05-25 13:35:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1079 ms
[2024-05-25 13:35:32] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2024-05-25 13:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 468 ms
[2024-05-25 13:35:33] [INFO ] After 3358ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 427 ms.
[2024-05-25 13:35:33] [INFO ] After 4608ms 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 152 ms.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 248 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10136 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=779 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 124268 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124268 steps, saw 55825 distinct states, run finished after 3004 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 13:35:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:35:37] [INFO ] Computed 8 invariants in 36 ms
[2024-05-25 13:35:37] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:35:38] [INFO ] After 531ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-25 13:35:38] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:35:38] [INFO ] After 131ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:35:38] [INFO ] After 838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:35:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:35:38] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 13:35:39] [INFO ] After 378ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 13:35:39] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 1 ms to minimize.
[2024-05-25 13:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2024-05-25 13:35:40] [INFO ] After 1096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 227 ms.
[2024-05-25 13:35:40] [INFO ] After 1966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 60 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:35:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:35:40] [INFO ] Invariant cache hit.
[2024-05-25 13:35:41] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-05-25 13:35:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:35:41] [INFO ] Invariant cache hit.
[2024-05-25 13:35:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:35:43] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned []
Implicit Place search using SMT with State Equation took 3236 ms to find 0 implicit places.
[2024-05-25 13:35:43] [INFO ] Redundant transitions in 276 ms returned []
[2024-05-25 13:35:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:35:43] [INFO ] Invariant cache hit.
[2024-05-25 13:35:44] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4485 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 328 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:35:45] [INFO ] Computed 9 invariants in 14 ms
[2024-05-25 13:35:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:35:45] [INFO ] After 482ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-25 13:35:45] [INFO ] After 583ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:35:45] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:35:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 13:35:46] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 13:35:46] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-25 13:35:46] [INFO ] After 968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q3m256-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 111 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' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 166 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2024-05-25 13:35:47] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:35:47] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 13:35:47] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-25 13:35:47] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:35:47] [INFO ] Invariant cache hit.
[2024-05-25 13:35:48] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:35:49] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
[2024-05-25 13:35:49] [INFO ] Redundant transitions in 158 ms returned []
[2024-05-25 13:35:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:35:49] [INFO ] Invariant cache hit.
[2024-05-25 13:35:50] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3523 ms. Remains : 235/237 places, 2753/2750 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 290 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BugTracking-PT-q3m256-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s82 1) (LT s180 1) (LT s17 1) (LT s99 1) (LT s203 1)), p1:(AND (GEQ s10 1) (GEQ s82 1) (GEQ s180 1)), p2:(OR (LT s17 1) (LT s99 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22 reset in 887 ms.
Product exploration explored 100000 steps with 23 reset in 783 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X p0), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 174 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 125094 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125094 steps, saw 60488 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-25 13:35:56] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:35:56] [INFO ] Invariant cache hit.
[2024-05-25 13:35:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:35:56] [INFO ] After 411ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-25 13:35:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:35:57] [INFO ] After 125ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 13:35:57] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 13:35:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:35:57] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 13:35:58] [INFO ] After 501ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-25 13:35:58] [INFO ] Deduced a trap composed of 40 places in 358 ms of which 0 ms to minimize.
[2024-05-25 13:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2024-05-25 13:35:59] [INFO ] After 1389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 368 ms.
[2024-05-25 13:35:59] [INFO ] After 2429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 117 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10088 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1261 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 128404 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128404 steps, saw 58597 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-25 13:36:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:36:03] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 13:36:03] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 13:36:04] [INFO ] After 556ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-25 13:36:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:36:04] [INFO ] After 300ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 13:36:04] [INFO ] After 946ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 13:36:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:36:05] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 13:36:05] [INFO ] After 551ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-25 13:36:06] [INFO ] Deduced a trap composed of 38 places in 401 ms of which 0 ms to minimize.
[2024-05-25 13:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 548 ms
[2024-05-25 13:36:06] [INFO ] Deduced a trap composed of 22 places in 358 ms of which 0 ms to minimize.
[2024-05-25 13:36:07] [INFO ] Deduced a trap composed of 42 places in 345 ms of which 0 ms to minimize.
[2024-05-25 13:36:07] [INFO ] Deduced a trap composed of 60 places in 376 ms of which 1 ms to minimize.
[2024-05-25 13:36:08] [INFO ] Deduced a trap composed of 59 places in 403 ms of which 1 ms to minimize.
[2024-05-25 13:36:08] [INFO ] Deduced a trap composed of 15 places in 376 ms of which 0 ms to minimize.
[2024-05-25 13:36:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2211 ms
[2024-05-25 13:36:09] [INFO ] Deduced a trap composed of 69 places in 442 ms of which 1 ms to minimize.
[2024-05-25 13:36:09] [INFO ] Deduced a trap composed of 41 places in 421 ms of which 1 ms to minimize.
[2024-05-25 13:36:10] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 1 ms to minimize.
[2024-05-25 13:36:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1391 ms
[2024-05-25 13:36:10] [INFO ] After 5135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 298 ms.
[2024-05-25 13:36:10] [INFO ] After 6310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 37 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 66 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:36:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:36:10] [INFO ] Invariant cache hit.
[2024-05-25 13:36:11] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-25 13:36:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:36:11] [INFO ] Invariant cache hit.
[2024-05-25 13:36:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:36:12] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2024-05-25 13:36:12] [INFO ] Redundant transitions in 106 ms returned []
[2024-05-25 13:36:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:36:12] [INFO ] Invariant cache hit.
[2024-05-25 13:36:13] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3025 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 323 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:36:14] [INFO ] Computed 9 invariants in 24 ms
[2024-05-25 13:36:14] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:36:14] [INFO ] After 530ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-25 13:36:15] [INFO ] After 686ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-25 13:36:15] [INFO ] After 875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2024-05-25 13:36:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-25 13:36:15] [INFO ] After 692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 13:36:16] [INFO ] After 1116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 223 ms.
[2024-05-25 13:36:16] [INFO ] After 1477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X p0), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 37 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2024-05-25 13:36:17] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:36:17] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:36:17] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-25 13:36:17] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:36:17] [INFO ] Invariant cache hit.
[2024-05-25 13:36:17] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:36:19] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
[2024-05-25 13:36:19] [INFO ] Redundant transitions in 86 ms returned []
[2024-05-25 13:36:19] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:36:19] [INFO ] Invariant cache hit.
[2024-05-25 13:36:20] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3058 ms. Remains : 235/235 places, 2753/2753 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X p0), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 162 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 133536 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133536 steps, saw 64441 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-25 13:36:23] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:36:23] [INFO ] Invariant cache hit.
[2024-05-25 13:36:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:36:24] [INFO ] After 499ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-25 13:36:24] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:36:24] [INFO ] After 156ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 13:36:24] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 13:36:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:36:25] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 13:36:25] [INFO ] After 434ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-25 13:36:26] [INFO ] Deduced a trap composed of 40 places in 397 ms of which 0 ms to minimize.
[2024-05-25 13:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2024-05-25 13:36:27] [INFO ] After 1620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 404 ms.
[2024-05-25 13:36:27] [INFO ] After 2806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 106 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10081 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=347 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 132570 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132570 steps, saw 61389 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-25 13:36:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:36:31] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 13:36:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:36:31] [INFO ] After 474ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-25 13:36:31] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:36:31] [INFO ] After 162ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 13:36:31] [INFO ] After 768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 13:36:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:36:32] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 13:36:33] [INFO ] After 392ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-25 13:36:33] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 2 ms to minimize.
[2024-05-25 13:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2024-05-25 13:36:34] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 0 ms to minimize.
[2024-05-25 13:36:34] [INFO ] Deduced a trap composed of 42 places in 449 ms of which 1 ms to minimize.
[2024-05-25 13:36:35] [INFO ] Deduced a trap composed of 60 places in 415 ms of which 0 ms to minimize.
[2024-05-25 13:36:35] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 0 ms to minimize.
[2024-05-25 13:36:36] [INFO ] Deduced a trap composed of 15 places in 374 ms of which 0 ms to minimize.
[2024-05-25 13:36:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2405 ms
[2024-05-25 13:36:36] [INFO ] Deduced a trap composed of 69 places in 400 ms of which 0 ms to minimize.
[2024-05-25 13:36:37] [INFO ] Deduced a trap composed of 41 places in 396 ms of which 1 ms to minimize.
[2024-05-25 13:36:37] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 1 ms to minimize.
[2024-05-25 13:36:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1404 ms
[2024-05-25 13:36:37] [INFO ] After 5097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 542 ms.
[2024-05-25 13:36:38] [INFO ] After 6309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 70 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 55 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:36:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:36:38] [INFO ] Invariant cache hit.
[2024-05-25 13:36:38] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-25 13:36:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:36:38] [INFO ] Invariant cache hit.
[2024-05-25 13:36:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:36:40] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2024-05-25 13:36:40] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-25 13:36:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:36:40] [INFO ] Invariant cache hit.
[2024-05-25 13:36:41] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3253 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 255 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:36:41] [INFO ] Computed 9 invariants in 11 ms
[2024-05-25 13:36:42] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 13:36:42] [INFO ] After 488ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-25 13:36:42] [INFO ] After 658ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-25 13:36:42] [INFO ] After 877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2024-05-25 13:36:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:36:43] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 13:36:44] [INFO ] After 1169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 285 ms.
[2024-05-25 13:36:44] [INFO ] After 1540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X p0), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 179 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 23 reset in 795 ms.
Product exploration explored 100000 steps with 22 reset in 643 ms.
Built C files in :
/tmp/ltsmin1324620251868669100
[2024-05-25 13:36:46] [INFO ] Too many transitions (2753) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:36:46] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1324620251868669100
Running compilation step : cd /tmp/ltsmin1324620251868669100;'/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/ltsmin1324620251868669100;'/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/ltsmin1324620251868669100;'/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 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 32 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2024-05-25 13:36:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:36:49] [INFO ] Computed 8 invariants in 7 ms
[2024-05-25 13:36:50] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-25 13:36:50] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:36:50] [INFO ] Invariant cache hit.
[2024-05-25 13:36:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:36:51] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2024-05-25 13:36:51] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-25 13:36:51] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:36:51] [INFO ] Invariant cache hit.
[2024-05-25 13:36:52] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2994 ms. Remains : 235/235 places, 2753/2753 transitions.
Built C files in :
/tmp/ltsmin13962809725213890163
[2024-05-25 13:36:52] [INFO ] Too many transitions (2753) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:36:52] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13962809725213890163
Running compilation step : cd /tmp/ltsmin13962809725213890163;'/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/ltsmin13962809725213890163;'/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/ltsmin13962809725213890163;'/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:36:56] [INFO ] Flatten gal took : 124 ms
[2024-05-25 13:36:56] [INFO ] Flatten gal took : 120 ms
[2024-05-25 13:36:56] [INFO ] Time to serialize gal into /tmp/LTL14124267811872698793.gal : 24 ms
[2024-05-25 13:36:56] [INFO ] Time to serialize properties into /tmp/LTL6021451383376846495.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/LTL14124267811872698793.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17832955405665394954.hoa' '-atoms' '/tmp/LTL6021451383376846495.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/LTL6021451383376846495.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17832955405665394954.hoa
Detected timeout of ITS tools.
[2024-05-25 13:37:11] [INFO ] Flatten gal took : 127 ms
[2024-05-25 13:37:11] [INFO ] Flatten gal took : 127 ms
[2024-05-25 13:37:11] [INFO ] Time to serialize gal into /tmp/LTL5512274627223325156.gal : 20 ms
[2024-05-25 13:37:11] [INFO ] Time to serialize properties into /tmp/LTL7140333897874217881.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/LTL5512274627223325156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7140333897874217881.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))"))&&(F((G...288
Formula 0 simplified : F(G!"((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))" | G(F!"(((...276
Detected timeout of ITS tools.
[2024-05-25 13:37:26] [INFO ] Flatten gal took : 161 ms
[2024-05-25 13:37:26] [INFO ] Applying decomposition
[2024-05-25 13:37:27] [INFO ] Flatten gal took : 129 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/graph14094581088720415707.txt' '-o' '/tmp/graph14094581088720415707.bin' '-w' '/tmp/graph14094581088720415707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14094581088720415707.bin' '-l' '-1' '-v' '-w' '/tmp/graph14094581088720415707.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:37:27] [INFO ] Decomposing Gal with order
[2024-05-25 13:37:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:37:27] [INFO ] Removed a total of 346 redundant transitions.
[2024-05-25 13:37:27] [INFO ] Flatten gal took : 244 ms
[2024-05-25 13:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 16 ms.
[2024-05-25 13:37:28] [INFO ] Time to serialize gal into /tmp/LTL11404722175992069367.gal : 24 ms
[2024-05-25 13:37:28] [INFO ] Time to serialize properties into /tmp/LTL1004486842621803246.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/LTL11404722175992069367.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1004486842621803246.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 : !((G((F("((((i2.u3.l10<1)||(i2.u3.x2_FIX_AGAIN_q6<1))||((i2.u3.ch2_BUG_REPORT_q6<1)||(u6.l19<1)))||((u6.x3_BUG_REPORT_q0<1)||(u6.ch3_B...342
Formula 0 simplified : F(G!"((((i2.u3.l10<1)||(i2.u3.x2_FIX_AGAIN_q6<1))||((i2.u3.ch2_BUG_REPORT_q6<1)||(u6.l19<1)))||((u6.x3_BUG_REPORT_q0<1)||(u6.ch3_BUG...330
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17314755291045152401
[2024-05-25 13:37:43] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17314755291045152401
Running compilation step : cd /tmp/ltsmin17314755291045152401;'/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/ltsmin17314755291045152401;'/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/ltsmin17314755291045152401;'/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-q3m256-LTLFireability-07 finished in 119235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
[2024-05-25 13:37:46] [INFO ] Flatten gal took : 130 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4389705477523788781
[2024-05-25 13:37:46] [INFO ] Too many transitions (2750) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:37:46] [INFO ] Applying decomposition
[2024-05-25 13:37:46] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4389705477523788781
Running compilation step : cd /tmp/ltsmin4389705477523788781;'/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:37:46] [INFO ] Flatten gal took : 109 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/graph4931861663190762345.txt' '-o' '/tmp/graph4931861663190762345.bin' '-w' '/tmp/graph4931861663190762345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4931861663190762345.bin' '-l' '-1' '-v' '-w' '/tmp/graph4931861663190762345.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:37:47] [INFO ] Decomposing Gal with order
[2024-05-25 13:37:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:37:47] [INFO ] Removed a total of 334 redundant transitions.
[2024-05-25 13:37:47] [INFO ] Flatten gal took : 330 ms
[2024-05-25 13:37:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 13 ms.
[2024-05-25 13:37:47] [INFO ] Time to serialize gal into /tmp/LTLFireability6172075632118420335.gal : 14 ms
[2024-05-25 13:37:47] [INFO ] Time to serialize properties into /tmp/LTLFireability15845465886046889825.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/LTLFireability6172075632118420335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15845465886046889825.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 : !((G((F("((((i2.u3.l10<1)||(i2.u3.x2_FIX_AGAIN_q6<1))||((i2.u3.ch2_BUG_REPORT_q6<1)||(u6.l19<1)))||((u6.x3_BUG_REPORT_q0<1)||(u6.ch3_B...342
Formula 0 simplified : F(G!"((((i2.u3.l10<1)||(i2.u3.x2_FIX_AGAIN_q6<1))||((i2.u3.ch2_BUG_REPORT_q6<1)||(u6.l19<1)))||((u6.x3_BUG_REPORT_q0<1)||(u6.ch3_BUG...330
Compilation finished in 8896 ms.
Running link step : cd /tmp/ltsmin4389705477523788781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin4389705477523788781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 13:58:37] [INFO ] Flatten gal took : 213 ms
[2024-05-25 13:58:37] [INFO ] Time to serialize gal into /tmp/LTLFireability9737028212056787803.gal : 42 ms
[2024-05-25 13:58:37] [INFO ] Time to serialize properties into /tmp/LTLFireability16171126969994452557.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9737028212056787803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16171126969994452557.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G((F("((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))"))&&(F((G...288
Formula 0 simplified : F(G!"((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))" | G(F!"(((...276
Detected timeout of ITS tools.
[2024-05-25 14:19:27] [INFO ] Flatten gal took : 214 ms
[2024-05-25 14:19:27] [INFO ] Input system was already deterministic with 2750 transitions.
[2024-05-25 14:19:27] [INFO ] Transformed 237 places.
[2024-05-25 14:19:27] [INFO ] Transformed 2750 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:19:28] [INFO ] Time to serialize gal into /tmp/LTLFireability7465167723863538115.gal : 36 ms
[2024-05-25 14:19:28] [INFO ] Time to serialize properties into /tmp/LTLFireability11161065580754615571.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/LTLFireability7465167723863538115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11161065580754615571.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 : !((G((F("((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))"))&&(F((G...288
Formula 0 simplified : F(G!"((((l10<1)||(x2_FIX_AGAIN_q6<1))||((ch2_BUG_REPORT_q6<1)||(l19<1)))||((x3_BUG_REPORT_q0<1)||(ch3_BUG_REPORT_q3<1)))" | G(F!"(((...276
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 7941764 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16023108 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-q3m256"
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-q3m256, 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-171620414700238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 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 '
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 ;