Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472281800123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BugTracking-PT-q8m256, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281800123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Jun 7 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 7 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Jun 7 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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-q8m256-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m256-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654770772312

Running Version 202205111006
[2022-06-09 10:32:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 10:32:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:32:54] [INFO ] Load time of PNML (sax parser for PT used): 871 ms
[2022-06-09 10:32:54] [INFO ] Transformed 754 places.
[2022-06-09 10:32:54] [INFO ] Transformed 27370 transitions.
[2022-06-09 10:32:54] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1080 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 107 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m256-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 94 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2022-06-09 10:32:55] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2022-06-09 10:32:55] [INFO ] Computed 8 place invariants in 49 ms
[2022-06-09 10:32:55] [INFO ] Implicit Places using invariants in 728 ms returned []
[2022-06-09 10:32:55] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2022-06-09 10:32:55] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:32:56] [INFO ] State equation strengthened by 282 read => feed constraints.
[2022-06-09 10:32:58] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 3180 ms to find 0 implicit places.
[2022-06-09 10:32:58] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2022-06-09 10:32:58] [INFO ] Computed 8 place invariants in 29 ms
[2022-06-09 10:32:59] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions, in 1 iterations. Remains : 277/280 places, 3871/3904 transitions.
Support contains 3 out of 277 places after structural reductions.
[2022-06-09 10:33:00] [INFO ] Flatten gal took : 358 ms
[2022-06-09 10:33:00] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BugTracking-PT-q8m256-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-09 10:33:00] [INFO ] Flatten gal took : 206 ms
[2022-06-09 10:33:00] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 93619 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93619 steps, saw 44948 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-09 10:33:03] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2022-06-09 10:33:03] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:33:04] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 10:33:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:33:04] [INFO ] After 816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 10:33:05] [INFO ] State equation strengthened by 282 read => feed constraints.
[2022-06-09 10:33:05] [INFO ] After 607ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 10:33:06] [INFO ] Deduced a trap composed of 12 places in 561 ms of which 33 ms to minimize.
[2022-06-09 10:33:06] [INFO ] Deduced a trap composed of 28 places in 556 ms of which 1 ms to minimize.
[2022-06-09 10:33:07] [INFO ] Deduced a trap composed of 85 places in 532 ms of which 2 ms to minimize.
[2022-06-09 10:33:08] [INFO ] Deduced a trap composed of 86 places in 447 ms of which 1 ms to minimize.
[2022-06-09 10:33:08] [INFO ] Deduced a trap composed of 58 places in 466 ms of which 1 ms to minimize.
[2022-06-09 10:33:09] [INFO ] Deduced a trap composed of 19 places in 520 ms of which 1 ms to minimize.
[2022-06-09 10:33:09] [INFO ] Deduced a trap composed of 21 places in 355 ms of which 0 ms to minimize.
[2022-06-09 10:33:09] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2022-06-09 10:33:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 4324 ms
[2022-06-09 10:33:10] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 0 ms to minimize.
[2022-06-09 10:33:10] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-06-09 10:33:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 720 ms
[2022-06-09 10:33:10] [INFO ] After 5819ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-06-09 10:33:10] [INFO ] After 6835ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 269 transition count 3871
Applied a total of 16 rules in 376 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10198 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1274 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98587 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98587 steps, saw 42605 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:33:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:33:14] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 10:33:14] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:33:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:33:15] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:33:15] [INFO ] After 380ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:15] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 0 ms to minimize.
[2022-06-09 10:33:16] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 1 ms to minimize.
[2022-06-09 10:33:16] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 1 ms to minimize.
[2022-06-09 10:33:16] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 0 ms to minimize.
[2022-06-09 10:33:17] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 0 ms to minimize.
[2022-06-09 10:33:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1894 ms
[2022-06-09 10:33:17] [INFO ] After 2339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 164 ms.
[2022-06-09 10:33:17] [INFO ] After 3179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:33:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:33:17] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 10:33:18] [INFO ] Implicit Places using invariants in 426 ms returned []
[2022-06-09 10:33:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:33:18] [INFO ] Computed 8 place invariants in 21 ms
[2022-06-09 10:33:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:33:20] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned []
Implicit Place search using SMT with State Equation took 3000 ms to find 0 implicit places.
[2022-06-09 10:33:21] [INFO ] Redundant transitions in 299 ms returned []
[2022-06-09 10:33:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:33:21] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 10:33:22] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 303 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2022-06-09 10:33:22] [INFO ] Computed 9 place invariants in 17 ms
[2022-06-09 10:33:22] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:33:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:33:23] [INFO ] After 672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:23] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 208 ms.
[2022-06-09 10:33:23] [INFO ] After 1124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q8m256-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(p0)))))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Applied a total of 4 rules in 206 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2022-06-09 10:33:24] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:33:24] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:33:24] [INFO ] Implicit Places using invariants in 504 ms returned []
[2022-06-09 10:33:24] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:33:24] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:33:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:33:27] [INFO ] Implicit Places using invariants and state equation in 2617 ms returned []
Implicit Place search using SMT with State Equation took 3141 ms to find 0 implicit places.
[2022-06-09 10:33:27] [INFO ] Redundant transitions in 239 ms returned []
[2022-06-09 10:33:27] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:33:27] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:33:28] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m256-LTLCardinality-10 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 s212 s256)], 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 22 reset in 738 ms.
Product exploration explored 100000 steps with 21 reset in 666 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) 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 110338 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110338 steps, saw 53062 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:33:33] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:33:33] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 10:33:33] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:33:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:33:34] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:33:34] [INFO ] After 445ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:35] [INFO ] Deduced a trap composed of 8 places in 327 ms of which 0 ms to minimize.
[2022-06-09 10:33:35] [INFO ] Deduced a trap composed of 9 places in 320 ms of which 1 ms to minimize.
[2022-06-09 10:33:35] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 1 ms to minimize.
[2022-06-09 10:33:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1203 ms
[2022-06-09 10:33:36] [INFO ] After 1738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 305 ms.
[2022-06-09 10:33:36] [INFO ] After 2802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 269 transition count 3871
Applied a total of 12 rules in 122 ms. Remains 269 /275 variables (removed 6) and now considering 3871/3877 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/275 places, 3871/3877 transitions.
Incomplete random walk after 10104 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1684 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98557 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98557 steps, saw 42595 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:33:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:33:39] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:33:39] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:33:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 10:33:40] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:33:40] [INFO ] After 371ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:41] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 1 ms to minimize.
[2022-06-09 10:33:41] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 0 ms to minimize.
[2022-06-09 10:33:41] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 0 ms to minimize.
[2022-06-09 10:33:42] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 1 ms to minimize.
[2022-06-09 10:33:42] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 0 ms to minimize.
[2022-06-09 10:33:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1895 ms
[2022-06-09 10:33:42] [INFO ] After 2325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2022-06-09 10:33:42] [INFO ] After 3200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:33:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:33:42] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 10:33:43] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-06-09 10:33:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:33:43] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:33:43] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:33:45] [INFO ] Implicit Places using invariants and state equation in 2511 ms returned []
Implicit Place search using SMT with State Equation took 2948 ms to find 0 implicit places.
[2022-06-09 10:33:45] [INFO ] Redundant transitions in 119 ms returned []
[2022-06-09 10:33:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:33:45] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 10:33:47] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 267 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2022-06-09 10:33:47] [INFO ] Computed 9 place invariants in 9 ms
[2022-06-09 10:33:47] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:33:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:33:48] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:48] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-06-09 10:33:48] [INFO ] After 912ms 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 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 73 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2022-06-09 10:33:48] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:33:48] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:33:49] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-09 10:33:49] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:33:49] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:33:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:33:51] [INFO ] Implicit Places using invariants and state equation in 2430 ms returned []
Implicit Place search using SMT with State Equation took 2864 ms to find 0 implicit places.
[2022-06-09 10:33:51] [INFO ] Redundant transitions in 116 ms returned []
[2022-06-09 10:33:51] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:33:51] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:33:52] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/275 places, 3877/3877 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 129918 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129918 steps, saw 62751 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:33:55] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:33:55] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 10:33:55] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:33:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:33:56] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:33:57] [INFO ] After 458ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:33:57] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2022-06-09 10:33:57] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 1 ms to minimize.
[2022-06-09 10:33:58] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2022-06-09 10:33:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1123 ms
[2022-06-09 10:33:58] [INFO ] After 1677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 326 ms.
[2022-06-09 10:33:58] [INFO ] After 2755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 269 transition count 3871
Applied a total of 12 rules in 113 ms. Remains 269 /275 variables (removed 6) and now considering 3871/3877 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/275 places, 3871/3877 transitions.
Incomplete random walk after 10116 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1686 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 113159 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113159 steps, saw 48357 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:34:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:34:01] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:34:01] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:34:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 10:34:02] [INFO ] After 665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:34:02] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:34:03] [INFO ] After 389ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:34:03] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 1 ms to minimize.
[2022-06-09 10:34:03] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 0 ms to minimize.
[2022-06-09 10:34:04] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 1 ms to minimize.
[2022-06-09 10:34:04] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 0 ms to minimize.
[2022-06-09 10:34:04] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 1 ms to minimize.
[2022-06-09 10:34:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1847 ms
[2022-06-09 10:34:04] [INFO ] After 2298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2022-06-09 10:34:05] [INFO ] After 3202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 10:34:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:34:05] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 10:34:05] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-06-09 10:34:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:34:05] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:34:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:34:08] [INFO ] Implicit Places using invariants and state equation in 2393 ms returned []
Implicit Place search using SMT with State Equation took 2821 ms to find 0 implicit places.
[2022-06-09 10:34:08] [INFO ] Redundant transitions in 119 ms returned []
[2022-06-09 10:34:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 10:34:08] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 10:34:09] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 257 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2022-06-09 10:34:09] [INFO ] Computed 9 place invariants in 15 ms
[2022-06-09 10:34:09] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:34:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:34:10] [INFO ] After 624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:34:10] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-06-09 10:34:10] [INFO ] After 875ms 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 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22 reset in 578 ms.
Product exploration explored 100000 steps with 23 reset in 618 ms.
Built C files in :
/tmp/ltsmin6739969577496414430
[2022-06-09 10:34:11] [INFO ] Too many transitions (3877) to apply POR reductions. Disabling POR matrices.
[2022-06-09 10:34:12] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6739969577496414430
Running compilation step : cd /tmp/ltsmin6739969577496414430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6739969577496414430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6739969577496414430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 51 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2022-06-09 10:34:15] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:34:15] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:34:15] [INFO ] Implicit Places using invariants in 456 ms returned []
[2022-06-09 10:34:15] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:34:15] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 10:34:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:34:18] [INFO ] Implicit Places using invariants and state equation in 2732 ms returned []
Implicit Place search using SMT with State Equation took 3190 ms to find 0 implicit places.
[2022-06-09 10:34:18] [INFO ] Redundant transitions in 121 ms returned []
[2022-06-09 10:34:18] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:34:18] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:34:19] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/275 places, 3877/3877 transitions.
Built C files in :
/tmp/ltsmin10692565657268104616
[2022-06-09 10:34:19] [INFO ] Too many transitions (3877) to apply POR reductions. Disabling POR matrices.
[2022-06-09 10:34:19] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10692565657268104616
Running compilation step : cd /tmp/ltsmin10692565657268104616;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10692565657268104616;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10692565657268104616;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 10:34:22] [INFO ] Flatten gal took : 192 ms
[2022-06-09 10:34:23] [INFO ] Flatten gal took : 164 ms
[2022-06-09 10:34:23] [INFO ] Time to serialize gal into /tmp/LTL4149787669510528925.gal : 46 ms
[2022-06-09 10:34:23] [INFO ] Time to serialize properties into /tmp/LTL17419368914714902981.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4149787669510528925.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17419368914714902981.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4149787...267
Read 1 LTL properties
Checking formula 0 : !((G(F(X(G("(ch2_MORE_INFO_q4<=ch4_FIXED_q6)"))))))
Formula 0 simplified : !GFXG"(ch2_MORE_INFO_q4<=ch4_FIXED_q6)"
Detected timeout of ITS tools.
[2022-06-09 10:34:38] [INFO ] Flatten gal took : 164 ms
[2022-06-09 10:34:38] [INFO ] Applying decomposition
[2022-06-09 10:34:38] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1032788449055133276.txt' '-o' '/tmp/graph1032788449055133276.bin' '-w' '/tmp/graph1032788449055133276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1032788449055133276.bin' '-l' '-1' '-v' '-w' '/tmp/graph1032788449055133276.weights' '-q' '0' '-e' '0.001'
[2022-06-09 10:34:39] [INFO ] Decomposing Gal with order
[2022-06-09 10:34:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:34:39] [INFO ] Removed a total of 216 redundant transitions.
[2022-06-09 10:34:39] [INFO ] Flatten gal took : 410 ms
[2022-06-09 10:34:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 24 ms.
[2022-06-09 10:34:39] [INFO ] Time to serialize gal into /tmp/LTL9044239452914373699.gal : 19 ms
[2022-06-09 10:34:39] [INFO ] Time to serialize properties into /tmp/LTL11056652587373535770.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9044239452914373699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11056652587373535770.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9044239...267
Read 1 LTL properties
Checking formula 0 : !((G(F(X(G("(gu5.ch2_MORE_INFO_q4<=gu5.ch4_FIXED_q6)"))))))
Formula 0 simplified : !GFXG"(gu5.ch2_MORE_INFO_q4<=gu5.ch4_FIXED_q6)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7878059822113552568
[2022-06-09 10:34:54] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7878059822113552568
Running compilation step : cd /tmp/ltsmin7878059822113552568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7878059822113552568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7878059822113552568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BugTracking-PT-q8m256-LTLCardinality-10 finished in 93972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(p0)))))'
[2022-06-09 10:34:58] [INFO ] Flatten gal took : 205 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5510019712310691749
[2022-06-09 10:34:58] [INFO ] Too many transitions (3871) to apply POR reductions. Disabling POR matrices.
[2022-06-09 10:34:58] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5510019712310691749
Running compilation step : cd /tmp/ltsmin5510019712310691749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 10:34:58] [INFO ] Applying decomposition
[2022-06-09 10:34:58] [INFO ] Flatten gal took : 166 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15898343058538370445.txt' '-o' '/tmp/graph15898343058538370445.bin' '-w' '/tmp/graph15898343058538370445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15898343058538370445.bin' '-l' '-1' '-v' '-w' '/tmp/graph15898343058538370445.weights' '-q' '0' '-e' '0.001'
[2022-06-09 10:34:58] [INFO ] Decomposing Gal with order
[2022-06-09 10:34:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:34:59] [INFO ] Removed a total of 216 redundant transitions.
[2022-06-09 10:34:59] [INFO ] Flatten gal took : 292 ms
[2022-06-09 10:34:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 33 ms.
[2022-06-09 10:34:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality12179807259839511135.gal : 20 ms
[2022-06-09 10:34:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality16325406683343982880.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12179807259839511135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16325406683343982880.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((G(F(X(G("(gu5.ch2_MORE_INFO_q4<=gu5.ch4_FIXED_q6)"))))))
Formula 0 simplified : !GFXG"(gu5.ch2_MORE_INFO_q4<=gu5.ch4_FIXED_q6)"
Compilation finished in 10881 ms.
Running link step : cd /tmp/ltsmin5510019712310691749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin5510019712310691749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-09 10:55:41] [INFO ] Flatten gal took : 382 ms
[2022-06-09 10:55:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality14016994228961030687.gal : 43 ms
[2022-06-09 10:55:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality8729379168617988773.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14016994228961030687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8729379168617988773.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((G(F(X(G("(ch2_MORE_INFO_q4<=ch4_FIXED_q6)"))))))
Formula 0 simplified : !GFXG"(ch2_MORE_INFO_q4<=ch4_FIXED_q6)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: LTL layer: formula: [](<>(X([]((LTLAPp0==true)))))
pins2lts-mc-linux64( 2/ 8), 0.015: "[](<>(X([]((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.018: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.250: There are 3873 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.250: State length is 278, there are 3875 groups
pins2lts-mc-linux64( 0/ 8), 0.251: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.251: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.251: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.251: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.359: [Blue] ~120 levels ~960 states ~3448 transitions
pins2lts-mc-linux64( 1/ 8), 0.483: [Blue] ~240 levels ~1920 states ~6968 transitions
pins2lts-mc-linux64( 1/ 8), 0.680: [Blue] ~480 levels ~3840 states ~14008 transitions
pins2lts-mc-linux64( 3/ 8), 0.974: [Blue] ~830 levels ~7680 states ~18168 transitions
pins2lts-mc-linux64( 3/ 8), 1.642: [Blue] ~1598 levels ~15360 states ~29304 transitions
pins2lts-mc-linux64( 3/ 8), 2.812: [Blue] ~3134 levels ~30720 states ~51576 transitions
pins2lts-mc-linux64( 3/ 8), 5.060: [Blue] ~6206 levels ~61440 states ~96120 transitions
pins2lts-mc-linux64( 3/ 8), 9.487: [Blue] ~12350 levels ~122880 states ~185208 transitions
pins2lts-mc-linux64( 3/ 8), 17.672: [Blue] ~24638 levels ~245760 states ~363384 transitions
pins2lts-mc-linux64( 3/ 8), 33.078: [Blue] ~49214 levels ~491520 states ~719736 transitions
pins2lts-mc-linux64( 3/ 8), 64.278: [Blue] ~98366 levels ~983040 states ~1432440 transitions
pins2lts-mc-linux64( 7/ 8), 125.378: [Blue] ~245760 levels ~1966080 states ~4917320 transitions
pins2lts-mc-linux64( 7/ 8), 247.179: [Blue] ~491520 levels ~3932160 states ~9832520 transitions
pins2lts-mc-linux64( 7/ 8), 489.363: [Blue] ~983040 levels ~7864320 states ~19662920 transitions
pins2lts-mc-linux64( 7/ 8), 973.546: [Blue] ~1966080 levels ~15728640 states ~39323720 transitions
pins2lts-mc-linux64( 4/ 8), 1794.258: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1794.304:
pins2lts-mc-linux64( 0/ 8), 1794.304: Explored 27972811 states 80524253 transitions, fanout: 2.879
pins2lts-mc-linux64( 0/ 8), 1794.304: Total exploration time 1794.040 sec (1794.000 sec minimum, 1794.009 sec on average)
pins2lts-mc-linux64( 0/ 8), 1794.304: States per second: 15592, Transitions per second: 44884
pins2lts-mc-linux64( 0/ 8), 1794.304:
pins2lts-mc-linux64( 0/ 8), 1794.304: State space has 75148981 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1794.304: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1794.304: blue states: 27972811 (37.22%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1794.304: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1794.304: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1794.304:
pins2lts-mc-linux64( 0/ 8), 1794.304: Total memory used for local state coloring: 356.1MB
pins2lts-mc-linux64( 0/ 8), 1794.304:
pins2lts-mc-linux64( 0/ 8), 1794.304: Queue width: 8B, total height: 23337082, memory: 178.05MB
pins2lts-mc-linux64( 0/ 8), 1794.304: Tree memory: 829.3MB, 11.6 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1794.304: Tree fill ratio (roots/leafs): 55.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1794.304: Stored 4359 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1794.304: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1794.304: Est. total memory use: 1007.4MB (~1202.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5510019712310691749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5510019712310691749;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-09 11:16:23] [INFO ] Flatten gal took : 225 ms
[2022-06-09 11:16:23] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 11:16:23] [INFO ] Transformed 277 places.
[2022-06-09 11:16:23] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-06-09 11:16:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality4659547038245812548.gal : 15 ms
[2022-06-09 11:16:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality16304508510642618403.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4659547038245812548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16304508510642618403.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(X(G("(ch2_MORE_INFO_q4<=ch4_FIXED_q6)"))))))
Formula 0 simplified : !GFXG"(ch2_MORE_INFO_q4<=ch4_FIXED_q6)"

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-q8m256"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m256, 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 r312-tall-165472281800123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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