Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 11 23:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 23:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 11 23:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 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 ResAllocation-PT-R015C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716865190931

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R015C002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:59:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:59:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:59:52] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-28 02:59:52] [INFO ] Transformed 60 places.
[2024-05-28 02:59:52] [INFO ] Transformed 32 transitions.
[2024-05-28 02:59:52] [INFO ] Found NUPN structural information;
[2024-05-28 02:59:52] [INFO ] Parsed PT model containing 60 places and 32 transitions and 150 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 45 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 219 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2024-05-28 02:59:52] [INFO ] Computed 30 invariants in 10 ms
[2024-05-28 02:59:53] [INFO ] Implicit Places using invariants in 147 ms returned [31, 33, 35, 45, 53]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 172 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 393 ms. Remains : 55/60 places, 32/32 transitions.
Support contains 45 out of 55 places after structural reductions.
[2024-05-28 02:59:53] [INFO ] Flatten gal took : 19 ms
[2024-05-28 02:59:53] [INFO ] Flatten gal took : 7 ms
[2024-05-28 02:59:53] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 28) seen :23
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 32 rows 55 cols
[2024-05-28 02:59:53] [INFO ] Computed 25 invariants in 4 ms
[2024-05-28 02:59:53] [INFO ] [Real]Absence check using 25 positive place invariants in 9 ms returned sat
[2024-05-28 02:59:53] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-28 02:59:53] [INFO ] After 33ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-28 02:59:53] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 3 ms.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 54 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 52 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 51 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 51 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 49 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 48 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 48 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 46 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 44 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 44 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 42 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 24 place count 40 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 40 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 27 place count 38 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 30 place count 36 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 36 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 33 place count 34 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 36 place count 32 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 37 place count 32 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 39 place count 30 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 41 place count 29 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 42 place count 29 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 44 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 47 place count 25 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 48 place count 25 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 50 place count 23 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 53 place count 21 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 54 place count 21 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 56 place count 19 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 59 place count 17 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 60 place count 17 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 62 place count 15 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 64 place count 14 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 65 place count 14 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 67 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 70 place count 10 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 71 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 73 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 76 place count 6 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 77 place count 6 transition count 4
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t30.t29.t28.t27.t26.t25.t24.t23.t22.t21.t20.t19.t18.t17.t16 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 79 place count 2 transition count 2
Applied a total of 79 rules in 41 ms. Remains 2 /55 variables (removed 53) and now considering 2/32 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 2/55 places, 2/32 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-04 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||(X(X(!p2)) U ((X(X(!p2))&&G(!p3))||X(X(G(!p2)))))))'
Support contains 10 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 02:59:54] [INFO ] Invariant cache hit.
[2024-05-28 02:59:54] [INFO ] Implicit Places using invariants in 54 ms returned [34, 36, 38, 45, 47, 52, 54]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 54 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 48/55 places, 32/32 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 852 ms :[p2, (AND (NOT p1) p2), p2, (AND p2 p3), (AND p2 p3), p2, (AND (NOT p1) p2), (AND (NOT p1) p2 p3), (AND (NOT p1) p2 p3), (AND (NOT p1) p2), true, (AND p2 p3), (NOT p1), (AND (NOT p1) p2 p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=p2, acceptance={} source=2 dest: 10}], [{ cond=p3, acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={} source=3 dest: 11}], [{ cond=p3, acceptance={} source=4 dest: 0}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={1} source=4 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND p3 p2), acceptance={0, 1} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={1} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p3 p2), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=8 dest: 8}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={0} source=8 dest: 9}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={0, 1} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=9 dest: 8}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={0, 1} source=9 dest: 9}], [{ cond=true, acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND p3 p2), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p3) p2), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=13 dest: 14}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=13 dest: 15}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=15 dest: 10}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=15 dest: 12}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=15 dest: 14}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=15 dest: 15}]], initial=9, aps=[p1:(AND (EQ s17 1) (EQ s40 1) (EQ s41 1)), p0:(EQ s30 1), p2:(AND (EQ s13 1) (EQ s37 1) (EQ s38 1)), p3:(AND (EQ s25 1) (EQ s45 1) (EQ s46 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25096 reset in 314 ms.
Entered a terminal (fully accepting) state of product in 95692 steps with 23930 reset in 186 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-00 finished in 1595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((G(p2)&&p1)))))'
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 02:59:56] [INFO ] Invariant cache hit.
[2024-05-28 02:59:56] [INFO ] Implicit Places using invariants in 59 ms returned [34, 36, 38, 40, 43, 45, 50, 52]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 60 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/55 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 47/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-01 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (EQ s21 0) (EQ s41 0) (EQ s42 0)), p2:(AND (EQ s29 1) (EQ s46 1)), p1:(AND (EQ s26 1) (EQ s29 1))], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-01 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 30
Applied a total of 4 rules in 8 ms. Remains 53 /55 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 53 cols
[2024-05-28 02:59:56] [INFO ] Computed 25 invariants in 2 ms
[2024-05-28 02:59:56] [INFO ] Implicit Places using invariants in 87 ms returned [34, 36, 38, 41, 43, 45, 48, 50, 52]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 88 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/55 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 44/55 places, 30/32 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-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 (EQ s7 1) (EQ s32 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-02 finished in 141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p0 U p1))))))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 31
Applied a total of 2 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 31/32 (removed 1) transitions.
// Phase 1: matrix 31 rows 54 cols
[2024-05-28 02:59:56] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 02:59:56] [INFO ] Implicit Places using invariants in 56 ms returned [33, 35, 39, 42, 44, 46, 49, 51, 53]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 56 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/55 places, 31/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 45/55 places, 31/32 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s29 1), p1:(AND (EQ s11 1) (EQ s35 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-03 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2024-05-28 02:59:56] [INFO ] Computed 25 invariants in 2 ms
[2024-05-28 02:59:56] [INFO ] Implicit Places using invariants in 63 ms returned [34, 36, 38, 40, 43, 45, 47, 50, 52, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 64 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 45/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-05 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 (EQ s6 1) (EQ s9 1) (OR (EQ s26 0) (EQ s29 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-05 finished in 167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 02:59:56] [INFO ] Invariant cache hit.
[2024-05-28 02:59:56] [INFO ] Implicit Places using invariants in 64 ms returned [34, 36, 38, 40, 43, 45, 47, 50, 52, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 65 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 45/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(EQ s28 1)], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-06 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 02:59:57] [INFO ] Invariant cache hit.
[2024-05-28 02:59:57] [INFO ] Implicit Places using invariants in 54 ms returned [34, 36, 38, 40, 43, 45, 47, 50, 52, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 55 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/55 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 45/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-07 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 (EQ s6 0) (EQ s9 0))], 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 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 95 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R015C002-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R015C002-LTLFireability-07 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(G(p2))&&p1))))'
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 31
Applied a total of 2 rules in 7 ms. Remains 54 /55 variables (removed 1) and now considering 31/32 (removed 1) transitions.
// Phase 1: matrix 31 rows 54 cols
[2024-05-28 02:59:57] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 02:59:57] [INFO ] Implicit Places using invariants in 58 ms returned [33, 35, 37, 39, 42, 44, 46, 49, 51]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 58 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/55 places, 31/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 45/55 places, 31/32 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s19 1)), p1:(AND (EQ s0 1) (EQ s3 1)), p2:(OR (EQ s29 0) (EQ s44 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-08 finished in 161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (X(G(p2))&&p1)))'
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2024-05-28 02:59:57] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 02:59:57] [INFO ] Implicit Places using invariants in 53 ms returned [34, 38, 40, 43, 45, 47, 50, 54]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 54 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 47/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s27 1) (EQ s45 1) (EQ s46 1)), p0:(AND (EQ s9 1) (EQ s35 1) (EQ s36 1)), p2:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-09 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0&&X(X(p0)))))&&(!p1 U (p2||G(!p1)))))'
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 02:59:57] [INFO ] Invariant cache hit.
[2024-05-28 02:59:57] [INFO ] Implicit Places using invariants in 56 ms returned [36, 38, 40, 43, 45, 47, 50, 52, 54]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/55 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 46/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (NOT p0), (AND (NOT p2) p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 6}, { cond=p0, acceptance={0} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 6}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s7 1) (EQ s34 1) (EQ s35 1))) (NOT (AND (EQ s20 1) (EQ s23 1)))), p1:(AND (EQ s7 1) (EQ s34 1) (EQ s35 1)), p0:(OR (EQ s24 0) (EQ s2...], 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24942 reset in 124 ms.
Product exploration explored 100000 steps with 25075 reset in 132 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 p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 96 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 146 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished Best-First random walk after 149 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=149 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 5 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 46 cols
[2024-05-28 02:59:59] [INFO ] Computed 16 invariants in 3 ms
[2024-05-28 02:59:59] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 02:59:59] [INFO ] Invariant cache hit.
[2024-05-28 02:59:59] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-28 02:59:59] [INFO ] Invariant cache hit.
[2024-05-28 02:59:59] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 46/46 places, 32/32 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 5 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 146 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 204 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=204 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 5 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25026 reset in 91 ms.
Product exploration explored 100000 steps with 24999 reset in 101 ms.
Built C files in :
/tmp/ltsmin13032663288495065629
[2024-05-28 03:00:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13032663288495065629
Running compilation step : cd /tmp/ltsmin13032663288495065629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin13032663288495065629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13032663288495065629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1441245855829851784.hoa' '--buchi-type=spotba'
LTSmin run took 1465 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLFireability-10 finished in 4912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 9 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 30
Applied a total of 4 rules in 6 ms. Remains 53 /55 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 53 cols
[2024-05-28 03:00:02] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 03:00:02] [INFO ] Implicit Places using invariants in 48 ms returned [32, 34, 36, 41, 43, 45, 48, 50, 52]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/55 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57 ms. Remains : 44/55 places, 30/32 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (AND (EQ s6 1) (EQ s9 1)) (AND (EQ s13 1) (EQ s35 1) (EQ s36 1))) (OR (AND (EQ s12 1) (EQ s15 1)) (AND (EQ s20 1) (EQ s23 1)))), p1:(OR (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-11 finished in 139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2024-05-28 03:00:02] [INFO ] Computed 25 invariants in 0 ms
[2024-05-28 03:00:02] [INFO ] Implicit Places using invariants in 44 ms returned [34, 36, 38, 40, 43, 45, 47, 50, 52, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 45 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 45/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-12 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 (EQ s22 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-12 finished in 170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(G(p2))))'
Support contains 8 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 03:00:03] [INFO ] Invariant cache hit.
[2024-05-28 03:00:03] [INFO ] Implicit Places using invariants in 55 ms returned [34, 36, 38, 40, 43, 47, 52]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 57 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 48/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(AND (EQ s29 1) (EQ s47 1)), p1:(OR (AND (EQ s25 1) (EQ s44 1) (EQ s45 1)) (AND (EQ s19 1) (EQ s40 1) (EQ s41 1))), p2:(AND (EQ s19 1) (EQ s40 1) (EQ s...], 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-13 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 31
Applied a total of 2 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 31/32 (removed 1) transitions.
// Phase 1: matrix 31 rows 54 cols
[2024-05-28 03:00:03] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 03:00:03] [INFO ] Implicit Places using invariants in 58 ms returned [33, 35, 37, 39, 42, 44, 46, 49, 51, 53]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 58 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/55 places, 31/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68 ms. Remains : 44/55 places, 31/32 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-14 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s17 1) (EQ s29 0)), p1:(AND (EQ s8 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-14 finished in 209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2024-05-28 03:00:03] [INFO ] Computed 25 invariants in 0 ms
[2024-05-28 03:00:03] [INFO ] Implicit Places using invariants in 64 ms returned [34, 36, 38, 40, 43, 45, 47, 50, 52, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 65 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 45/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-15 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 (NEQ s14 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 87 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R015C002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R015C002-LTLFireability-15 finished in 327 ms.
All properties solved by simple procedures.
Total runtime 11395 ms.

BK_STOP 1716865204910

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ResAllocation-PT-R015C002, 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 r329-tall-171662362500538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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