Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r649-smll-171774451600073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ResIsolation-PT-N11P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r649-smll-171774451600073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 45M
-rw-r--r-- 1 mcc users 6.6K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 45M Jun 7 06:26 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 ResIsolation-PT-N11P1-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N11P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717818685420

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=ResIsolation-PT-N11P1
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-08 03:51:29] [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-06-08 03:51:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-08 03:51:32] [INFO ] Load time of PNML (sax parser for PT used): 2814 ms
[2024-06-08 03:51:32] [INFO ] Transformed 357 places.
[2024-06-08 03:51:32] [INFO ] Transformed 37184 transitions.
[2024-06-08 03:51:32] [INFO ] Found NUPN structural information;
[2024-06-08 03:51:32] [INFO ] Parsed PT model containing 357 places and 37184 transitions and 885387 arcs in 3307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResIsolation-PT-N11P1-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N11P1-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N11P1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N11P1-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 37184/37184 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 345 transition count 37184
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 214 place count 143 transition count 36982
Iterating global reduction 1 with 202 rules applied. Total rules applied 416 place count 143 transition count 36982
Ensure Unique test removed 6149 transitions
Reduce isomorphic transitions removed 6149 transitions.
Iterating post reduction 1 with 6149 rules applied. Total rules applied 6565 place count 143 transition count 30833
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 6587 place count 121 transition count 30811
Iterating global reduction 2 with 22 rules applied. Total rules applied 6609 place count 121 transition count 30811
Applied a total of 6609 rules in 1318 ms. Remains 121 /357 variables (removed 236) and now considering 30811/37184 (removed 6373) transitions.
// Phase 1: matrix 30811 rows 121 cols
[2024-06-08 03:51:35] [INFO ] Computed 0 invariants in 948 ms
[2024-06-08 03:51:37] [INFO ] Implicit Places using invariants in 2699 ms returned []
Implicit Place search using SMT only with invariants took 2759 ms to find 0 implicit places.
[2024-06-08 03:51:37] [INFO ] Invariant cache hit.
[2024-06-08 03:51:58] [INFO ] Dead Transitions using invariants and state equation in 21253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/357 places, 30811/37184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25356 ms. Remains : 121/357 places, 30811/37184 transitions.
Support contains 45 out of 121 places after structural reductions.
[2024-06-08 03:52:06] [INFO ] Flatten gal took : 6992 ms
[2024-06-08 03:52:13] [INFO ] Flatten gal took : 6672 ms
[2024-06-08 03:52:23] [INFO ] Input system was already deterministic with 30811 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2246 ms. (steps per millisecond=4 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 77041 steps, run timeout after 6001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 77041 steps, saw 47499 distinct states, run finished after 6007 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 16 properties.
[2024-06-08 03:52:32] [INFO ] Invariant cache hit.
[2024-06-08 03:52:32] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-08 03:52:57] [INFO ] After 24891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-08 03:52:57] [INFO ] After 24987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-06-08 03:52:57] [INFO ] After 25292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 45 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 30811/30811 transitions.
Graph (complete) has 1150 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.260 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 119 transition count 30779
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 49 place count 101 transition count 30779
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 8 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 115 place count 68 transition count 30746
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 68 transition count 30743
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 65 transition count 30743
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 64 transition count 30742
Applied a total of 122 rules in 4639 ms. Remains 64 /121 variables (removed 57) and now considering 30742/30811 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4645 ms. Remains : 64/121 places, 30742/30811 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8601 ms. (steps per millisecond=1 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 30742 rows 64 cols
[2024-06-08 03:53:13] [INFO ] Computed 12 invariants in 326 ms
[2024-06-08 03:53:13] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-08 03:53:34] [INFO ] After 21116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:12
[2024-06-08 03:53:36] [INFO ] After 22857ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:12
Attempting to minimize the solution found.
Minimization took 1149 ms.
[2024-06-08 03:53:37] [INFO ] After 24107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:12
[2024-06-08 03:53:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-08 03:54:03] [INFO ] After 24956ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2024-06-08 03:54:03] [INFO ] After 24958ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-08 03:54:03] [INFO ] After 25175ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 45 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 30742/30742 transitions.
Applied a total of 0 rules in 767 ms. Remains 64 /64 variables (removed 0) and now considering 30742/30742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 64/64 places, 30742/30742 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA ResIsolation-PT-N11P1-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 41 stabilizing places and 53 stable transitions
Graph (complete) has 1150 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.813 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' '!(X(G(p0)))'
Support contains 12 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 30811/30811 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 24667
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 24667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 118 transition count 24666
Applied a total of 7 rules in 1071 ms. Remains 118 /121 variables (removed 3) and now considering 24666/30811 (removed 6145) transitions.
// Phase 1: matrix 24666 rows 118 cols
[2024-06-08 03:54:06] [INFO ] Computed 0 invariants in 799 ms
[2024-06-08 03:54:11] [INFO ] Implicit Places using invariants in 5919 ms returned []
Implicit Place search using SMT only with invariants took 5920 ms to find 0 implicit places.
[2024-06-08 03:54:12] [INFO ] Invariant cache hit.
[2024-06-08 03:54:25] [INFO ] Dead Transitions using invariants and state equation in 13417 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/121 places, 24666/30811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20416 ms. Remains : 118/121 places, 24666/30811 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 265 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s22 0) (EQ s36 0) (EQ s44 0) (EQ s52 0) (EQ s60 0) (EQ s68 0) (EQ s76 0) (EQ s84 0) (EQ s92 0) (EQ s100 0) (EQ s108 0) (EQ s116 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 77370 steps with 0 reset in 10002 ms.
Product exploration timeout after 79700 steps with 0 reset in 10001 ms.
Computed a total of 41 stabilizing places and 53 stable transitions
Graph (complete) has 1113 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.360 ms
Computed a total of 41 stabilizing places and 53 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1921 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95953 steps, run timeout after 6001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 95953 steps, saw 55779 distinct states, run finished after 6005 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-08 03:54:54] [INFO ] Invariant cache hit.
[2024-06-08 03:54:54] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-08 03:55:07] [INFO ] After 12808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-08 03:55:09] [INFO ] After 14450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 588 ms.
[2024-06-08 03:55:09] [INFO ] After 15079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 12 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 24666/24666 transitions.
Graph (complete) has 1113 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.142 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 116 transition count 24633
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 53 place count 97 transition count 24631
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 53 place count 97 transition count 24628
Deduced a syphon composed of 3 places in 36 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 94 transition count 24628
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 9 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 125 place count 61 transition count 24595
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 60 transition count 24594
Applied a total of 126 rules in 4923 ms. Remains 60 /118 variables (removed 58) and now considering 24594/24666 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4924 ms. Remains : 60/118 places, 24594/24666 transitions.
Finished random walk after 914 steps, including 0 resets, run visited all 1 properties in 529 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N11P1-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N11P1-LTLFireability-00 finished in 70714 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' '!((X(F((G(p1)&&p0))) U G(p1)))'
Support contains 12 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 30811/30811 transitions.
Graph (complete) has 1150 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.407 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 118 transition count 30801
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 111 transition count 30801
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 15 place count 111 transition count 30789
Deduced a syphon composed of 12 places in 39 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 39 place count 99 transition count 30789
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 96 transition count 24645
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 96 transition count 24645
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 96 transition count 24642
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 48 place count 96 transition count 24639
Deduced a syphon composed of 3 places in 30 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 93 transition count 24639
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 12 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 96 place count 72 transition count 24618
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 69 transition count 24626
Applied a total of 102 rules in 6184 ms. Remains 69 /121 variables (removed 52) and now considering 24626/30811 (removed 6185) transitions.
// Phase 1: matrix 24626 rows 69 cols
[2024-06-08 03:55:22] [INFO ] Computed 0 invariants in 514 ms
[2024-06-08 03:55:27] [INFO ] Implicit Places using invariants in 5896 ms returned []
Implicit Place search using SMT only with invariants took 5902 ms to find 0 implicit places.
[2024-06-08 03:55:27] [INFO ] Invariant cache hit.
[2024-06-08 03:55:43] [INFO ] Dead Transitions using invariants and state equation in 16060 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/121 places, 24626/30811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28158 ms. Remains : 69/121 places, 24626/30811 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s10 1) (EQ s15 1) (EQ s20 1) (EQ s26 1) (EQ s32 1) (EQ s38 1) (EQ s44 1) (EQ s50 1) (EQ s56 1) (EQ s62 1) (EQ s68 1)), p0:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 52090 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 3 ms.
FORMULA ResIsolation-PT-N11P1-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N11P1-LTLFireability-01 finished in 38401 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' '!(X(F(p0)))'
Support contains 12 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 30811/30811 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 24667
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 24667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 118 transition count 24666
Applied a total of 7 rules in 689 ms. Remains 118 /121 variables (removed 3) and now considering 24666/30811 (removed 6145) transitions.
// Phase 1: matrix 24666 rows 118 cols
[2024-06-08 03:55:55] [INFO ] Computed 0 invariants in 519 ms
[2024-06-08 03:55:59] [INFO ] Implicit Places using invariants in 4779 ms returned []
Implicit Place search using SMT only with invariants took 4781 ms to find 0 implicit places.
[2024-06-08 03:55:59] [INFO ] Invariant cache hit.
[2024-06-08 03:56:13] [INFO ] Dead Transitions using invariants and state equation in 13724 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/121 places, 24666/30811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19197 ms. Remains : 118/121 places, 24666/30811 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s36 1) (EQ s44 1) (EQ s52 1) (EQ s60 1) (EQ s68 1) (EQ s76 1) (EQ s84 1) (EQ s92 1) (EQ s100 1) (EQ s108 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 78170 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 4 ms.
FORMULA ResIsolation-PT-N11P1-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N11P1-LTLFireability-02 finished in 29421 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(F((!p0 U (p1||G(!p0))))))'
Support contains 19 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 30811/30811 transitions.
Graph (trivial) has 64 edges and 121 vertex of which 6 / 121 are part of one of the 2 SCC in 5 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1144 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.194 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 114 transition count 30797
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 107 transition count 30797
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 16 place count 107 transition count 30785
Deduced a syphon composed of 12 places in 33 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 40 place count 95 transition count 30785
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 93 transition count 26689
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 93 transition count 26689
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 93 transition count 26687
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 93 transition count 26685
Deduced a syphon composed of 2 places in 31 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 91 transition count 26685
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 10 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 88 place count 72 transition count 26666
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 94 place count 69 transition count 26674
Applied a total of 94 rules in 4915 ms. Remains 69 /121 variables (removed 52) and now considering 26674/30811 (removed 4137) transitions.
[2024-06-08 03:56:28] [INFO ] Flow matrix only has 26673 transitions (discarded 1 similar events)
// Phase 1: matrix 26673 rows 69 cols
[2024-06-08 03:56:28] [INFO ] Computed 0 invariants in 505 ms
[2024-06-08 03:56:32] [INFO ] Implicit Places using invariants in 4114 ms returned []
Implicit Place search using SMT only with invariants took 4115 ms to find 0 implicit places.
[2024-06-08 03:56:32] [INFO ] Flow matrix only has 26673 transitions (discarded 1 similar events)
[2024-06-08 03:56:32] [INFO ] Invariant cache hit.
[2024-06-08 03:56:46] [INFO ] Dead Transitions using invariants and state equation in 14405 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/121 places, 26674/30811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23446 ms. Remains : 69/121 places, 26674/30811 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s7 1) (EQ s11 1) (EQ s16 1) (EQ s20 1) (EQ s25 1) (EQ s31 1) (EQ s38 1) (EQ s44 1) (EQ s50 1) (EQ s56 1) (EQ s62 1) (EQ s68 1))) (NO...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 58310 steps with 0 reset in 10001 ms.
Product exploration timeout after 44090 steps with 0 reset in 10002 ms.
Computed a total of 9 stabilizing places and 32 stable transitions
Computed a total of 9 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3408 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1333 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 808 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 276298 steps, run timeout after 15001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 276298 steps, saw 42114 distinct states, run finished after 15001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-08 03:57:28] [INFO ] Flow matrix only has 26673 transitions (discarded 1 similar events)
[2024-06-08 03:57:28] [INFO ] Invariant cache hit.
[2024-06-08 03:57:42] [INFO ] After 14312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-06-08 03:58:59] [INFO ] State equation strengthened by 19964 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-08 03:58:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-08 03:59:00] [INFO ] After 91721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 603 ms.
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 26674/26674 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 69 transition count 26664
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 16 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 24 place count 62 transition count 26657
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 62 transition count 26656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 61 transition count 26656
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 61 transition count 26656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 60 transition count 26655
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 60 transition count 26655
Applied a total of 29 rules in 7395 ms. Remains 60 /69 variables (removed 9) and now considering 26655/26674 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7400 ms. Remains : 60/69 places, 26655/26674 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 26674/26674 transitions.
Applied a total of 0 rules in 776 ms. Remains 69 /69 variables (removed 0) and now considering 26674/26674 (removed 0) transitions.
[2024-06-08 03:59:09] [INFO ] Flow matrix only has 26673 transitions (discarded 1 similar events)
[2024-06-08 03:59:09] [INFO ] Invariant cache hit.
[2024-06-08 03:59:14] [INFO ] Implicit Places using invariants in 4378 ms returned []
Implicit Place search using SMT only with invariants took 4385 ms to find 0 implicit places.
[2024-06-08 03:59:15] [INFO ] Flow matrix only has 26673 transitions (discarded 1 similar events)
[2024-06-08 03:59:15] [INFO ] Invariant cache hit.
[2024-06-08 03:59:33] [INFO ] Dead Transitions using invariants and state equation in 18778 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25742 ms. Remains : 69/69 places, 26674/26674 transitions.
Computed a total of 9 stabilizing places and 32 stable transitions
Computed a total of 9 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4342 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1109 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 210410 steps, run timeout after 19452 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 210410 steps, saw 34157 distinct states, run finished after 19453 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-08 04:00:05] [INFO ] Flow matrix only has 26673 transitions (discarded 1 similar events)
[2024-06-08 04:00:05] [INFO ] Invariant cache hit.
[2024-06-08 04:00:22] [INFO ] After 16526ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-06-08 04:01:34] [INFO ] State equation strengthened by 19964 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-08 04:01:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-08 04:01:34] [INFO ] After 88400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 29 ms.
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 26674/26674 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 69 transition count 26664
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 24 place count 62 transition count 26657
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 62 transition count 26656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 61 transition count 26656
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 61 transition count 26656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 60 transition count 26655
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 60 transition count 26655
Applied a total of 29 rules in 9387 ms. Remains 60 /69 variables (removed 9) and now considering 26655/26674 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9389 ms. Remains : 60/69 places, 26655/26674 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration timeout after 46300 steps with 0 reset in 10002 ms.
Product exploration timeout after 64710 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin3966020633951084478
[2024-06-08 04:02:04] [INFO ] Too many transitions (26674) to apply POR reductions. Disabling POR matrices.
[2024-06-08 04:02:05] [INFO ] Built C files in 991ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3966020633951084478
Running compilation step : cd /tmp/ltsmin3966020633951084478;'/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/ltsmin3966020633951084478;'/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/ltsmin3966020633951084478;'/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 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 26674/26674 transitions.
Applied a total of 0 rules in 995 ms. Remains 69 /69 variables (removed 0) and now considering 26674/26674 (removed 0) transitions.
[2024-06-08 04:02:10] [INFO ] Flow matrix only has 26673 transitions (discarded 1 similar events)
[2024-06-08 04:02:10] [INFO ] Invariant cache hit.
[2024-06-08 04:02:14] [INFO ] Implicit Places using invariants in 4402 ms returned []
Implicit Place search using SMT only with invariants took 4405 ms to find 0 implicit places.
[2024-06-08 04:02:14] [INFO ] Flow matrix only has 26673 transitions (discarded 1 similar events)
[2024-06-08 04:02:14] [INFO ] Invariant cache hit.
[2024-06-08 04:02:33] [INFO ] Dead Transitions using invariants and state equation in 18845 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24266 ms. Remains : 69/69 places, 26674/26674 transitions.
Built C files in :
/tmp/ltsmin1550023637249014871
[2024-06-08 04:02:33] [INFO ] Too many transitions (26674) to apply POR reductions. Disabling POR matrices.
[2024-06-08 04:02:34] [INFO ] Built C files in 1080ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1550023637249014871
Running compilation step : cd /tmp/ltsmin1550023637249014871;'/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/ltsmin1550023637249014871;'/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/ltsmin1550023637249014871;'/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-06-08 04:03:45] [INFO ] Flatten gal took : 47594 ms
[2024-06-08 04:03:53] [INFO ] Flatten gal took : 7428 ms
[2024-06-08 04:03:54] [INFO ] Time to serialize gal into /tmp/LTL18281121335819441940.gal : 1086 ms
[2024-06-08 04:03:54] [INFO ] Time to serialize properties into /tmp/LTL4442039279033074436.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18281121335819441940.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8873797225197514131.hoa' '-atoms' '/tmp/LTL4442039279033074436.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318

BK_STOP 1717819455261

--------------------
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="ResIsolation-PT-N11P1"
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 ResIsolation-PT-N11P1, 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 r649-smll-171774451600073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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