fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r065-tajo-171620414700233
Last Updated
July 7, 2024

About the Execution of 2023-gold for BugTracking-PT-q3m128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13610.836 3600000.00 13959606.00 318.40 FTFTTTFFT?TFTFFF 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-171620414700233.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-q3m128, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:12 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-q3m128-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m128-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716643740890

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-q3m128
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 13:29:02] [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:29:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:29:04] [INFO ] Load time of PNML (sax parser for PT used): 1025 ms
[2024-05-25 13:29:04] [INFO ] Transformed 754 places.
[2024-05-25 13:29:04] [INFO ] Transformed 27370 transitions.
[2024-05-25 13:29:04] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 514 places in 127 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q3m128-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 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 117 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-25 13:29:04] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:29:04] [INFO ] Computed 8 invariants in 33 ms
[2024-05-25 13:29:05] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-25 13:29:05] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:29:05] [INFO ] Invariant cache hit.
[2024-05-25 13:29:06] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:29:07] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
[2024-05-25 13:29:07] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:29:07] [INFO ] Invariant cache hit.
[2024-05-25 13:29:08] [INFO ] Dead Transitions using invariants and state equation in 893 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 3556 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 5 out of 237 places after structural reductions.
[2024-05-25 13:29:09] [INFO ] Flatten gal took : 471 ms
[2024-05-25 13:29:09] [INFO ] Flatten gal took : 349 ms
[2024-05-25 13:29:09] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10125 steps, including 5 resets, run finished after 324 ms. (steps per millisecond=31 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 118689 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118689 steps, saw 56828 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:29:13] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:29:13] [INFO ] Invariant cache hit.
[2024-05-25 13:29:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:29:14] [INFO ] After 827ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 13:29:14] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:29:14] [INFO ] After 366ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:29:14] [INFO ] After 1347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:29:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:29:15] [INFO ] After 698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:29:16] [INFO ] After 300ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 13:29:16] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 5 ms to minimize.
[2024-05-25 13:29:16] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 1 ms to minimize.
[2024-05-25 13:29:17] [INFO ] Deduced a trap composed of 8 places in 432 ms of which 1 ms to minimize.
[2024-05-25 13:29:17] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 1 ms to minimize.
[2024-05-25 13:29:18] [INFO ] Deduced a trap composed of 12 places in 355 ms of which 1 ms to minimize.
[2024-05-25 13:29:18] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 0 ms to minimize.
[2024-05-25 13:29:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2519 ms
[2024-05-25 13:29:18] [INFO ] After 3120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 308 ms.
[2024-05-25 13:29:19] [INFO ] After 4290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 184 ms.
Support contains 5 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 14 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 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 230 transition count 2748
Applied a total of 14 rules in 366 ms. Remains 230 /237 variables (removed 7) and now considering 2748/2750 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 10003 steps, including 12 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 86937 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86937 steps, saw 57335 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:29:23] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2024-05-25 13:29:23] [INFO ] Computed 8 invariants in 13 ms
[2024-05-25 13:29:23] [INFO ] [Real]Absence check using 8 positive place invariants in 44 ms returned sat
[2024-05-25 13:29:26] [INFO ] After 3105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:29:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:29:26] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:29:26] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:29:27] [INFO ] After 279ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 13:29:27] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 1 ms to minimize.
[2024-05-25 13:29:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2024-05-25 13:29:27] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2024-05-25 13:29:28] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2024-05-25 13:29:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 625 ms
[2024-05-25 13:29:28] [INFO ] After 1392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 243 ms.
[2024-05-25 13:29:28] [INFO ] After 2211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 150 ms.
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 105 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 122 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2024-05-25 13:29:28] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:29:28] [INFO ] Invariant cache hit.
[2024-05-25 13:29:29] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-25 13:29:29] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:29:29] [INFO ] Invariant cache hit.
[2024-05-25 13:29:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:29:32] [INFO ] Implicit Places using invariants and state equation in 2959 ms returned []
Implicit Place search using SMT with State Equation took 3342 ms to find 0 implicit places.
[2024-05-25 13:29:32] [INFO ] Redundant transitions in 198 ms returned []
[2024-05-25 13:29:32] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:29:32] [INFO ] Invariant cache hit.
[2024-05-25 13:29:53] [INFO ] Dead Transitions using invariants and state equation in 21052 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24749 ms. Remains : 230/230 places, 2748/2748 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 230 transition count 2618
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 134 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 135 place count 228 transition count 2615
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 228 transition count 2611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 285 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2611 rows 224 cols
[2024-05-25 13:29:53] [INFO ] Computed 9 invariants in 11 ms
[2024-05-25 13:29:54] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2024-05-25 13:29:54] [INFO ] After 452ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 13:29:54] [INFO ] After 757ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 223 ms.
[2024-05-25 13:29:55] [INFO ] After 1184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:29:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:29:55] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:29:55] [INFO ] After 615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2024-05-25 13:29:55] [INFO ] After 789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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' '!(X(G(p0)))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 9 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2024-05-25 13:29:56] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:29:56] [INFO ] Computed 8 invariants in 13 ms
[2024-05-25 13:29:56] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-25 13:29:56] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:29:56] [INFO ] Invariant cache hit.
[2024-05-25 13:29:56] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:29:57] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
[2024-05-25 13:29:57] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:29:57] [INFO ] Invariant cache hit.
[2024-05-25 13:29:58] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2432 ms. Remains : 237/237 places, 2750/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 172 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m128-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s2 1) (GEQ s33 1) (GEQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BugTracking-PT-q3m128-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m128-LTLFireability-06 finished in 2670 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(p0))'
Support contains 3 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 1 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 105 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2024-05-25 13:29:58] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:29:58] [INFO ] Computed 8 invariants in 7 ms
[2024-05-25 13:29:59] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-25 13:29:59] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:29:59] [INFO ] Invariant cache hit.
[2024-05-25 13:29:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:00] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
[2024-05-25 13:30:00] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-25 13:30:00] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:30:00] [INFO ] Invariant cache hit.
[2024-05-25 13:30:01] [INFO ] Dead Transitions using invariants and state equation in 822 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 3108 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m128-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s36 1) (LT s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 44 reset in 755 ms.
Product exploration explored 100000 steps with 46 reset in 741 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174790 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174790 steps, saw 84593 distinct states, run finished after 3011 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:30:06] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:30:06] [INFO ] Invariant cache hit.
[2024-05-25 13:30:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:30:07] [INFO ] After 1082ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:30:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:08] [INFO ] After 254ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:08] [INFO ] After 1456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:30:08] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:09] [INFO ] After 336ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:09] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2024-05-25 13:30:09] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 1 ms to minimize.
[2024-05-25 13:30:09] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2024-05-25 13:30:10] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2024-05-25 13:30:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1105 ms
[2024-05-25 13:30:10] [INFO ] After 1535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-25 13:30:10] [INFO ] After 2213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 3 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 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 2748
Applied a total of 10 rules in 73 ms. Remains 230 /235 variables (removed 5) and now considering 2748/2753 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 230/235 places, 2748/2753 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 148341 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148341 steps, saw 97379 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:30:13] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2024-05-25 13:30:13] [INFO ] Computed 8 invariants in 25 ms
[2024-05-25 13:30:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:30:14] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:30:14] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:15] [INFO ] After 320ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:15] [INFO ] After 477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-25 13:30:15] [INFO ] After 1200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 89 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 83 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2024-05-25 13:30:15] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:30:15] [INFO ] Invariant cache hit.
[2024-05-25 13:30:16] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-25 13:30:16] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:30:16] [INFO ] Invariant cache hit.
[2024-05-25 13:30:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:17] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
[2024-05-25 13:30:18] [INFO ] Redundant transitions in 140 ms returned []
[2024-05-25 13:30:18] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:30:18] [INFO ] Invariant cache hit.
[2024-05-25 13:30:18] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3456 ms. Remains : 230/230 places, 2748/2748 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 230 transition count 2618
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 134 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 135 place count 228 transition count 2615
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 228 transition count 2611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 147 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2611 rows 224 cols
[2024-05-25 13:30:19] [INFO ] Computed 9 invariants in 19 ms
[2024-05-25 13:30:19] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:30:19] [INFO ] After 462ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:30:19] [INFO ] After 593ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:19] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:30:20] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:20] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-25 13:30:20] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Support contains 3 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 45 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2024-05-25 13:30:20] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:30:20] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 13:30:21] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-25 13:30:21] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:30:21] [INFO ] Invariant cache hit.
[2024-05-25 13:30:21] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:23] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
[2024-05-25 13:30:23] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-25 13:30:23] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:30:23] [INFO ] Invariant cache hit.
[2024-05-25 13:30:24] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3560 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 196933 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196933 steps, saw 95439 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:30:27] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:30:27] [INFO ] Invariant cache hit.
[2024-05-25 13:30:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:30:28] [INFO ] After 539ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:30:28] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:28] [INFO ] After 267ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:28] [INFO ] After 950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:30:29] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:29] [INFO ] After 178ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:29] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 0 ms to minimize.
[2024-05-25 13:30:30] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 14 ms to minimize.
[2024-05-25 13:30:30] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 0 ms to minimize.
[2024-05-25 13:30:32] [INFO ] Deduced a trap composed of 11 places in 2016 ms of which 26 ms to minimize.
[2024-05-25 13:30:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3130 ms
[2024-05-25 13:30:32] [INFO ] After 3401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-25 13:30:32] [INFO ] After 4020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 3 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 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 2748
Applied a total of 10 rules in 98 ms. Remains 230 /235 variables (removed 5) and now considering 2748/2753 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 230/235 places, 2748/2753 transitions.
Incomplete random walk after 10122 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=266 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 182633 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182633 steps, saw 119548 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:30:36] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2024-05-25 13:30:36] [INFO ] Computed 8 invariants in 18 ms
[2024-05-25 13:30:36] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:30:36] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:30:37] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:37] [INFO ] After 212ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:37] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-25 13:30:37] [INFO ] After 1005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 35 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 31 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2024-05-25 13:30:37] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:30:37] [INFO ] Invariant cache hit.
[2024-05-25 13:30:38] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-25 13:30:38] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:30:38] [INFO ] Invariant cache hit.
[2024-05-25 13:30:38] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:39] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
[2024-05-25 13:30:39] [INFO ] Redundant transitions in 92 ms returned []
[2024-05-25 13:30:39] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-25 13:30:39] [INFO ] Invariant cache hit.
[2024-05-25 13:30:40] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2851 ms. Remains : 230/230 places, 2748/2748 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 230 transition count 2618
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 134 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 135 place count 228 transition count 2615
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 228 transition count 2611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 115 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2611 rows 224 cols
[2024-05-25 13:30:40] [INFO ] Computed 9 invariants in 7 ms
[2024-05-25 13:30:40] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:30:41] [INFO ] After 377ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:30:41] [INFO ] After 461ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:41] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:30:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:30:41] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:30:41] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-25 13:30:41] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 44 reset in 586 ms.
Product exploration explored 100000 steps with 44 reset in 611 ms.
Built C files in :
/tmp/ltsmin13712786746663813650
[2024-05-25 13:30:43] [INFO ] Too many transitions (2753) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:30:43] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13712786746663813650
Running compilation step : cd /tmp/ltsmin13712786746663813650;'/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/ltsmin13712786746663813650;'/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/ltsmin13712786746663813650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 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 39 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2024-05-25 13:30:46] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:30:46] [INFO ] Computed 8 invariants in 6 ms
[2024-05-25 13:30:46] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-25 13:30:46] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:30:46] [INFO ] Invariant cache hit.
[2024-05-25 13:30:47] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:30:48] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2024-05-25 13:30:48] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-25 13:30:48] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:30:48] [INFO ] Invariant cache hit.
[2024-05-25 13:30:49] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2944 ms. Remains : 235/235 places, 2753/2753 transitions.
Built C files in :
/tmp/ltsmin5520626511084905161
[2024-05-25 13:30:49] [INFO ] Too many transitions (2753) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:30:49] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5520626511084905161
Running compilation step : cd /tmp/ltsmin5520626511084905161;'/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/ltsmin5520626511084905161;'/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/ltsmin5520626511084905161;'/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:30:53] [INFO ] Flatten gal took : 212 ms
[2024-05-25 13:30:53] [INFO ] Flatten gal took : 241 ms
[2024-05-25 13:30:53] [INFO ] Time to serialize gal into /tmp/LTL3344077182558655081.gal : 66 ms
[2024-05-25 13:30:53] [INFO ] Time to serialize properties into /tmp/LTL12261165723368704698.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/LTL3344077182558655081.gal' '-t' 'CGAL' '-hoa' '/tmp/aut172166234190245817.hoa' '-atoms' '/tmp/LTL12261165723368704698.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/LTL12261165723368704698.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut172166234190245817.hoa
Detected timeout of ITS tools.
[2024-05-25 13:31:08] [INFO ] Flatten gal took : 166 ms
[2024-05-25 13:31:08] [INFO ] Flatten gal took : 168 ms
[2024-05-25 13:31:09] [INFO ] Time to serialize gal into /tmp/LTL13523206623780364730.gal : 31 ms
[2024-05-25 13:31:09] [INFO ] Time to serialize properties into /tmp/LTL15321182212074580253.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/LTL13523206623780364730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15321182212074580253.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 : !((G("(((l2<1)||(x0_CLOSED_q8<1))||(ch1_PENDING_q3<1))")))
Formula 0 simplified : F!"(((l2<1)||(x0_CLOSED_q8<1))||(ch1_PENDING_q3<1))"
Detected timeout of ITS tools.
[2024-05-25 13:31:24] [INFO ] Flatten gal took : 91 ms
[2024-05-25 13:31:24] [INFO ] Applying decomposition
[2024-05-25 13:31:24] [INFO ] Flatten gal took : 169 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/graph8480011534237428724.txt' '-o' '/tmp/graph8480011534237428724.bin' '-w' '/tmp/graph8480011534237428724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8480011534237428724.bin' '-l' '-1' '-v' '-w' '/tmp/graph8480011534237428724.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:31:24] [INFO ] Decomposing Gal with order
[2024-05-25 13:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:31:24] [INFO ] Removed a total of 346 redundant transitions.
[2024-05-25 13:31:25] [INFO ] Flatten gal took : 262 ms
[2024-05-25 13:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 14 ms.
[2024-05-25 13:31:25] [INFO ] Time to serialize gal into /tmp/LTL15020993363202916265.gal : 17 ms
[2024-05-25 13:31:25] [INFO ] Time to serialize properties into /tmp/LTL16895476048770669323.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/LTL15020993363202916265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16895476048770669323.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...256
Read 1 LTL properties
Checking formula 0 : !((G("(((i1.u1.l2<1)||(i1.u1.x0_CLOSED_q8<1))||(i1.u1.ch1_PENDING_q3<1))")))
Formula 0 simplified : F!"(((i1.u1.l2<1)||(i1.u1.x0_CLOSED_q8<1))||(i1.u1.ch1_PENDING_q3<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6812928383696013571
[2024-05-25 13:31:40] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6812928383696013571
Running compilation step : cd /tmp/ltsmin6812928383696013571;'/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/ltsmin6812928383696013571;'/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/ltsmin6812928383696013571;'/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-q3m128-LTLFireability-09 finished in 104645 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(p0))'
[2024-05-25 13:31:43] [INFO ] Flatten gal took : 107 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5342484868429602122
[2024-05-25 13:31:43] [INFO ] Too many transitions (2750) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:31:43] [INFO ] Applying decomposition
[2024-05-25 13:31:43] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5342484868429602122
Running compilation step : cd /tmp/ltsmin5342484868429602122;'/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:31:43] [INFO ] Flatten gal took : 112 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/graph15698226237499429095.txt' '-o' '/tmp/graph15698226237499429095.bin' '-w' '/tmp/graph15698226237499429095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15698226237499429095.bin' '-l' '-1' '-v' '-w' '/tmp/graph15698226237499429095.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:31:44] [INFO ] Decomposing Gal with order
[2024-05-25 13:31:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:31:44] [INFO ] Removed a total of 334 redundant transitions.
[2024-05-25 13:31:44] [INFO ] Flatten gal took : 163 ms
[2024-05-25 13:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 12 ms.
[2024-05-25 13:31:44] [INFO ] Time to serialize gal into /tmp/LTLFireability14442120444357790374.gal : 17 ms
[2024-05-25 13:31:44] [INFO ] Time to serialize properties into /tmp/LTLFireability11206193265309203502.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/LTLFireability14442120444357790374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11206193265309203502.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...278
Read 1 LTL properties
Checking formula 0 : !((G("(((i0.u1.l2<1)||(i0.u1.x0_CLOSED_q8<1))||(i0.u1.ch1_PENDING_q3<1))")))
Formula 0 simplified : F!"(((i0.u1.l2<1)||(i0.u1.x0_CLOSED_q8<1))||(i0.u1.ch1_PENDING_q3<1))"
Compilation finished in 6586 ms.
Running link step : cd /tmp/ltsmin5342484868429602122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 261 ms.
Running LTSmin : cd /tmp/ltsmin5342484868429602122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp0==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 13:52:38] [INFO ] Flatten gal took : 336 ms
[2024-05-25 13:52:38] [INFO ] Time to serialize gal into /tmp/LTLFireability2410708164516539196.gal : 58 ms
[2024-05-25 13:52:38] [INFO ] Time to serialize properties into /tmp/LTLFireability6985927108835347456.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/LTLFireability2410708164516539196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6985927108835347456.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...297
Read 1 LTL properties
Checking formula 0 : !((G("(((l2<1)||(x0_CLOSED_q8<1))||(ch1_PENDING_q3<1))")))
Formula 0 simplified : F!"(((l2<1)||(x0_CLOSED_q8<1))||(ch1_PENDING_q3<1))"
Detected timeout of ITS tools.
[2024-05-25 14:13:32] [INFO ] Flatten gal took : 271 ms
[2024-05-25 14:13:32] [INFO ] Input system was already deterministic with 2750 transitions.
[2024-05-25 14:13:32] [INFO ] Transformed 237 places.
[2024-05-25 14:13:32] [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:13:33] [INFO ] Time to serialize gal into /tmp/LTLFireability5826129232971464186.gal : 38 ms
[2024-05-25 14:13:33] [INFO ] Time to serialize properties into /tmp/LTLFireability7550384693046298640.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/LTLFireability5826129232971464186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7550384693046298640.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G("(((l2<1)||(x0_CLOSED_q8<1))||(ch1_PENDING_q3<1))")))
Formula 0 simplified : F!"(((l2<1)||(x0_CLOSED_q8<1))||(ch1_PENDING_q3<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6772000 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16024180 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-q3m128"
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-q3m128, 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-171620414700233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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