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-171620414700227.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-q3m064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700227
=====================================================================

--------------------
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 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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-q3m064-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m064-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716642863982

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m064
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 13:14:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 13:14:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:14:27] [INFO ] Load time of PNML (sax parser for PT used): 909 ms
[2024-05-25 13:14:27] [INFO ] Transformed 754 places.
[2024-05-25 13:14:27] [INFO ] Transformed 27370 transitions.
[2024-05-25 13:14:27] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 514 places in 124 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 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 92 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-25 13:14:27] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:14:27] [INFO ] Computed 8 invariants in 74 ms
[2024-05-25 13:14:28] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-25 13:14:28] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:14:28] [INFO ] Invariant cache hit.
[2024-05-25 13:14:28] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:14:30] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
[2024-05-25 13:14:30] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:14:30] [INFO ] Invariant cache hit.
[2024-05-25 13:14:31] [INFO ] Dead Transitions using invariants and state equation in 973 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 4440 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 3 out of 237 places after structural reductions.
[2024-05-25 13:14:32] [INFO ] Flatten gal took : 256 ms
[2024-05-25 13:14:32] [INFO ] Flatten gal took : 160 ms
[2024-05-25 13:14:32] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10044 steps, including 12 resets, run finished after 233 ms. (steps per millisecond=43 ) 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 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 149906 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149906 steps, saw 74604 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 13:14:36] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:14:36] [INFO ] Invariant cache hit.
[2024-05-25 13:14:36] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:14:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:14:36] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 13:14:36] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:14:37] [INFO ] After 276ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-25 13:14:37] [INFO ] Deduced a trap composed of 23 places in 383 ms of which 18 ms to minimize.
[2024-05-25 13:14:38] [INFO ] Deduced a trap composed of 41 places in 565 ms of which 2 ms to minimize.
[2024-05-25 13:14:39] [INFO ] Deduced a trap composed of 73 places in 781 ms of which 1 ms to minimize.
[2024-05-25 13:14:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2015 ms
[2024-05-25 13:14:39] [INFO ] After 2517ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-25 13:14:39] [INFO ] After 3208ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 2 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 214 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 217 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 130490 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130490 steps, saw 50986 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:14:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:14:42] [INFO ] Computed 8 invariants in 20 ms
[2024-05-25 13:14:43] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:14:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:14:43] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:14:43] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:14:43] [INFO ] After 259ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 13:14:44] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 2 ms to minimize.
[2024-05-25 13:14:44] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 1 ms to minimize.
[2024-05-25 13:14:44] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 1 ms to minimize.
[2024-05-25 13:14:45] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 1 ms to minimize.
[2024-05-25 13:14:45] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 0 ms to minimize.
[2024-05-25 13:14:45] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 0 ms to minimize.
[2024-05-25 13:14:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2047 ms
[2024-05-25 13:14:46] [INFO ] After 2488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2024-05-25 13:14:46] [INFO ] After 3239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 2 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 67 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 67 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 65 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:14:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:14:46] [INFO ] Invariant cache hit.
[2024-05-25 13:14:46] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-25 13:14:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:14:46] [INFO ] Invariant cache hit.
[2024-05-25 13:14:47] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:14:48] [INFO ] Implicit Places using invariants and state equation in 1988 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2024-05-25 13:14:49] [INFO ] Redundant transitions in 297 ms returned []
[2024-05-25 13:14:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:14:49] [INFO ] Invariant cache hit.
[2024-05-25 13:14:50] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3629 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 360 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:14:50] [INFO ] Computed 9 invariants in 38 ms
[2024-05-25 13:14:50] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 13:14:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:14:50] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 13:14:51] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 111 ms.
[2024-05-25 13:14:51] [INFO ] After 732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q3m064-LTLCardinality-09 TRUE 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' '!(F(G((p0||X(p0)))))'
Support contains 1 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 12 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2024-05-25 13:14:51] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:14:51] [INFO ] Computed 8 invariants in 13 ms
[2024-05-25 13:14:51] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-25 13:14:51] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:14:51] [INFO ] Invariant cache hit.
[2024-05-25 13:14:52] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:14:53] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 2591 ms to find 0 implicit places.
[2024-05-25 13:14:53] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:14:53] [INFO ] Invariant cache hit.
[2024-05-25 13:14:54] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3461 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 213 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m064-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 s175)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 86 reset in 726 ms.
Product exploration explored 100000 steps with 86 reset in 638 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199181 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199181 steps, saw 98544 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:14:59] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:14:59] [INFO ] Invariant cache hit.
[2024-05-25 13:14:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:15:00] [INFO ] After 538ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:15:00] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:15:00] [INFO ] After 111ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:15:00] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:15:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:15:01] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:15:01] [INFO ] After 122ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:15:01] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-25 13:15:01] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 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 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
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 154 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 155 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10048 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=913 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 209725 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209725 steps, saw 103398 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:15:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:15:04] [INFO ] Computed 8 invariants in 33 ms
[2024-05-25 13:15:04] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:15:05] [INFO ] After 492ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:15:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:15:05] [INFO ] After 108ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:15:05] [INFO ] After 721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:15:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:15:05] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:15:06] [INFO ] After 167ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:15:06] [INFO ] After 278ms 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:15:06] [INFO ] After 901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 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 41 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 41 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 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:15:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:15:06] [INFO ] Invariant cache hit.
[2024-05-25 13:15:06] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-25 13:15:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:15:06] [INFO ] Invariant cache hit.
[2024-05-25 13:15:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:15:08] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
[2024-05-25 13:15:08] [INFO ] Redundant transitions in 151 ms returned []
[2024-05-25 13:15:08] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:15:08] [INFO ] Invariant cache hit.
[2024-05-25 13:15:09] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3347 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 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 227 transition count 2615
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 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 256 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:15:09] [INFO ] Computed 9 invariants in 27 ms
[2024-05-25 13:15:10] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 13:15:10] [INFO ] After 490ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:15:10] [INFO ] After 603ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-25 13:15:10] [INFO ] After 753ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Support contains 1 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 10 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2024-05-25 13:15:11] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:15:11] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:15:11] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-25 13:15:11] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:15:11] [INFO ] Invariant cache hit.
[2024-05-25 13:15:12] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:15:13] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
[2024-05-25 13:15:13] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:15:13] [INFO ] Invariant cache hit.
[2024-05-25 13:15:14] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3417 ms. Remains : 237/237 places, 2750/2750 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (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 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199228 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199228 steps, saw 98567 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:15:17] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:15:17] [INFO ] Invariant cache hit.
[2024-05-25 13:15:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:15:18] [INFO ] After 527ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:15:18] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:15:18] [INFO ] After 116ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:15:18] [INFO ] After 733ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:15:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:15:19] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:15:19] [INFO ] After 158ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:15:19] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-25 13:15:19] [INFO ] After 1048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 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 136 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 137 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 194018 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194018 steps, saw 93430 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:15:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:15:22] [INFO ] Computed 8 invariants in 15 ms
[2024-05-25 13:15:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:15:23] [INFO ] After 516ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:15:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:15:23] [INFO ] After 94ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:15:23] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:15:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:15:24] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:15:24] [INFO ] After 169ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:15:24] [INFO ] After 294ms 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:15:24] [INFO ] After 938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 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 45 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 46 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 45 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:15:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:15:24] [INFO ] Invariant cache hit.
[2024-05-25 13:15:24] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-25 13:15:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:15:24] [INFO ] Invariant cache hit.
[2024-05-25 13:15:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:15:27] [INFO ] Implicit Places using invariants and state equation in 2328 ms returned []
Implicit Place search using SMT with State Equation took 2722 ms to find 0 implicit places.
[2024-05-25 13:15:27] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-25 13:15:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:15:27] [INFO ] Invariant cache hit.
[2024-05-25 13:15:28] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4117 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 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 227 transition count 2615
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 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 375 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:15:29] [INFO ] Computed 9 invariants in 11 ms
[2024-05-25 13:15:29] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 13:15:29] [INFO ] After 503ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:15:29] [INFO ] After 578ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-25 13:15:29] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 86 reset in 792 ms.
Product exploration explored 100000 steps with 86 reset in 655 ms.
Built C files in :
/tmp/ltsmin8611576450758346593
[2024-05-25 13:15:31] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8611576450758346593
Running compilation step : cd /tmp/ltsmin8611576450758346593;'/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/ltsmin8611576450758346593;'/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/ltsmin8611576450758346593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 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 10 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2024-05-25 13:15:34] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:15:34] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 13:15:35] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-25 13:15:35] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:15:35] [INFO ] Invariant cache hit.
[2024-05-25 13:15:35] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:15:37] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2562 ms to find 0 implicit places.
[2024-05-25 13:15:37] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:15:37] [INFO ] Invariant cache hit.
[2024-05-25 13:15:38] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3539 ms. Remains : 237/237 places, 2750/2750 transitions.
Built C files in :
/tmp/ltsmin2096690002972770210
[2024-05-25 13:15:38] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2096690002972770210
Running compilation step : cd /tmp/ltsmin2096690002972770210;'/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/ltsmin2096690002972770210;'/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/ltsmin2096690002972770210;'/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:15:41] [INFO ] Flatten gal took : 169 ms
[2024-05-25 13:15:42] [INFO ] Flatten gal took : 170 ms
[2024-05-25 13:15:42] [INFO ] Time to serialize gal into /tmp/LTL3783020897039397464.gal : 26 ms
[2024-05-25 13:15:42] [INFO ] Time to serialize properties into /tmp/LTL6742223811142654690.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3783020897039397464.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17326615344917373055.hoa' '-atoms' '/tmp/LTL6742223811142654690.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...318
Loading property file /tmp/LTL6742223811142654690.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17326615344917373055.hoa
Detected timeout of ITS tools.
[2024-05-25 13:15:57] [INFO ] Flatten gal took : 119 ms
[2024-05-25 13:15:57] [INFO ] Flatten gal took : 137 ms
[2024-05-25 13:15:57] [INFO ] Time to serialize gal into /tmp/LTL7111320877582107221.gal : 19 ms
[2024-05-25 13:15:57] [INFO ] Time to serialize properties into /tmp/LTL6399410779045949643.ltl : 5 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/LTL7111320877582107221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6399410779045949643.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 : !((F(G(("(ch1_PENDING_q5<1)")||(X("(ch1_PENDING_q5<1)"))))))
Formula 0 simplified : GF(!"(ch1_PENDING_q5<1)" & X!"(ch1_PENDING_q5<1)")
Detected timeout of ITS tools.
[2024-05-25 13:16:12] [INFO ] Flatten gal took : 115 ms
[2024-05-25 13:16:12] [INFO ] Applying decomposition
[2024-05-25 13:16:12] [INFO ] Flatten gal took : 142 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/graph340063213011112602.txt' '-o' '/tmp/graph340063213011112602.bin' '-w' '/tmp/graph340063213011112602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph340063213011112602.bin' '-l' '-1' '-v' '-w' '/tmp/graph340063213011112602.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:16:13] [INFO ] Decomposing Gal with order
[2024-05-25 13:16:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:16:13] [INFO ] Removed a total of 334 redundant transitions.
[2024-05-25 13:16:13] [INFO ] Flatten gal took : 304 ms
[2024-05-25 13:16:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 33 ms.
[2024-05-25 13:16:13] [INFO ] Time to serialize gal into /tmp/LTL7937026686012665148.gal : 51 ms
[2024-05-25 13:16:13] [INFO ] Time to serialize properties into /tmp/LTL1864737680425492214.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/LTL7937026686012665148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1864737680425492214.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i0.u1.ch1_PENDING_q5<1)")||(X("(i0.u1.ch1_PENDING_q5<1)"))))))
Formula 0 simplified : GF(!"(i0.u1.ch1_PENDING_q5<1)" & X!"(i0.u1.ch1_PENDING_q5<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10058686157513344539
[2024-05-25 13:16:29] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10058686157513344539
Running compilation step : cd /tmp/ltsmin10058686157513344539;'/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/ltsmin10058686157513344539;'/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/ltsmin10058686157513344539;'/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-q3m064-LTLCardinality-12 finished in 100858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p0)))))'
Found a Lengthening insensitive property : BugTracking-PT-q3m064-LTLCardinality-12
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in LI_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 59 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2024-05-25 13:16:32] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:16:32] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 13:16:32] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-25 13:16:32] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:16:32] [INFO ] Invariant cache hit.
[2024-05-25 13:16:33] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:16:35] [INFO ] Implicit Places using invariants and state equation in 2211 ms returned []
Implicit Place search using SMT with State Equation took 2649 ms to find 0 implicit places.
[2024-05-25 13:16:35] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:16:35] [INFO ] Invariant cache hit.
[2024-05-25 13:16:35] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3583 ms. Remains : 235/237 places, 2753/2750 transitions.
Running random walk in product with property : BugTracking-PT-q3m064-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 s173)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 87 reset in 682 ms.
Product exploration explored 100000 steps with 88 reset in 686 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 198273 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198273 steps, saw 98660 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:16:40] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:16:40] [INFO ] Invariant cache hit.
[2024-05-25 13:16:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:16:41] [INFO ] After 486ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:16:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:16:41] [INFO ] After 105ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:16:41] [INFO ] After 677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:16:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:16:42] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:16:42] [INFO ] After 164ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:16:42] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-25 13:16:42] [INFO ] After 1096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 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 107 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 10027 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187602 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187602 steps, saw 89263 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:16:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:16:45] [INFO ] Computed 8 invariants in 20 ms
[2024-05-25 13:16:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:16:46] [INFO ] After 558ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:16:46] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:16:46] [INFO ] After 101ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:16:46] [INFO ] After 748ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:16:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:16:46] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:16:46] [INFO ] After 112ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:16:47] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-25 13:16:47] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 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 31 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 31 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 31 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:16:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:16:47] [INFO ] Invariant cache hit.
[2024-05-25 13:16:47] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-25 13:16:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:16:47] [INFO ] Invariant cache hit.
[2024-05-25 13:16:47] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:16:49] [INFO ] Implicit Places using invariants and state equation in 2092 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
[2024-05-25 13:16:49] [INFO ] Redundant transitions in 58 ms returned []
[2024-05-25 13:16:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:16:49] [INFO ] Invariant cache hit.
[2024-05-25 13:16:50] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3474 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 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 227 transition count 2615
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 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 276 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:16:50] [INFO ] Computed 9 invariants in 36 ms
[2024-05-25 13:16:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:16:51] [INFO ] After 416ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:16:51] [INFO ] After 486ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-25 13:16:51] [INFO ] After 588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 11 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2024-05-25 13:16:51] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:16:51] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 13:16:52] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-25 13:16:52] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:16:52] [INFO ] Invariant cache hit.
[2024-05-25 13:16:52] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:16:53] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2161 ms to find 0 implicit places.
[2024-05-25 13:16:53] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:16:53] [INFO ] Invariant cache hit.
[2024-05-25 13:16:54] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3001 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10051 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=295 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 184998 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184998 steps, saw 92069 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:16:58] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:16:58] [INFO ] Invariant cache hit.
[2024-05-25 13:16:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:16:58] [INFO ] After 506ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:16:58] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:16:58] [INFO ] After 101ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:16:58] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:16:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:16:59] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:16:59] [INFO ] After 148ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:16:59] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-25 13:16:59] [INFO ] After 958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 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 126 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 127 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193259 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193259 steps, saw 92948 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:17:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:17:02] [INFO ] Computed 8 invariants in 18 ms
[2024-05-25 13:17:03] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:17:04] [INFO ] After 1002ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:17:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:17:04] [INFO ] After 147ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:17:04] [INFO ] After 1277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:17:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:17:04] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:17:04] [INFO ] After 152ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:17:05] [INFO ] After 265ms 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:17:05] [INFO ] After 877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 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 68 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 68 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 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:17:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:17:05] [INFO ] Invariant cache hit.
[2024-05-25 13:17:05] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-25 13:17:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:17:05] [INFO ] Invariant cache hit.
[2024-05-25 13:17:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:17:07] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
[2024-05-25 13:17:07] [INFO ] Redundant transitions in 87 ms returned []
[2024-05-25 13:17:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:17:07] [INFO ] Invariant cache hit.
[2024-05-25 13:17:09] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3930 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 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 227 transition count 2615
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 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 457 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:17:09] [INFO ] Computed 9 invariants in 21 ms
[2024-05-25 13:17:09] [INFO ] [Real]Absence check using 9 positive place invariants in 29 ms returned sat
[2024-05-25 13:17:10] [INFO ] After 673ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:17:10] [INFO ] After 794ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-25 13:17:10] [INFO ] After 1032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 88 reset in 598 ms.
Product exploration explored 100000 steps with 89 reset in 630 ms.
Built C files in :
/tmp/ltsmin17492402843562562825
[2024-05-25 13:17:12] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17492402843562562825
Running compilation step : cd /tmp/ltsmin17492402843562562825;'/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/ltsmin17492402843562562825;'/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/ltsmin17492402843562562825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 23 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2024-05-25 13:17:15] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:17:15] [INFO ] Computed 8 invariants in 14 ms
[2024-05-25 13:17:15] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-25 13:17:15] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:17:15] [INFO ] Invariant cache hit.
[2024-05-25 13:17:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:17:17] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2152 ms to find 0 implicit places.
[2024-05-25 13:17:17] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:17:17] [INFO ] Invariant cache hit.
[2024-05-25 13:17:18] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3000 ms. Remains : 235/235 places, 2753/2753 transitions.
Built C files in :
/tmp/ltsmin8770564925193408820
[2024-05-25 13:17:18] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8770564925193408820
Running compilation step : cd /tmp/ltsmin8770564925193408820;'/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/ltsmin8770564925193408820;'/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/ltsmin8770564925193408820;'/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:17:21] [INFO ] Flatten gal took : 130 ms
[2024-05-25 13:17:21] [INFO ] Flatten gal took : 137 ms
[2024-05-25 13:17:21] [INFO ] Time to serialize gal into /tmp/LTL12613293367534657790.gal : 23 ms
[2024-05-25 13:17:21] [INFO ] Time to serialize properties into /tmp/LTL3091100517108510887.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12613293367534657790.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15238474627186966652.hoa' '-atoms' '/tmp/LTL3091100517108510887.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/LTL3091100517108510887.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15238474627186966652.hoa
Detected timeout of ITS tools.
[2024-05-25 13:17:37] [INFO ] Flatten gal took : 144 ms
[2024-05-25 13:17:37] [INFO ] Flatten gal took : 150 ms
[2024-05-25 13:17:37] [INFO ] Time to serialize gal into /tmp/LTL9114665482333135313.gal : 24 ms
[2024-05-25 13:17:37] [INFO ] Time to serialize properties into /tmp/LTL12980485133377697789.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/LTL9114665482333135313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12980485133377697789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(ch1_PENDING_q5<1)")||(X("(ch1_PENDING_q5<1)"))))))
Formula 0 simplified : GF(!"(ch1_PENDING_q5<1)" & X!"(ch1_PENDING_q5<1)")
Detected timeout of ITS tools.
[2024-05-25 13:17:52] [INFO ] Flatten gal took : 262 ms
[2024-05-25 13:17:52] [INFO ] Applying decomposition
[2024-05-25 13:17:52] [INFO ] Flatten gal took : 124 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/graph8227159429214900522.txt' '-o' '/tmp/graph8227159429214900522.bin' '-w' '/tmp/graph8227159429214900522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8227159429214900522.bin' '-l' '-1' '-v' '-w' '/tmp/graph8227159429214900522.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:17:53] [INFO ] Decomposing Gal with order
[2024-05-25 13:17:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:17:53] [INFO ] Removed a total of 346 redundant transitions.
[2024-05-25 13:17:53] [INFO ] Flatten gal took : 188 ms
[2024-05-25 13:17:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 18 ms.
[2024-05-25 13:17:53] [INFO ] Time to serialize gal into /tmp/LTL14402278319703987335.gal : 21 ms
[2024-05-25 13:17:53] [INFO ] Time to serialize properties into /tmp/LTL17058743513274047756.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/LTL14402278319703987335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17058743513274047756.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 : !((F(G(("(i1.u1.ch1_PENDING_q5<1)")||(X("(i1.u1.ch1_PENDING_q5<1)"))))))
Formula 0 simplified : GF(!"(i1.u1.ch1_PENDING_q5<1)" & X!"(i1.u1.ch1_PENDING_q5<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11466337488910236465
[2024-05-25 13:18:08] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11466337488910236465
Running compilation step : cd /tmp/ltsmin11466337488910236465;'/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/ltsmin11466337488910236465;'/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/ltsmin11466337488910236465;'/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-q3m064-LTLCardinality-12 finished in 99561 ms.
[2024-05-25 13:18:11] [INFO ] Flatten gal took : 185 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9553358973758864733
[2024-05-25 13:18:11] [INFO ] Too many transitions (2750) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:18:12] [INFO ] Applying decomposition
[2024-05-25 13:18:12] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9553358973758864733
Running compilation step : cd /tmp/ltsmin9553358973758864733;'/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:18:12] [INFO ] Flatten gal took : 145 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/graph5837389920976078594.txt' '-o' '/tmp/graph5837389920976078594.bin' '-w' '/tmp/graph5837389920976078594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5837389920976078594.bin' '-l' '-1' '-v' '-w' '/tmp/graph5837389920976078594.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:18:12] [INFO ] Decomposing Gal with order
[2024-05-25 13:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:18:12] [INFO ] Removed a total of 334 redundant transitions.
[2024-05-25 13:18:12] [INFO ] Flatten gal took : 180 ms
[2024-05-25 13:18:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 9 ms.
[2024-05-25 13:18:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality1912498954348571206.gal : 23 ms
[2024-05-25 13:18:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality17549099464049673510.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/LTLCardinality1912498954348571206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17549099464049673510.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 : !((F(G(("(i0.u1.ch1_PENDING_q5<1)")||(X("(i0.u1.ch1_PENDING_q5<1)"))))))
Formula 0 simplified : GF(!"(i0.u1.ch1_PENDING_q5<1)" & X!"(i0.u1.ch1_PENDING_q5<1)")
Compilation finished in 7058 ms.
Running link step : cd /tmp/ltsmin9553358973758864733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin9553358973758864733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 13:39:29] [INFO ] Flatten gal took : 355 ms
[2024-05-25 13:39:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality9742337686922719968.gal : 46 ms
[2024-05-25 13:39:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality4127378413463103523.ltl : 10 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/LTLCardinality9742337686922719968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4127378413463103523.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 : !((F(G(("(ch1_PENDING_q5<1)")||(X("(ch1_PENDING_q5<1)"))))))
Formula 0 simplified : GF(!"(ch1_PENDING_q5<1)" & X!"(ch1_PENDING_q5<1)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: LTL layer: formula: <>([](((LTLAPp0==true)||X((LTLAPp0==true)))))
pins2lts-mc-linux64( 6/ 8), 0.012: "<>([](((LTLAPp0==true)||X((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.013: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.484: There are 2752 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.484: State length is 238, there are 2756 groups
pins2lts-mc-linux64( 0/ 8), 0.484: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.484: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.484: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.484: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.755: [Blue] ~116 levels ~960 states ~2632 transitions
pins2lts-mc-linux64( 6/ 8), 0.892: [Blue] ~170 levels ~1920 states ~4840 transitions
pins2lts-mc-linux64( 6/ 8), 1.130: [Blue] ~172 levels ~3840 states ~9968 transitions
pins2lts-mc-linux64( 6/ 8), 1.575: [Blue] ~172 levels ~7680 states ~21272 transitions
pins2lts-mc-linux64( 6/ 8), 2.719: [Blue] ~172 levels ~15360 states ~42288 transitions
pins2lts-mc-linux64( 6/ 8), 4.485: [Blue] ~177 levels ~30720 states ~86408 transitions
pins2lts-mc-linux64( 6/ 8), 8.891: [Blue] ~177 levels ~61440 states ~175176 transitions
pins2lts-mc-linux64( 6/ 8), 16.337: [Blue] ~177 levels ~122880 states ~367528 transitions
pins2lts-mc-linux64( 6/ 8), 30.935: [Blue] ~177 levels ~245760 states ~790848 transitions
pins2lts-mc-linux64( 6/ 8), 59.857: [Blue] ~177 levels ~491520 states ~1584696 transitions
pins2lts-mc-linux64( 6/ 8), 104.936: [Blue] ~238 levels ~983040 states ~3246984 transitions
pins2lts-mc-linux64( 6/ 8), 163.732: [Blue] ~238 levels ~1966080 states ~6794536 transitions
pins2lts-mc-linux64( 0/ 8), 268.885: [Blue] ~8796 levels ~3932160 states ~10739240 transitions
pins2lts-mc-linux64( 1/ 8), 471.212: [Blue] ~839393 levels ~7864320 states ~16259016 transitions
pins2lts-mc-linux64( 1/ 8), 872.672: [Blue] ~1678843 levels ~15728640 states ~32517872 transitions
pins2lts-mc-linux64( 1/ 8), 1687.710: [Blue] ~3357745 levels ~31457280 states ~65035496 transitions
pins2lts-mc-linux64( 4/ 8), 1772.370: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1772.447:
pins2lts-mc-linux64( 0/ 8), 1772.447: Explored 28688685 states 72840804 transitions, fanout: 2.539
pins2lts-mc-linux64( 0/ 8), 1772.447: Total exploration time 1771.930 sec (1771.850 sec minimum, 1771.878 sec on average)
pins2lts-mc-linux64( 0/ 8), 1772.447: States per second: 16191, Transitions per second: 41108
pins2lts-mc-linux64( 0/ 8), 1772.447:
pins2lts-mc-linux64( 0/ 8), 1772.447: State space has 48907289 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1772.447: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1772.447: blue states: 28688685 (58.66%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1772.447: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1772.447: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1772.447:
pins2lts-mc-linux64( 0/ 8), 1772.447: Total memory used for local state coloring: 289.0MB
pins2lts-mc-linux64( 0/ 8), 1772.447:
pins2lts-mc-linux64( 0/ 8), 1772.447: Queue width: 8B, total height: 18942833, memory: 144.52MB
pins2lts-mc-linux64( 0/ 8), 1772.447: Tree memory: 629.1MB, 13.5 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 1772.447: Tree fill ratio (roots/leafs): 36.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1772.447: Stored 2812 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1772.447: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1772.447: Est. total memory use: 773.7MB (~1168.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9553358973758864733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9553358973758864733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 14:00:45] [INFO ] Flatten gal took : 180 ms
[2024-05-25 14:00:45] [INFO ] Input system was already deterministic with 2750 transitions.
[2024-05-25 14:00:45] [INFO ] Transformed 237 places.
[2024-05-25 14:00:45] [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:00:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality10573792056675836463.gal : 27 ms
[2024-05-25 14:00:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality11587750872643665577.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/LTLCardinality10573792056675836463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11587750872643665577.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(ch1_PENDING_q5<1)")||(X("(ch1_PENDING_q5<1)"))))))
Formula 0 simplified : GF(!"(ch1_PENDING_q5<1)" & X!"(ch1_PENDING_q5<1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 742952 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16025012 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m064"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BugTracking-PT-q3m064, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414700227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m064.tgz
mv BugTracking-PT-q3m064 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;