fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r197-smll-167840343900188
Last Updated
May 14, 2023

About the Execution of ITS-Tools for GlobalResAllocation-COL-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
978.140 32816.00 66610.00 602.80 FFFFFFFFTTFFFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678501412070

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-07
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-11 02:23:35] [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]
[2023-03-11 02:23:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:23:35] [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.
[2023-03-11 02:23:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 02:23:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 688 ms
[2023-03-11 02:23:36] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 133 PT places and 291067.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 02:23:36] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 6 ms.
[2023-03-11 02:23:36] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=0 )
[2023-03-11 02:23:36] [INFO ] Flatten gal took : 28 ms
[2023-03-11 02:23:36] [INFO ] Flatten gal took : 5 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 14
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2023-03-11 02:23:36] [INFO ] Unfolded HLPN to a Petri net with 29 places and 49 transitions 203 arcs in 25 ms.
[2023-03-11 02:23:36] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GlobalResAllocation-COL-07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 49/49 transitions.
Reduce isomorphic (modulo) transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 29 transition count 42
Applied a total of 14 rules in 13 ms. Remains 29 /29 variables (removed 0) and now considering 42/49 (removed 7) transitions.
// Phase 1: matrix 42 rows 29 cols
[2023-03-11 02:23:36] [INFO ] Computed 15 place invariants in 12 ms
[2023-03-11 02:23:36] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
[2023-03-11 02:23:36] [INFO ] Invariant cache hit.
[2023-03-11 02:23:36] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-11 02:23:36] [INFO ] Invariant cache hit.
[2023-03-11 02:23:37] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-11 02:23:37] [INFO ] Invariant cache hit.
[2023-03-11 02:23:37] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/29 places, 42/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 679 ms. Remains : 29/29 places, 42/49 transitions.
Support contains 29 out of 29 places after structural reductions.
[2023-03-11 02:23:37] [INFO ] Flatten gal took : 47 ms
[2023-03-11 02:23:37] [INFO ] Flatten gal took : 32 ms
[2023-03-11 02:23:37] [INFO ] Input system was already deterministic with 42 transitions.
Finished random walk after 50 steps, including 0 resets, run visited all 15 properties in 34 ms. (steps per millisecond=1 )
FORMULA GlobalResAllocation-COL-07-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(F(p0)))))&&F(p1)))'
Support contains 22 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:38] [INFO ] Invariant cache hit.
[2023-03-11 02:23:38] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
[2023-03-11 02:23:38] [INFO ] Invariant cache hit.
[2023-03-11 02:23:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 02:23:38] [INFO ] Invariant cache hit.
[2023-03-11 02:23:38] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-11 02:23:38] [INFO ] Invariant cache hit.
[2023-03-11 02:23:38] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 513 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s7 2)) (AND (GEQ s0 1) (GEQ s7 2)) (AND (GEQ s1 1) (GEQ s7 2)) (AND (GEQ s6 1) (GEQ s7 2)) (AND (GEQ s3 1) (GEQ s7 2)) (AND (G...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 457 ms.
Stack based approach found an accepted trace after 163 steps with 0 reset with depth 164 and stack size 164 in 2 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-00 finished in 1451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 14 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 6 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:39] [INFO ] Invariant cache hit.
[2023-03-11 02:23:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
[2023-03-11 02:23:39] [INFO ] Invariant cache hit.
[2023-03-11 02:23:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-11 02:23:39] [INFO ] Invariant cache hit.
[2023-03-11 02:23:39] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-11 02:23:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:23:39] [INFO ] Invariant cache hit.
[2023-03-11 02:23:40] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s15 1)) (OR (LT s12 1) (LT s19 1)) (OR (LT s10 1) (LT s17 1)) (OR (LT s14 1) (LT s21 1)) (OR (LT s9 1) (LT s16 1)) (OR (LT s11 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 70 reset in 249 ms.
Stack based approach found an accepted trace after 57 steps with 1 reset with depth 54 and stack size 54 in 1 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-01 finished in 799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 22 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:40] [INFO ] Invariant cache hit.
[2023-03-11 02:23:40] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2023-03-11 02:23:40] [INFO ] Invariant cache hit.
[2023-03-11 02:23:40] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 02:23:40] [INFO ] Invariant cache hit.
[2023-03-11 02:23:40] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-11 02:23:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:23:40] [INFO ] Invariant cache hit.
[2023-03-11 02:23:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-02 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 s12 2) (LT s19 2)) (OR (LT s13 2) (LT s20 2)) (OR (LT s8 2) (LT s15 2)) (OR (LT s9 2) (LT s16 2)) (OR (LT s11 2) (LT s18 2)) (OR (LT s14 2...], 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 265 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-02 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((p1 U p2)))))'
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:41] [INFO ] Invariant cache hit.
[2023-03-11 02:23:41] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2023-03-11 02:23:41] [INFO ] Invariant cache hit.
[2023-03-11 02:23:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 02:23:41] [INFO ] Invariant cache hit.
[2023-03-11 02:23:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-11 02:23:41] [INFO ] Invariant cache hit.
[2023-03-11 02:23:41] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NOT (AND (OR (AND (GEQ s8 1) (GEQ s15 1)) (AND (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s14 1) (GEQ s21 1)) (AND (GEQ s9 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 7436 reset in 486 ms.
Stack based approach found an accepted trace after 663 steps with 50 reset with depth 9 and stack size 9 in 6 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-03 finished in 890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p1)))'
Support contains 15 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 2 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 22 cols
[2023-03-11 02:23:41] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-11 02:23:42] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s15 4) (GEQ s16 4) (GEQ s17 4) (GEQ s18 4) (GEQ s19 4) (GEQ s20 4) (GEQ s21 4)), p0:(OR (AND (GEQ s5 1) (GEQ s7 2)) (AND (GEQ s0 1) (GEQ s7 2)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 25 reset in 1 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-04 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 22 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 29 cols
[2023-03-11 02:23:42] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-11 02:23:42] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s7 2)) (AND (GEQ s0 1) (GEQ s7 2)) (AND (GEQ s1 1) (GEQ s7 2)) (AND (GEQ s6 1) (GEQ s7 2)) (AND (GEQ s3 1) (GEQ s7 2)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-05 finished in 447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 22 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-11 02:23:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:23:42] [INFO ] Invariant cache hit.
[2023-03-11 02:23:43] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s12 2) (GEQ s19 2)) (AND (GEQ s13 2) (GEQ s20 2)) (AND (GEQ s8 2) (GEQ s15 2)) (AND (GEQ s9 2) (GEQ s16 2)) (AND (GEQ s11 2) (GEQ s18 2))...], nbAcceptance=3, 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 566 ms.
Stack based approach found an accepted trace after 597 steps with 0 reset with depth 598 and stack size 596 in 5 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-06 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1 U p2))))'
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:43] [INFO ] Invariant cache hit.
[2023-03-11 02:23:43] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-11 02:23:43] [INFO ] Invariant cache hit.
[2023-03-11 02:23:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 02:23:43] [INFO ] Invariant cache hit.
[2023-03-11 02:23:43] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-11 02:23:43] [INFO ] Invariant cache hit.
[2023-03-11 02:23:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s7 3)) (AND (GEQ s5 1) (GEQ s7 3)) (AND (GEQ s6 1) (GEQ s7 3)) (AND (GEQ s4 1) (GEQ s7 3)) (AND (GEQ s1 1) (GEQ s7 3)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 392 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p0) (NOT p1))
Knowledge based reduction with 12 factoid took 729 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-07-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-07-LTLFireability-08 finished in 1842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||(!p1 U (G(!p1)||(!p1&&(!p2||F(!p0)))))) U (p0 U p2)))'
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:45] [INFO ] Invariant cache hit.
[2023-03-11 02:23:45] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
[2023-03-11 02:23:45] [INFO ] Invariant cache hit.
[2023-03-11 02:23:45] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 02:23:45] [INFO ] Invariant cache hit.
[2023-03-11 02:23:45] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-11 02:23:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:23:45] [INFO ] Invariant cache hit.
[2023-03-11 02:23:45] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p2), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(OR (GEQ s22 4) (GEQ s23 4) (GEQ s24 4) (GEQ s25 4) (GEQ s26 4) (GEQ s27 4) (GEQ s28 4)), p0:(OR (AND (GEQ s8 1) (GEQ s15 1)) (AND (GEQ s12 1) (GEQ s19...], 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, null, null][true, true, true]]
Product exploration explored 100000 steps with 10290 reset in 634 ms.
Product exploration explored 100000 steps with 10327 reset in 867 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 p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 p1)), (X (AND (NOT p2) p0)), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 8 factoid took 659 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 p1)), (X (AND (NOT p2) p0)), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 501 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p2), (NOT p2)]
[2023-03-11 02:23:49] [INFO ] Invariant cache hit.
[2023-03-11 02:23:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 02:23:49] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-11 02:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:23:49] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 02:23:49] [INFO ] Computed and/alt/rep : 14/84/14 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 02:23:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:23:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-11 02:23:49] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-11 02:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:23:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 02:23:49] [INFO ] Computed and/alt/rep : 14/84/14 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-11 02:23:49] [INFO ] Added : 8 causal constraints over 2 iterations in 53 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:49] [INFO ] Invariant cache hit.
[2023-03-11 02:23:49] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-03-11 02:23:49] [INFO ] Invariant cache hit.
[2023-03-11 02:23:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 02:23:49] [INFO ] Invariant cache hit.
[2023-03-11 02:23:49] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-11 02:23:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:23:49] [INFO ] Invariant cache hit.
[2023-03-11 02:23:49] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 29/29 places, 42/42 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 p2) p1), (X (AND p0 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2) p1)), true, (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge based reduction with 8 factoid took 632 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2) p1)), true, (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 571 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p2), (NOT p2)]
[2023-03-11 02:23:51] [INFO ] Invariant cache hit.
[2023-03-11 02:23:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-11 02:23:51] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-11 02:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:23:51] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-11 02:23:51] [INFO ] Computed and/alt/rep : 14/84/14 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-11 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:23:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-11 02:23:51] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-11 02:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:23:51] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-11 02:23:51] [INFO ] Computed and/alt/rep : 14/84/14 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-11 02:23:51] [INFO ] Added : 8 causal constraints over 2 iterations in 39 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10310 reset in 577 ms.
Product exploration explored 100000 steps with 10296 reset in 572 ms.
Built C files in :
/tmp/ltsmin16001683109167528740
[2023-03-11 02:23:52] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2023-03-11 02:23:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:23:52] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2023-03-11 02:23:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:23:52] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2023-03-11 02:23:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:23:52] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16001683109167528740
Running compilation step : cd /tmp/ltsmin16001683109167528740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 492 ms.
Running link step : cd /tmp/ltsmin16001683109167528740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin16001683109167528740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3604961870572906801.hoa' '--buchi-type=spotba'
LTSmin run took 5113 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-07-LTLFireability-09 finished in 13171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0) U (G(p2)||p1))))))'
Support contains 15 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 2 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 22 cols
[2023-03-11 02:23:58] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 02:23:58] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2023-03-11 02:23:58] [INFO ] Invariant cache hit.
[2023-03-11 02:23:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 02:23:58] [INFO ] Invariant cache hit.
[2023-03-11 02:23:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-11 02:23:58] [INFO ] Invariant cache hit.
[2023-03-11 02:23:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (GEQ s15 4) (GEQ s16 4) (GEQ s17 4) (GEQ s18 4) (GEQ s19 4) (GEQ s20 4) (GEQ s21 4)), p2:(OR (AND (GEQ s5 1) (GEQ s7 2)) (AND (GEQ s0 1) (GEQ s7 2)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-10 finished in 486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p1)&&p0))||(G(!p2)&&X(p1)&&(p3||G(p4))))))'
Support contains 15 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 2 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:23:59] [INFO ] Invariant cache hit.
[2023-03-11 02:23:59] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
[2023-03-11 02:23:59] [INFO ] Invariant cache hit.
[2023-03-11 02:23:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 02:23:59] [INFO ] Invariant cache hit.
[2023-03-11 02:23:59] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-11 02:23:59] [INFO ] Invariant cache hit.
[2023-03-11 02:23:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) p2)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) p2 (NOT p4)) (AND (NOT p1) (NOT p4))), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p1) p2 (NOT p4)))]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2 p1) (AND p0 (NOT p3) (NOT p4) p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3) (NOT p4)) (AND p2 (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2) p3 p1) (AND p0 (NOT p2) p4 p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2) p3 p1) (AND p0 (NOT p2) p4 p1)), acceptance={1} source=0 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))), acceptance={1, 2} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3) p4 p1), acceptance={0} source=0 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3) p4) (AND (NOT p2) (NOT p3) p4 (NOT p1))), acceptance={0, 2} source=0 dest: 3}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p4 (NOT p1)), acceptance={0, 2} source=1 dest: 3}], [{ cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={1, 2} source=2 dest: 2}], [{ cond=(OR (AND p0 p2 (NOT p4) p1) (AND p0 (NOT p3) (NOT p4) p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)) (AND p2 (NOT p4) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p3 (NOT p4) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p3 (NOT p4) p1), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p1))), acceptance={1, 2} source=3 dest: 2}, { cond=(OR (AND p0 p2 p4 p1) (AND p0 (NOT p3) p4 p1)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2 p4) (AND (NOT p0) (NOT p3) p4) (AND p2 p4 (NOT p1)) (AND (NOT p3) p4 (NOT p1))), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p3 p4 p1), acceptance={0} source=3 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2) p3 p4) (AND (NOT p2) p3 p4 (NOT p1))), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p3 p4 p1), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) p3 p4) (AND (NOT p2) p3 p4 (NOT p1))), acceptance={2} source=3 dest: 5}], [{ cond=(OR (AND p2 (NOT p4) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p2) p3 (NOT p4) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p4) (NOT p1)), acceptance={1, 2} source=4 dest: 2}, { cond=(OR (AND p2 p4 (NOT p1)) (AND (NOT p3) p4 (NOT p1))), acceptance={0, 2} source=4 dest: 3}, { cond=(AND (NOT p2) p3 p4 (NOT p1)), acceptance={0, 2} source=4 dest: 4}, { cond=(AND (NOT p2) p3 p4 (NOT p1)), acceptance={2} source=4 dest: 5}], [{ cond=(AND p0 p2 (NOT p4) p1), acceptance={0, 1} source=5 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p4)) (AND p2 (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p4) p1), acceptance={1} source=5 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p4) (NOT p1))), acceptance={1, 2} source=5 dest: 2}, { cond=(AND p0 p2 p4 p1), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p2 p4) (AND p2 p4 (NOT p1))), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p4 p1), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) p4) (AND (NOT p2) p4 (NOT p1))), acceptance={2} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s5 1) (LT s7 2)) (OR (LT s0 1) (LT s7 2)) (OR (LT s1 1) (LT s7 2)) (OR (LT s6 1) (LT s7 2)) (OR (LT s3 1) (LT s7 2)) (OR (LT s4 1) (LT s7 ...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5002 reset in 1575 ms.
Stack based approach found an accepted trace after 89 steps with 6 reset with depth 7 and stack size 7 in 2 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-11 finished in 2391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&X(G(p0)))))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 5 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:24:01] [INFO ] Invariant cache hit.
[2023-03-11 02:24:01] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
[2023-03-11 02:24:01] [INFO ] Invariant cache hit.
[2023-03-11 02:24:01] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 02:24:01] [INFO ] Invariant cache hit.
[2023-03-11 02:24:01] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-11 02:24:01] [INFO ] Invariant cache hit.
[2023-03-11 02:24:01] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, true, (NOT p0), true]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s7 4)) (OR (LT s5 1) (LT s7 4)) (OR (LT s6 1) (LT s7 4)) (OR (LT s4 1) (LT s7 4)) (OR (LT s1 1) (LT s7 4)) (OR (LT s2 1) (LT s7 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-13 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
[2023-03-11 02:24:02] [INFO ] Invariant cache hit.
[2023-03-11 02:24:02] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
[2023-03-11 02:24:02] [INFO ] Invariant cache hit.
[2023-03-11 02:24:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 02:24:02] [INFO ] Invariant cache hit.
[2023-03-11 02:24:02] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-11 02:24:02] [INFO ] Invariant cache hit.
[2023-03-11 02:24:02] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s0 1) (LT s7 1)) (OR (LT s6 1) (LT s7 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s4 1) (LT s7 1)) (OR (LT s5 1) (LT s7 1)) (OR (LT s2 1) (LT s7 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Product exploration explored 100000 steps with 50000 reset in 297 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) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-07-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-07-LTLFireability-14 finished in 1099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 14 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 29 cols
[2023-03-11 02:24:03] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-11 02:24:03] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
[2023-03-11 02:24:03] [INFO ] Invariant cache hit.
[2023-03-11 02:24:03] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-11 02:24:03] [INFO ] Invariant cache hit.
[2023-03-11 02:24:03] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-11 02:24:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:24:03] [INFO ] Invariant cache hit.
[2023-03-11 02:24:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s12 2) (GEQ s19 2)) (AND (GEQ s13 2) (GEQ s20 2)) (AND (GEQ s8 2) (GEQ s15 2)) (AND (GEQ s9 2) (GEQ s16 2)) (AND (GEQ s11 2) (GEQ s18 2))...], 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 42476 reset in 349 ms.
Stack based approach found an accepted trace after 969 steps with 420 reset with depth 3 and stack size 3 in 4 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-15 finished in 724 ms.
All properties solved by simple procedures.
Total runtime 28688 ms.

BK_STOP 1678501444886

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="GlobalResAllocation-COL-07"
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-5348"
echo " Executing tool itstools"
echo " Input is GlobalResAllocation-COL-07, 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 r197-smll-167840343900188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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