Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694600371.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q3m128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.0K Feb 26 07:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 07:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 07:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 07:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678631322920

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m128
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:28:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:28:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:28:45] [INFO ] Load time of PNML (sax parser for PT used): 726 ms
[2023-03-12 14:28:45] [INFO ] Transformed 754 places.
[2023-03-12 14:28:45] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:28:45] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 965 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 110 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q3m128-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 67 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-12 14:28:45] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:28:45] [INFO ] Computed 8 place invariants in 35 ms
[2023-03-12 14:28:46] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-12 14:28:46] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:28:46] [INFO ] Invariant cache hit.
[2023-03-12 14:28:47] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:28:48] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
[2023-03-12 14:28:48] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:28:48] [INFO ] Invariant cache hit.
[2023-03-12 14:28:49] [INFO ] Dead Transitions using invariants and state equation in 1108 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 3544 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 8 out of 237 places after structural reductions.
[2023-03-12 14:28:50] [INFO ] Flatten gal took : 333 ms
[2023-03-12 14:28:50] [INFO ] Flatten gal took : 188 ms
[2023-03-12 14:28:50] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 7 out of 237 places (down from 8) after GAL structural reductions.
Incomplete random walk after 10068 steps, including 7 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 59973 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59973 steps, saw 28705 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 14:28:54] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:28:54] [INFO ] Invariant cache hit.
[2023-03-12 14:28:54] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:28:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:28:55] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 14:28:55] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:28:56] [INFO ] After 693ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 14:28:56] [INFO ] Deduced a trap composed of 12 places in 372 ms of which 7 ms to minimize.
[2023-03-12 14:28:57] [INFO ] Deduced a trap composed of 8 places in 564 ms of which 1 ms to minimize.
[2023-03-12 14:28:58] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 1 ms to minimize.
[2023-03-12 14:28:58] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 1 ms to minimize.
[2023-03-12 14:28:58] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 2 ms to minimize.
[2023-03-12 14:28:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2278 ms
[2023-03-12 14:28:59] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-12 14:28:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 258 ms
[2023-03-12 14:28:59] [INFO ] Deduced a trap composed of 48 places in 413 ms of which 0 ms to minimize.
[2023-03-12 14:29:00] [INFO ] Deduced a trap composed of 54 places in 350 ms of which 1 ms to minimize.
[2023-03-12 14:29:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 972 ms
[2023-03-12 14:29:00] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 0 ms to minimize.
[2023-03-12 14:29:01] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 1 ms to minimize.
[2023-03-12 14:29:01] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 1 ms to minimize.
[2023-03-12 14:29:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1145 ms
[2023-03-12 14:29:01] [INFO ] After 5755ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-12 14:29:01] [INFO ] After 7153ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 290 ms.
Support contains 5 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 15 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 405 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 406 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10118 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=210 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 95029 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95029 steps, saw 36081 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:29:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:29:06] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-12 14:29:06] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:29:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:29:08] [INFO ] After 1889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:29:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:08] [INFO ] After 393ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:29:08] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 1 ms to minimize.
[2023-03-12 14:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-12 14:29:09] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2023-03-12 14:29:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-12 14:29:09] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-12 14:29:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-12 14:29:09] [INFO ] After 1580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 275 ms.
[2023-03-12 14:29:10] [INFO ] After 3862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 5 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 48 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 49 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.
[2023-03-12 14:29:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:29:10] [INFO ] Invariant cache hit.
[2023-03-12 14:29:10] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-12 14:29:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:29:10] [INFO ] Invariant cache hit.
[2023-03-12 14:29:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:12] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2200 ms to find 0 implicit places.
[2023-03-12 14:29:12] [INFO ] Redundant transitions in 252 ms returned []
[2023-03-12 14:29:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:29:12] [INFO ] Invariant cache hit.
[2023-03-12 14:29:13] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3559 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 3 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 452 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:29:14] [INFO ] Computed 9 place invariants in 27 ms
[2023-03-12 14:29:14] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:29:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:29:15] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:29:15] [INFO ] After 1060ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-12 14:29:15] [INFO ] After 1355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
FORMULA BugTracking-PT-q3m128-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 15 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 14:29:15] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:29:15] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 14:29:16] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-12 14:29:16] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:29:16] [INFO ] Invariant cache hit.
[2023-03-12 14:29:16] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:29:18] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2023-03-12 14:29:18] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:29:18] [INFO ] Invariant cache hit.
[2023-03-12 14:29:18] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3023 ms. Remains : 237/237 places, 2750/2750 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BugTracking-PT-q3m128-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1148 ms.
Product exploration explored 100000 steps with 50000 reset in 964 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BugTracking-PT-q3m128-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q3m128-LTLCardinality-06 finished in 5513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 117 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 14:29:21] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:29:21] [INFO ] Computed 8 place invariants in 32 ms
[2023-03-12 14:29:21] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-12 14:29:21] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:21] [INFO ] Invariant cache hit.
[2023-03-12 14:29:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:23] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 2262 ms to find 0 implicit places.
[2023-03-12 14:29:23] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-12 14:29:23] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:23] [INFO ] Invariant cache hit.
[2023-03-12 14:29:24] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3434 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m128-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s164)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1866 steps with 0 reset in 51 ms.
FORMULA BugTracking-PT-q3m128-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m128-LTLCardinality-07 finished in 3562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 49 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 14:29:24] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:24] [INFO ] Invariant cache hit.
[2023-03-12 14:29:25] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-12 14:29:25] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:25] [INFO ] Invariant cache hit.
[2023-03-12 14:29:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:26] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2023-03-12 14:29:26] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-12 14:29:26] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:26] [INFO ] Invariant cache hit.
[2023-03-12 14:29:27] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2992 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m128-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s45 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 44 reset in 600 ms.
Product exploration explored 100000 steps with 46 reset in 630 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 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10125 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187048 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187048 steps, saw 90682 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:29:32] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:32] [INFO ] Invariant cache hit.
[2023-03-12 14:29:32] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:29:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:29:32] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:33] [INFO ] After 184ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:33] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 1 ms to minimize.
[2023-03-12 14:29:33] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 0 ms to minimize.
[2023-03-12 14:29:34] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2023-03-12 14:29:34] [INFO ] Deduced a trap composed of 18 places in 330 ms of which 1 ms to minimize.
[2023-03-12 14:29:34] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 1 ms to minimize.
[2023-03-12 14:29:35] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 1 ms to minimize.
[2023-03-12 14:29:35] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 1 ms to minimize.
[2023-03-12 14:29:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2275 ms
[2023-03-12 14:29:35] [INFO ] After 2527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 14:29:35] [INFO ] After 3074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 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 138 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 139 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10026 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 180775 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180775 steps, saw 88168 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:29:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:29:38] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 14:29:38] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:29:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:29:39] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:39] [INFO ] After 189ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:40] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
[2023-03-12 14:29:40] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 0 ms to minimize.
[2023-03-12 14:29:40] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2023-03-12 14:29:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1031 ms
[2023-03-12 14:29:40] [INFO ] After 1279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-12 14:29:40] [INFO ] After 1944ms 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 87 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 87 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 78 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:29:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:29:41] [INFO ] Invariant cache hit.
[2023-03-12 14:29:41] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-12 14:29:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:29:41] [INFO ] Invariant cache hit.
[2023-03-12 14:29:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:42] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
[2023-03-12 14:29:43] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-12 14:29:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:29:43] [INFO ] Invariant cache hit.
[2023-03-12 14:29:44] [INFO ] Dead Transitions using invariants and state equation in 1368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3510 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 394 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
[2023-03-12 14:29:44] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-12 14:29:44] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:29:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:29:45] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:45] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-12 14:29:45] [INFO ] After 751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 64 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:29:46] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:29:46] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 14:29:46] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-12 14:29:46] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:46] [INFO ] Invariant cache hit.
[2023-03-12 14:29:46] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:48] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
[2023-03-12 14:29:48] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-12 14:29:48] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:48] [INFO ] Invariant cache hit.
[2023-03-12 14:29:49] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3064 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 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 189006 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 189006 steps, saw 91657 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:29:52] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:29:52] [INFO ] Invariant cache hit.
[2023-03-12 14:29:52] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:29:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:29:52] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:52] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:53] [INFO ] After 206ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:53] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 1 ms to minimize.
[2023-03-12 14:29:53] [INFO ] Deduced a trap composed of 63 places in 288 ms of which 0 ms to minimize.
[2023-03-12 14:29:54] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 0 ms to minimize.
[2023-03-12 14:29:54] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 2 ms to minimize.
[2023-03-12 14:29:54] [INFO ] Deduced a trap composed of 69 places in 265 ms of which 3 ms to minimize.
[2023-03-12 14:29:55] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 1 ms to minimize.
[2023-03-12 14:29:55] [INFO ] Deduced a trap composed of 51 places in 234 ms of which 0 ms to minimize.
[2023-03-12 14:29:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2296 ms
[2023-03-12 14:29:55] [INFO ] After 2595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-12 14:29:55] [INFO ] After 3314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 62 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 147 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 147 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10028 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=771 ) 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 191868 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191868 steps, saw 95556 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:29:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:29:58] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-12 14:29:58] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:29:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:29:59] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:29:59] [INFO ] After 154ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:59] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 0 ms to minimize.
[2023-03-12 14:30:00] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 2 ms to minimize.
[2023-03-12 14:30:00] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 0 ms to minimize.
[2023-03-12 14:30:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 930 ms
[2023-03-12 14:30:00] [INFO ] After 1135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-12 14:30:00] [INFO ] After 1746ms 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 57 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 57 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 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:30:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:30:00] [INFO ] Invariant cache hit.
[2023-03-12 14:30:01] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-12 14:30:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:30:01] [INFO ] Invariant cache hit.
[2023-03-12 14:30:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:30:02] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2023-03-12 14:30:02] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-12 14:30:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:30:02] [INFO ] Invariant cache hit.
[2023-03-12 14:30:03] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3130 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 281 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
[2023-03-12 14:30:04] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-12 14:30:04] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:30:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:30:04] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:30:05] [INFO ] After 679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-12 14:30:05] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 46 reset in 761 ms.
Product exploration explored 100000 steps with 44 reset in 627 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 32 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:30:06] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:30:06] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 14:30:07] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-12 14:30:07] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:30:07] [INFO ] Invariant cache hit.
[2023-03-12 14:30:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:30:08] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2023-03-12 14:30:08] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-12 14:30:08] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:30:08] [INFO ] Invariant cache hit.
[2023-03-12 14:30:09] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3208 ms. Remains : 235/235 places, 2753/2753 transitions.
Treatment of property BugTracking-PT-q3m128-LTLCardinality-13 finished in 45652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 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.
[2023-03-12 14:30:10] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:30:10] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-12 14:30:10] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-12 14:30:10] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:30:10] [INFO ] Invariant cache hit.
[2023-03-12 14:30:11] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:30:12] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
[2023-03-12 14:30:12] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:30:12] [INFO ] Invariant cache hit.
[2023-03-12 14:30:13] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2999 ms. Remains : 237/237 places, 2750/2750 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BugTracking-PT-q3m128-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s223 s61)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1114 ms.
Product exploration explored 100000 steps with 50000 reset in 906 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BugTracking-PT-q3m128-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q3m128-LTLCardinality-14 finished in 5280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-12 14:30:16] [INFO ] Flatten gal took : 147 ms
[2023-03-12 14:30:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 14:30:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 23 ms.
Total runtime 91664 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/899/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BugTracking-PT-q3m128-LTLCardinality-13

BK_STOP 1678631417273

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BugTracking-PT-q3m128-LTLCardinality-13
ltl formula formula --ltl=/tmp/899/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 237 places, 2750 transitions and 13477 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.100 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m128"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q3m128, 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 r041-tajo-167813694600371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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