Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414700258.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BugTracking-PT-q8m016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716647032165

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 14:23:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 14:23:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:23:57] [INFO ] Load time of PNML (sax parser for PT used): 1390 ms
[2024-05-25 14:23:57] [INFO ] Transformed 754 places.
[2024-05-25 14:23:57] [INFO ] Transformed 27370 transitions.
[2024-05-25 14:23:57] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1788 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 229 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m016-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 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 162 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-25 14:23:58] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-25 14:23:58] [INFO ] Computed 8 invariants in 81 ms
[2024-05-25 14:24:02] [INFO ] Implicit Places using invariants in 3524 ms returned []
[2024-05-25 14:24:02] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 14:24:02] [INFO ] Invariant cache hit.
[2024-05-25 14:24:03] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 14:24:06] [INFO ] Implicit Places using invariants and state equation in 4101 ms returned []
Implicit Place search using SMT with State Equation took 7740 ms to find 0 implicit places.
[2024-05-25 14:24:06] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 14:24:06] [INFO ] Invariant cache hit.
[2024-05-25 14:24:07] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9440 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 7 out of 277 places after structural reductions.
[2024-05-25 14:24:08] [INFO ] Flatten gal took : 528 ms
[2024-05-25 14:24:09] [INFO ] Flatten gal took : 271 ms
[2024-05-25 14:24:09] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10002 steps, including 29 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 65284 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65284 steps, saw 34570 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 14:24:13] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 14:24:13] [INFO ] Invariant cache hit.
[2024-05-25 14:24:13] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-25 14:24:16] [INFO ] After 2940ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-25 14:24:17] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 14:24:17] [INFO ] After 288ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 14:24:17] [INFO ] After 3556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 14:24:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:24:19] [INFO ] After 1603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 14:24:19] [INFO ] After 751ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 14:24:23] [INFO ] Deduced a trap composed of 46 places in 3715 ms of which 32 ms to minimize.
[2024-05-25 14:24:24] [INFO ] Deduced a trap composed of 28 places in 509 ms of which 2 ms to minimize.
[2024-05-25 14:24:24] [INFO ] Deduced a trap composed of 12 places in 563 ms of which 32 ms to minimize.
[2024-05-25 14:24:26] [INFO ] Deduced a trap composed of 30 places in 1726 ms of which 27 ms to minimize.
[2024-05-25 14:24:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 6903 ms
[2024-05-25 14:24:27] [INFO ] Deduced a trap composed of 58 places in 603 ms of which 17 ms to minimize.
[2024-05-25 14:24:28] [INFO ] Deduced a trap composed of 55 places in 527 ms of which 1 ms to minimize.
[2024-05-25 14:24:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1351 ms
[2024-05-25 14:24:28] [INFO ] After 9393ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 239 ms.
[2024-05-25 14:24:28] [INFO ] After 11402ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 276 transition count 3873
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 276 transition count 3866
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 269 transition count 3866
Applied a total of 16 rules in 545 ms. Remains 269 /277 variables (removed 8) and now considering 3866/3871 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 269/277 places, 3866/3871 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 101136 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101136 steps, saw 32985 distinct states, run finished after 3013 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 14:24:32] [INFO ] Flow matrix only has 3699 transitions (discarded 167 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:24:32] [INFO ] Computed 8 invariants in 60 ms
[2024-05-25 14:24:32] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:24:34] [INFO ] After 1192ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 14:24:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:24:34] [INFO ] After 195ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 14:24:34] [INFO ] After 1532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 14:24:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:24:35] [INFO ] After 1082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 14:24:35] [INFO ] After 410ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 14:24:37] [INFO ] Deduced a trap composed of 62 places in 1012 ms of which 1 ms to minimize.
[2024-05-25 14:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1192 ms
[2024-05-25 14:24:37] [INFO ] After 1873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2024-05-25 14:24:37] [INFO ] After 3310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3866/3866 transitions.
Applied a total of 0 rules in 151 ms. Remains 269 /269 variables (removed 0) and now considering 3866/3866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 269/269 places, 3866/3866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3866/3866 transitions.
Applied a total of 0 rules in 109 ms. Remains 269 /269 variables (removed 0) and now considering 3866/3866 (removed 0) transitions.
[2024-05-25 14:24:37] [INFO ] Flow matrix only has 3699 transitions (discarded 167 similar events)
[2024-05-25 14:24:37] [INFO ] Invariant cache hit.
[2024-05-25 14:24:50] [INFO ] Implicit Places using invariants in 13007 ms returned []
[2024-05-25 14:24:50] [INFO ] Flow matrix only has 3699 transitions (discarded 167 similar events)
[2024-05-25 14:24:50] [INFO ] Invariant cache hit.
[2024-05-25 14:24:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:24:55] [INFO ] Implicit Places using invariants and state equation in 5043 ms returned []
Implicit Place search using SMT with State Equation took 18059 ms to find 0 implicit places.
[2024-05-25 14:24:56] [INFO ] Redundant transitions in 523 ms returned []
[2024-05-25 14:24:56] [INFO ] Flow matrix only has 3699 transitions (discarded 167 similar events)
[2024-05-25 14:24:56] [INFO ] Invariant cache hit.
[2024-05-25 14:24:59] [INFO ] Dead Transitions using invariants and state equation in 2525 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21267 ms. Remains : 269/269 places, 3866/3866 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 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 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 172 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 173 place count 267 transition count 3695
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 267 transition count 3692
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 179 place count 264 transition count 3692
Applied a total of 179 rules in 612 ms. Remains 264 /269 variables (removed 5) and now considering 3692/3866 (removed 174) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3692 rows 264 cols
[2024-05-25 14:24:59] [INFO ] Computed 9 invariants in 31 ms
[2024-05-25 14:24:59] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 14:25:00] [INFO ] After 1047ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 14:25:01] [INFO ] After 1171ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-25 14:25:01] [INFO ] After 1474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-25 14:25:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 14:25:02] [INFO ] After 1027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 14:25:02] [INFO ] After 1296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-25 14:25:02] [INFO ] After 1514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA BugTracking-PT-q8m016-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 3 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 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
Applied a total of 4 rules in 211 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2024-05-25 14:25:03] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2024-05-25 14:25:03] [INFO ] Computed 8 invariants in 13 ms
[2024-05-25 14:25:03] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-25 14:25:03] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 14:25:03] [INFO ] Invariant cache hit.
[2024-05-25 14:25:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:25:05] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 2729 ms to find 0 implicit places.
[2024-05-25 14:25:06] [INFO ] Redundant transitions in 324 ms returned []
[2024-05-25 14:25:06] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 14:25:06] [INFO ] Invariant cache hit.
[2024-05-25 14:25:08] [INFO ] Dead Transitions using invariants and state equation in 1788 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5076 ms. Remains : 275/277 places, 3877/3871 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 622 ms :[true, (NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m016-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s10 1) (LT s97 1) (LT s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 336 reset in 952 ms.
Product exploration explored 100000 steps with 325 reset in 1275 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145937 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145937 steps, saw 78284 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 14:25:14] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 14:25:14] [INFO ] Invariant cache hit.
[2024-05-25 14:25:14] [INFO ] [Real]Absence check using 8 positive place invariants in 58 ms returned sat
[2024-05-25 14:25:16] [INFO ] After 2003ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 14:25:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:25:16] [INFO ] After 169ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:25:16] [INFO ] After 2465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:25:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:25:17] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 14:25:18] [INFO ] After 337ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 14:25:18] [INFO ] Deduced a trap composed of 12 places in 387 ms of which 1 ms to minimize.
[2024-05-25 14:25:19] [INFO ] Deduced a trap composed of 90 places in 418 ms of which 0 ms to minimize.
[2024-05-25 14:25:19] [INFO ] Deduced a trap composed of 44 places in 376 ms of which 0 ms to minimize.
[2024-05-25 14:25:20] [INFO ] Deduced a trap composed of 17 places in 438 ms of which 1 ms to minimize.
[2024-05-25 14:25:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2163 ms
[2024-05-25 14:25:20] [INFO ] After 2569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-25 14:25:20] [INFO ] After 3549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 268 ms. Remains 269 /275 variables (removed 6) and now considering 3871/3877 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 269/275 places, 3871/3877 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110887 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110887 steps, saw 35972 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 14:25:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:25:23] [INFO ] Computed 8 invariants in 29 ms
[2024-05-25 14:25:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:25:25] [INFO ] After 1171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 14:25:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:25:25] [INFO ] After 184ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:25:25] [INFO ] After 1561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:25:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:25:26] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 14:25:26] [INFO ] After 211ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 14:25:27] [INFO ] Deduced a trap composed of 89 places in 465 ms of which 1 ms to minimize.
[2024-05-25 14:25:27] [INFO ] Deduced a trap composed of 95 places in 595 ms of which 0 ms to minimize.
[2024-05-25 14:25:28] [INFO ] Deduced a trap composed of 65 places in 421 ms of which 0 ms to minimize.
[2024-05-25 14:25:28] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2024-05-25 14:25:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2378 ms
[2024-05-25 14:25:29] [INFO ] After 2656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-25 14:25:29] [INFO ] After 3844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:25:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:25:29] [INFO ] Invariant cache hit.
[2024-05-25 14:25:29] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-25 14:25:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:25:29] [INFO ] Invariant cache hit.
[2024-05-25 14:25:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:25:32] [INFO ] Implicit Places using invariants and state equation in 2294 ms returned []
Implicit Place search using SMT with State Equation took 2828 ms to find 0 implicit places.
[2024-05-25 14:25:32] [INFO ] Redundant transitions in 110 ms returned []
[2024-05-25 14:25:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:25:32] [INFO ] Invariant cache hit.
[2024-05-25 14:25:33] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4459 ms. 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 2 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 585 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
[2024-05-25 14:25:34] [INFO ] Computed 9 invariants in 27 ms
[2024-05-25 14:25:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 14:25:35] [INFO ] After 775ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 14:25:35] [INFO ] After 926ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-25 14:25:35] [INFO ] After 1115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0)]
Support contains 3 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 96 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2024-05-25 14:25:36] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2024-05-25 14:25:36] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 14:25:36] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-25 14:25:36] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 14:25:36] [INFO ] Invariant cache hit.
[2024-05-25 14:25:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:25:41] [INFO ] Implicit Places using invariants and state equation in 4678 ms returned []
Implicit Place search using SMT with State Equation took 5185 ms to find 0 implicit places.
[2024-05-25 14:25:41] [INFO ] Redundant transitions in 121 ms returned []
[2024-05-25 14:25:41] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 14:25:41] [INFO ] Invariant cache hit.
[2024-05-25 14:25:43] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7327 ms. 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0)]
Incomplete random walk after 10001 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 150470 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150470 steps, saw 80894 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 14:25:46] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 14:25:46] [INFO ] Invariant cache hit.
[2024-05-25 14:25:46] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:25:48] [INFO ] After 1305ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 14:25:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:25:48] [INFO ] After 191ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:25:48] [INFO ] After 1666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:25:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:25:49] [INFO ] After 1283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 14:25:50] [INFO ] After 277ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 14:25:50] [INFO ] Deduced a trap composed of 12 places in 430 ms of which 1 ms to minimize.
[2024-05-25 14:25:51] [INFO ] Deduced a trap composed of 90 places in 444 ms of which 1 ms to minimize.
[2024-05-25 14:25:51] [INFO ] Deduced a trap composed of 44 places in 574 ms of which 1 ms to minimize.
[2024-05-25 14:25:56] [INFO ] Deduced a trap composed of 17 places in 4562 ms of which 1 ms to minimize.
[2024-05-25 14:25:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 6652 ms
[2024-05-25 14:25:56] [INFO ] After 7025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2024-05-25 14:25:56] [INFO ] After 8512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 207 ms. Remains 269 /275 variables (removed 6) and now considering 3871/3877 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 269/275 places, 3871/3877 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 129999 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129999 steps, saw 48781 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 14:26:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:26:00] [INFO ] Computed 8 invariants in 35 ms
[2024-05-25 14:26:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:26:01] [INFO ] After 779ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 14:26:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:26:01] [INFO ] After 150ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:26:01] [INFO ] After 1076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:26:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:26:02] [INFO ] After 1220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 14:26:02] [INFO ] After 245ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 14:26:03] [INFO ] Deduced a trap composed of 89 places in 552 ms of which 1 ms to minimize.
[2024-05-25 14:26:04] [INFO ] Deduced a trap composed of 95 places in 450 ms of which 1 ms to minimize.
[2024-05-25 14:26:04] [INFO ] Deduced a trap composed of 65 places in 432 ms of which 0 ms to minimize.
[2024-05-25 14:26:05] [INFO ] Deduced a trap composed of 5 places in 364 ms of which 0 ms to minimize.
[2024-05-25 14:26:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2441 ms
[2024-05-25 14:26:05] [INFO ] After 2758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-05-25 14:26:05] [INFO ] After 4239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 130 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 86 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:26:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:26:05] [INFO ] Invariant cache hit.
[2024-05-25 14:26:06] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-05-25 14:26:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:26:06] [INFO ] Invariant cache hit.
[2024-05-25 14:26:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:26:11] [INFO ] Implicit Places using invariants and state equation in 4604 ms returned []
Implicit Place search using SMT with State Equation took 5231 ms to find 0 implicit places.
[2024-05-25 14:26:11] [INFO ] Redundant transitions in 133 ms returned []
[2024-05-25 14:26:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:26:11] [INFO ] Invariant cache hit.
[2024-05-25 14:26:15] [INFO ] Dead Transitions using invariants and state equation in 4546 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10035 ms. 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 383 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
[2024-05-25 14:26:16] [INFO ] Computed 9 invariants in 15 ms
[2024-05-25 14:26:16] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 14:26:17] [INFO ] After 854ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 14:26:17] [INFO ] After 960ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-25 14:26:17] [INFO ] After 1188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 322 reset in 843 ms.
Product exploration explored 100000 steps with 336 reset in 803 ms.
Built C files in :
/tmp/ltsmin13744833173940782410
[2024-05-25 14:26:19] [INFO ] Too many transitions (3877) to apply POR reductions. Disabling POR matrices.
[2024-05-25 14:26:19] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13744833173940782410
Running compilation step : cd /tmp/ltsmin13744833173940782410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13744833173940782410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13744833173940782410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 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 242 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2024-05-25 14:26:23] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2024-05-25 14:26:23] [INFO ] Computed 8 invariants in 41 ms
[2024-05-25 14:26:23] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-25 14:26:23] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 14:26:23] [INFO ] Invariant cache hit.
[2024-05-25 14:26:26] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:26:29] [INFO ] Implicit Places using invariants and state equation in 5554 ms returned []
Implicit Place search using SMT with State Equation took 6193 ms to find 0 implicit places.
[2024-05-25 14:26:29] [INFO ] Redundant transitions in 109 ms returned []
[2024-05-25 14:26:29] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-25 14:26:29] [INFO ] Invariant cache hit.
[2024-05-25 14:26:31] [INFO ] Dead Transitions using invariants and state equation in 1942 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8518 ms. Remains : 275/275 places, 3877/3877 transitions.
Built C files in :
/tmp/ltsmin4427226647277691632
[2024-05-25 14:26:31] [INFO ] Too many transitions (3877) to apply POR reductions. Disabling POR matrices.
[2024-05-25 14:26:31] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4427226647277691632
Running compilation step : cd /tmp/ltsmin4427226647277691632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4427226647277691632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4427226647277691632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 14:26:35] [INFO ] Flatten gal took : 384 ms
[2024-05-25 14:26:35] [INFO ] Flatten gal took : 312 ms
[2024-05-25 14:26:35] [INFO ] Time to serialize gal into /tmp/LTL723138499289933985.gal : 71 ms
[2024-05-25 14:26:35] [INFO ] Time to serialize properties into /tmp/LTL6502462506115898073.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL723138499289933985.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14252587583279557844.hoa' '-atoms' '/tmp/LTL6502462506115898073.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6502462506115898073.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14252587583279557844.hoa
Detected timeout of ITS tools.
[2024-05-25 14:26:51] [INFO ] Flatten gal took : 261 ms
[2024-05-25 14:26:51] [INFO ] Flatten gal took : 258 ms
[2024-05-25 14:26:51] [INFO ] Time to serialize gal into /tmp/LTL12603203155195527737.gal : 61 ms
[2024-05-25 14:26:51] [INFO ] Time to serialize properties into /tmp/LTL5416321816463877604.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12603203155195527737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5416321816463877604.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G("(((l10<1)||(x2_PENDING_q6<1))||(ch2_PENDING_q8<1))")))
Formula 0 simplified : F!"(((l10<1)||(x2_PENDING_q6<1))||(ch2_PENDING_q8<1))"
Detected timeout of ITS tools.
[2024-05-25 14:27:07] [INFO ] Flatten gal took : 295 ms
[2024-05-25 14:27:07] [INFO ] Applying decomposition
[2024-05-25 14:27:07] [INFO ] Flatten gal took : 161 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11578368729751006346.txt' '-o' '/tmp/graph11578368729751006346.bin' '-w' '/tmp/graph11578368729751006346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11578368729751006346.bin' '-l' '-1' '-v' '-w' '/tmp/graph11578368729751006346.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:27:08] [INFO ] Decomposing Gal with order
[2024-05-25 14:27:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:27:08] [INFO ] Removed a total of 424 redundant transitions.
[2024-05-25 14:27:08] [INFO ] Flatten gal took : 543 ms
[2024-05-25 14:27:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 36 ms.
[2024-05-25 14:27:09] [INFO ] Time to serialize gal into /tmp/LTL10549099767500568217.gal : 59 ms
[2024-05-25 14:27:09] [INFO ] Time to serialize properties into /tmp/LTL5731728230223047916.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10549099767500568217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5731728230223047916.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G("(((i2.u2.l10<1)||(i2.u2.x2_PENDING_q6<1))||(i2.u2.ch2_PENDING_q8<1))")))
Formula 0 simplified : F!"(((i2.u2.l10<1)||(i2.u2.x2_PENDING_q6<1))||(i2.u2.ch2_PENDING_q8<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6700612157058279004
[2024-05-25 14:27:24] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6700612157058279004
Running compilation step : cd /tmp/ltsmin6700612157058279004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6700612157058279004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6700612157058279004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BugTracking-PT-q8m016-LTLFireability-03 finished in 144472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 276 transition count 3873
Applied a total of 2 rules in 82 ms. Remains 276 /277 variables (removed 1) and now considering 3873/3871 (removed -2) transitions.
[2024-05-25 14:27:27] [INFO ] Flow matrix only has 3706 transitions (discarded 167 similar events)
// Phase 1: matrix 3706 rows 276 cols
[2024-05-25 14:27:27] [INFO ] Computed 8 invariants in 21 ms
[2024-05-25 14:27:28] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-25 14:27:28] [INFO ] Flow matrix only has 3706 transitions (discarded 167 similar events)
[2024-05-25 14:27:28] [INFO ] Invariant cache hit.
[2024-05-25 14:27:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:27:32] [INFO ] Implicit Places using invariants and state equation in 4435 ms returned []
Implicit Place search using SMT with State Equation took 5173 ms to find 0 implicit places.
[2024-05-25 14:27:32] [INFO ] Redundant transitions in 123 ms returned []
[2024-05-25 14:27:32] [INFO ] Flow matrix only has 3706 transitions (discarded 167 similar events)
[2024-05-25 14:27:32] [INFO ] Invariant cache hit.
[2024-05-25 14:27:34] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/277 places, 3873/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7137 ms. Remains : 276/277 places, 3873/3871 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m016-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 420 steps with 0 reset in 3 ms.
FORMULA BugTracking-PT-q8m016-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m016-LTLFireability-09 finished in 7326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
[2024-05-25 14:27:35] [INFO ] Flatten gal took : 340 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4984371908133008589
[2024-05-25 14:27:35] [INFO ] Too many transitions (3871) to apply POR reductions. Disabling POR matrices.
[2024-05-25 14:27:35] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4984371908133008589
Running compilation step : cd /tmp/ltsmin4984371908133008589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 14:27:35] [INFO ] Applying decomposition
[2024-05-25 14:27:35] [INFO ] Flatten gal took : 165 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17797148503581226692.txt' '-o' '/tmp/graph17797148503581226692.bin' '-w' '/tmp/graph17797148503581226692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17797148503581226692.bin' '-l' '-1' '-v' '-w' '/tmp/graph17797148503581226692.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:27:36] [INFO ] Decomposing Gal with order
[2024-05-25 14:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:27:36] [INFO ] Removed a total of 406 redundant transitions.
[2024-05-25 14:27:36] [INFO ] Flatten gal took : 485 ms
[2024-05-25 14:27:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 377 labels/synchronizations in 45 ms.
[2024-05-25 14:27:36] [INFO ] Time to serialize gal into /tmp/LTLFireability11183444921183806124.gal : 54 ms
[2024-05-25 14:27:36] [INFO ] Time to serialize properties into /tmp/LTLFireability3520177965049126650.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11183444921183806124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3520177965049126650.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G("(((i2.u2.l10<1)||(i2.u2.x2_PENDING_q6<1))||(i2.u2.ch2_PENDING_q8<1))")))
Formula 0 simplified : F!"(((i2.u2.l10<1)||(i2.u2.x2_PENDING_q6<1))||(i2.u2.ch2_PENDING_q8<1))"
Compilation finished in 15973 ms.
Running link step : cd /tmp/ltsmin4984371908133008589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin4984371908133008589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp0==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 14:48:51] [INFO ] Flatten gal took : 473 ms
[2024-05-25 14:48:51] [INFO ] Time to serialize gal into /tmp/LTLFireability13732282464640559507.gal : 65 ms
[2024-05-25 14:48:51] [INFO ] Time to serialize properties into /tmp/LTLFireability473270754725487713.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13732282464640559507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability473270754725487713.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G("(((l10<1)||(x2_PENDING_q6<1))||(ch2_PENDING_q8<1))")))
Formula 0 simplified : F!"(((l10<1)||(x2_PENDING_q6<1))||(ch2_PENDING_q8<1))"
Detected timeout of ITS tools.
[2024-05-25 15:10:05] [INFO ] Flatten gal took : 423 ms
[2024-05-25 15:10:05] [INFO ] Input system was already deterministic with 3871 transitions.
[2024-05-25 15:10:05] [INFO ] Transformed 277 places.
[2024-05-25 15:10:05] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 15:10:06] [INFO ] Time to serialize gal into /tmp/LTLFireability52581561175531444.gal : 36 ms
[2024-05-25 15:10:06] [INFO ] Time to serialize properties into /tmp/LTLFireability17122749186088207507.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability52581561175531444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17122749186088207507.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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