Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 9.2K Apr 30 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 GlobalResAllocation-COL-09-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652682914667

Running Version 202205111006
[2022-05-16 06:35:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 06:35:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:35:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 06:35:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 06:35:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1396 ms
[2022-05-16 06:35:18] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 207 PT places and 1003437.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 06:35:18] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 10 ms.
[2022-05-16 06:35:18] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GlobalResAllocation-COL-09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=0 )
[2022-05-16 06:35:19] [INFO ] Flatten gal took : 29 ms
[2022-05-16 06:35:19] [INFO ] Flatten gal took : 4 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 18
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2022-05-16 06:35:19] [INFO ] Unfolded HLPN to a Petri net with 37 places and 63 transitions 261 arcs in 28 ms.
[2022-05-16 06:35:19] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GlobalResAllocation-COL-09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 63/63 transitions.
Reduce isomorphic (modulo) transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 37 transition count 54
Applied a total of 18 rules in 19 ms. Remains 37 /37 variables (removed 0) and now considering 54/63 (removed 9) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:19] [INFO ] Computed 19 place invariants in 14 ms
[2022-05-16 06:35:19] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:19] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 06:35:19] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:19] [INFO ] Computed 19 place invariants in 9 ms
[2022-05-16 06:35:19] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:19] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 06:35:19] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/37 places, 54/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/63 transitions.
Support contains 37 out of 37 places after structural reductions.
[2022-05-16 06:35:19] [INFO ] Flatten gal took : 23 ms
[2022-05-16 06:35:19] [INFO ] Flatten gal took : 21 ms
[2022-05-16 06:35:20] [INFO ] Input system was already deterministic with 54 transitions.
Finished random walk after 66 steps, including 0 resets, run visited all 13 properties in 17 ms. (steps per millisecond=3 )
FORMULA GlobalResAllocation-COL-09-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(p0))))'
Support contains 28 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Applied a total of 0 rules in 10 ms. Remains 37 /37 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:20] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 06:35:20] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:20] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-16 06:35:20] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:20] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-16 06:35:20] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-05-16 06:35:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:20] [INFO ] Computed 19 place invariants in 19 ms
[2022-05-16 06:35:21] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s5 1) (GEQ s9 4)) (AND (GEQ s0 1) (GEQ s9 4)) (AND (GEQ s1 1) (GEQ s9 4)) (AND (GEQ s7 1) (GEQ s9 4)) (AND (GEQ s3 1) (GEQ s9 4)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11391 reset in 758 ms.
Stack based approach found an accepted trace after 2668 steps with 298 reset with depth 20 and stack size 20 in 13 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-01 finished in 1469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(X(!(G(F(p1)) U F(!p0))))))'
Support contains 18 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Applied a total of 0 rules in 8 ms. Remains 37 /37 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:22] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 06:35:22] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:22] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 06:35:22] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:22] [INFO ] Computed 19 place invariants in 12 ms
[2022-05-16 06:35:22] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-05-16 06:35:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:22] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 06:35:22] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s15 1) (LT s24 1)) (OR (LT s16 1) (LT s25 1)) (OR (LT s17 1) (LT s26 1)) (OR (LT s18 1) (LT s27 1)) (OR (LT s10 1) (LT s19 1)) (OR (LT s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 473 ms.
Stack based approach found an accepted trace after 260 steps with 0 reset with depth 261 and stack size 261 in 9 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-04 finished in 846 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(p0 U F(!p1)))))'
Support contains 10 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Applied a total of 0 rules in 4 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:22] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:35:22] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:22] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 06:35:23] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:35:23] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-16 06:35:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:35:23] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s9 3)) (AND (GEQ s6 1) (GEQ s9 3)) (AND (GEQ s3 1) (GEQ s9 3)) (AND (GEQ s4 1) (GEQ s9 3)) (AND (GEQ s7 1) (GEQ s9 3)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 394 ms.
Stack based approach found an accepted trace after 78 steps with 0 reset with depth 79 and stack size 77 in 1 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-05 finished in 673 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 10 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 28 transition count 54
Applied a total of 9 rules in 3 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:35:23] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:23] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:35:23] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:35:23] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:23] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:35:23] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/37 places, 54/54 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s5 1) (LT s9 4)) (OR (LT s0 1) (LT s9 4)) (OR (LT s1 1) (LT s9 4)) (OR (LT s7 1) (LT s9 4)) (OR (LT s3 1) (LT s9 4)) (OR (LT s6 1) (LT s9 ...], 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, null][false, false, false]]
Product exploration explored 100000 steps with 10809 reset in 727 ms.
Stack based approach found an accepted trace after 343 steps with 34 reset with depth 17 and stack size 17 in 2 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-07 finished in 1134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((X(p0) U p1)||(F(p2) U (X(p0)||p3)))))))'
Support contains 37 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:24] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 06:35:24] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:24] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 06:35:24] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:24] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:24] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:24] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:24] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s24 1)) (AND (GEQ s16 1) (GEQ s25 1)) (AND (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s18 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s19 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 467 ms.
Product exploration explored 100000 steps with 11 reset in 429 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 12 factoid took 593 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:28] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:28] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-16 06:35:28] [INFO ] [Real]Absence check using 10 positive and 9 generalized place invariants in 4 ms returned sat
[2022-05-16 06:35:28] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-16 06:35:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-16 06:35:28] [INFO ] [Nat]Absence check using 10 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-16 06:35:28] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F p2)]
Knowledge based reduction with 15 factoid took 1021 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Support contains 37 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:29] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:29] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:29] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:29] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:29] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:29] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:29] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 06:35:29] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/54 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 397 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Finished random walk after 174 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F (AND (NOT p3) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 5 factoid took 396 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 3 reset in 440 ms.
Product exploration explored 100000 steps with 8 reset in 459 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))]
Support contains 37 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:32] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:32] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
[2022-05-16 06:35:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:32] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:33] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/54 transitions.
Product exploration explored 100000 steps with 6 reset in 326 ms.
Product exploration explored 100000 steps with 11 reset in 477 ms.
Built C files in :
/tmp/ltsmin8779564491334720650
[2022-05-16 06:35:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8779564491334720650
Running compilation step : cd /tmp/ltsmin8779564491334720650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 343 ms.
Running link step : cd /tmp/ltsmin8779564491334720650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8779564491334720650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased659265249335560806.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 37 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:49] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:49] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:49] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 06:35:49] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:49] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:49] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:35:49] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:35:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/54 transitions.
Built C files in :
/tmp/ltsmin15018239539573303450
[2022-05-16 06:35:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15018239539573303450
Running compilation step : cd /tmp/ltsmin15018239539573303450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 213 ms.
Running link step : cd /tmp/ltsmin15018239539573303450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15018239539573303450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12606417091828006690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:36:04] [INFO ] Flatten gal took : 10 ms
[2022-05-16 06:36:04] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:36:04] [INFO ] Time to serialize gal into /tmp/LTL12411307806486467921.gal : 3 ms
[2022-05-16 06:36:04] [INFO ] Time to serialize properties into /tmp/LTL9246372672188538547.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12411307806486467921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9246372672188538547.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1241130...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X(((X("((((((Processes_5>=1)&&(Resources_0>=4))||((Processes_0>=1)&&(Resources_0>=4)))||(((Processes_1>=1)&&(Resources_0>=4))||...1706
Formula 0 simplified : !FGX((X"((((((Processes_5>=1)&&(Resources_0>=4))||((Processes_0>=1)&&(Resources_0>=4)))||(((Processes_1>=1)&&(Resources_0>=4))||((Pr...1681
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.342174,25852,1,0,8,40527,64,0,1856,18273,31
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-09-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GlobalResAllocation-COL-09-LTLFireability-09 finished in 40065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(!((X(p1)||p0) U !G(p1)))))&&F(p2)))'
Support contains 10 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Applied a total of 0 rules in 3 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:04] [INFO ] Computed 10 place invariants in 11 ms
[2022-05-16 06:36:04] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:04] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:04] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-16 06:36:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:04] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (OR (LT s0 1) (LT s9 3)) (OR (LT s6 1) (LT s9 3)) (OR (LT s3 1) (LT s9 3)) (OR (LT s4 1) (LT s9 3)) (OR (LT s7 1) (LT s9 3)) (OR (LT s5 1) (LT s9 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 258 ms.
Stack based approach found an accepted trace after 125 steps with 5 reset with depth 64 and stack size 64 in 1 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-10 finished in 582 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 28 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:36:05] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:36:05] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:36:05] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:36:05] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:36:05] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:36:05] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:36:05] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 06:36:05] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (OR (LT s4 1) (LT s9 2)) (OR (LT s3 1) (LT s9 2)) (OR (LT s5 1) (LT s9 2)) (OR (LT s8 1) (LT s9 2)) (OR (LT s6 1) (LT s9 2)) (OR (LT s7 1) (LT...], 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 explored 100000 steps with 11555 reset in 378 ms.
Stack based approach found an accepted trace after 564 steps with 67 reset with depth 5 and stack size 5 in 7 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-11 finished in 701 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!X(!p0) U F(!X(p1))))&&F(p0)))'
Support contains 10 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Applied a total of 0 rules in 3 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:06] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:06] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:06] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 06:36:06] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:06] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-16 06:36:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:06] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:06] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s9 2)) (AND (GEQ s3 1) (GEQ s9 2)) (AND (GEQ s5 1) (GEQ s9 2)) (AND (GEQ s8 1) (GEQ s9 2)) (AND (GEQ s6 1) (GEQ s9 2)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10550 reset in 284 ms.
Stack based approach found an accepted trace after 5074 steps with 543 reset with depth 9 and stack size 9 in 16 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-12 finished in 627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0) U F(p0))||p1)))'
Support contains 19 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Applied a total of 0 rules in 3 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:06] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:06] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:06] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:06] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:06] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-16 06:36:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:06] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:06] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s26 4) (GEQ s27 4) (GEQ s19 4) (GEQ s20 4) (GEQ s21 4) (GEQ s22 4) (GEQ s23 4) (GEQ s24 4) (GEQ s25 4)), p1:(AND (OR (LT s4 1) (LT s9 1)) (OR ...], 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]]
Product exploration explored 100000 steps with 10512 reset in 562 ms.
Product exploration explored 100000 steps with 10536 reset in 493 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:08] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:08] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-05-16 06:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:36:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 06:36:08] [INFO ] Computed and/alt/rep : 18/72/18 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 06:36:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:36:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-16 06:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:36:08] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 06:36:08] [INFO ] Computed and/alt/rep : 18/72/18 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 06:36:08] [INFO ] Added : 12 causal constraints over 4 iterations in 60 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 19 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:08] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:08] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:08] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:08] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:08] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:08] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-16 06:36:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:08] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 06:36:08] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 54/54 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:09] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:09] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-05-16 06:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:36:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 06:36:09] [INFO ] Computed and/alt/rep : 18/72/18 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 06:36:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:36:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-16 06:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:36:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-16 06:36:09] [INFO ] Computed and/alt/rep : 18/72/18 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 06:36:09] [INFO ] Added : 12 causal constraints over 4 iterations in 48 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10562 reset in 381 ms.
Product exploration explored 100000 steps with 10522 reset in 457 ms.
Built C files in :
/tmp/ltsmin12641107312448671250
[2022-05-16 06:36:10] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2022-05-16 06:36:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:36:10] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2022-05-16 06:36:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:36:10] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2022-05-16 06:36:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:36:10] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12641107312448671250
Running compilation step : cd /tmp/ltsmin12641107312448671250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin12641107312448671250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12641107312448671250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6629830630820089929.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 19 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:25] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:25] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:25] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:25] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:25] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:25] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 06:36:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:25] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:25] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 54/54 transitions.
Built C files in :
/tmp/ltsmin1349022410874716151
[2022-05-16 06:36:25] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2022-05-16 06:36:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:36:25] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2022-05-16 06:36:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:36:25] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2022-05-16 06:36:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:36:25] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1349022410874716151
Running compilation step : cd /tmp/ltsmin1349022410874716151;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 302 ms.
Running link step : cd /tmp/ltsmin1349022410874716151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1349022410874716151;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3228840700415929044.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:36:41] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:36:41] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:36:41] [INFO ] Time to serialize gal into /tmp/LTL15809475648310723382.gal : 2 ms
[2022-05-16 06:36:41] [INFO ] Time to serialize properties into /tmp/LTL4152353010214452643.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15809475648310723382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4152353010214452643.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1580947...267
Read 1 LTL properties
Checking formula 0 : !((F(((X("(((((pr_released_7>=4)||(pr_released_8>=4))||((pr_released_0>=4)||(pr_released_1>=4)))||(((pr_released_2>=4)||(pr_released_3...778
Formula 0 simplified : !F("((((((Processes_4<1)||(Resources_0<1))&&((Processes_3<1)||(Resources_0<1)))&&(((Processes_5<1)||(Resources_0<1))&&((Processes_6<...769
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
101 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.02888,42448,1,0,94,142646,24,10,1255,128356,213
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-09-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GlobalResAllocation-COL-09-LTLFireability-13 finished in 35479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0) U (p1 U X(p2)))&&F(X(p3))))'
Support contains 28 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:36:42] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:36:42] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:36:42] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 06:36:42] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:36:42] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 06:36:42] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:36:42] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 06:36:42] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p3) p2), p2, p2, p2, (NOT p3), (AND p0 p2), true, (AND p0 p2), (AND p0 (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s24 1)) (AND (GEQ s16 1) (GEQ s25 1)) (AND (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s18 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s19 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-14 finished in 653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 28 transition count 54
Applied a total of 9 rules in 2 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:42] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:42] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:42] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:36:42] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:42] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:42] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:36:42] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:36:43] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/37 places, 54/54 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLFireability-15 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:(AND (OR (AND (GEQ s4 1) (GEQ s9 2)) (AND (GEQ s3 1) (GEQ s9 2)) (AND (GEQ s5 1) (GEQ s9 2)) (AND (GEQ s8 1) (GEQ s9 2)) (AND (GEQ s6 1) (GEQ s9 2)) (A...], 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]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-09-LTLFireability-15 finished in 346 ms.
All properties solved by simple procedures.
Total runtime 86134 ms.

BK_STOP 1652683003317

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GlobalResAllocation-COL-09, 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 r114-smll-165264477100036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-09.tgz
mv GlobalResAllocation-COL-09 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 ;