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-171662362500518.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-R003C050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362500518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 23:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 23:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 23:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 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 360K 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-R003C050-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716864512836

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-R003C050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:48:34] [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:48:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:48:34] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-28 02:48:34] [INFO ] Transformed 300 places.
[2024-05-28 02:48:34] [INFO ] Transformed 200 transitions.
[2024-05-28 02:48:34] [INFO ] Found NUPN structural information;
[2024-05-28 02:48:34] [INFO ] Parsed PT model containing 300 places and 200 transitions and 894 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R003C050-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 25 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2024-05-28 02:48:34] [INFO ] Computed 150 invariants in 18 ms
[2024-05-28 02:48:35] [INFO ] Implicit Places using invariants in 507 ms returned [295, 297]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 534 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 298/300 places, 200/200 transitions.
Applied a total of 0 rules in 15 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 575 ms. Remains : 298/300 places, 200/200 transitions.
Support contains 54 out of 298 places after structural reductions.
[2024-05-28 02:48:35] [INFO ] Flatten gal took : 45 ms
[2024-05-28 02:48:35] [INFO ] Flatten gal took : 19 ms
[2024-05-28 02:48:35] [INFO ] Input system was already deterministic with 200 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 298 cols
[2024-05-28 02:48:35] [INFO ] Computed 148 invariants in 8 ms
[2024-05-28 02:48:36] [INFO ] [Real]Absence check using 148 positive place invariants in 25 ms returned sat
[2024-05-28 02:48:36] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA ResAllocation-PT-R003C050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X((F(p0)&&X(p1)&&F(p2))))'
Support contains 5 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 02:48:36] [INFO ] Invariant cache hit.
[2024-05-28 02:48:36] [INFO ] Implicit Places using invariants in 201 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 297/298 places, 200/200 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 359 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s199 1) (NEQ s205 1)), p2:(AND (EQ s163 1) (EQ s169 1)), p1:(EQ s64 1)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-01 finished in 758 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 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 249 transition count 151
Applied a total of 98 rules in 39 ms. Remains 249 /298 variables (removed 49) and now considering 151/200 (removed 49) transitions.
// Phase 1: matrix 151 rows 249 cols
[2024-05-28 02:48:37] [INFO ] Computed 148 invariants in 2 ms
[2024-05-28 02:48:37] [INFO ] Implicit Places using invariants in 249 ms returned [248]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 251 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/298 places, 151/200 transitions.
Applied a total of 0 rules in 13 ms. Remains 248 /248 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 303 ms. Remains : 248/298 places, 151/200 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-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 s11 1) (EQ s16 1) (EQ s17 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 100 steps with 0 reset in 3 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-02 finished in 355 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)))'
Support contains 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 92 rules applied. Total rules applied 92 place count 252 transition count 154
Applied a total of 92 rules in 44 ms. Remains 252 /298 variables (removed 46) and now considering 154/200 (removed 46) transitions.
// Phase 1: matrix 154 rows 252 cols
[2024-05-28 02:48:37] [INFO ] Computed 148 invariants in 1 ms
[2024-05-28 02:48:37] [INFO ] Implicit Places using invariants in 218 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 219 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/298 places, 154/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 251/298 places, 154/200 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s118 1) (NEQ s124 1) (AND (EQ s66 1) (EQ s72 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1472 reset in 675 ms.
Stack based approach found an accepted trace after 24609 steps with 355 reset with depth 29 and stack size 29 in 175 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-03 finished in 1207 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((p0&&(F(p1) U G(p2))))))'
Support contains 8 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2024-05-28 02:48:38] [INFO ] Computed 148 invariants in 2 ms
[2024-05-28 02:48:38] [INFO ] Implicit Places using invariants in 203 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 27 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s199 0) (EQ s205 0)), p2:(AND (EQ s63 1) (EQ s69 1) (EQ s70 1)), p1:(AND (EQ s109 1) (EQ s115 1) (EQ s116 1))], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-05 finished in 539 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(p1)&&X(p2))))'
Support contains 5 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 02:48:39] [INFO ] Invariant cache hit.
[2024-05-28 02:48:39] [INFO ] Implicit Places using invariants in 170 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s47 1) (NEQ s50 1) (NEQ s53 1)), p1:(AND (EQ s271 1) (EQ s277 1)), p2:(OR (EQ s271 0) (EQ s277 0))], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1032 reset in 561 ms.
Product exploration explored 100000 steps with 1037 reset in 595 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 p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p2)), (X p2), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 311 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p2)), (X p2), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p2), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 411 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-28 02:48:42] [INFO ] Computed 147 invariants in 2 ms
[2024-05-28 02:48:42] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 02:48:42] [INFO ] Invariant cache hit.
[2024-05-28 02:48:42] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-28 02:48:42] [INFO ] Invariant cache hit.
[2024-05-28 02:48:42] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 297/297 places, 200/200 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 p2) p0), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 2186 steps, including 21 resets, run visited all 2 properties in 21 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (F p2), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1020 reset in 548 ms.
Product exploration explored 100000 steps with 1035 reset in 579 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 0 with 47 rules applied. Total rules applied 47 place count 297 transition count 200
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 47 rules in 26 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 02:48:45] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 200 rows 297 cols
[2024-05-28 02:48:45] [INFO ] Computed 147 invariants in 2 ms
[2024-05-28 02:48:45] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 297/297 places, 200/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 297/297 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin3935340613659469386
[2024-05-28 02:48:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3935340613659469386
Running compilation step : cd /tmp/ltsmin3935340613659469386;'/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 474 ms.
Running link step : cd /tmp/ltsmin3935340613659469386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3935340613659469386;'/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/stateBased11790930282871190156.hoa' '--buchi-type=spotba'
LTSmin run took 595 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R003C050-LTLFireability-07 finished in 7375 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' '!(((p0 U X(p1))||G(p2)))'
Support contains 8 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2024-05-28 02:48:46] [INFO ] Computed 148 invariants in 4 ms
[2024-05-28 02:48:46] [INFO ] Implicit Places using invariants in 162 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(OR (NOT (AND (EQ s227 1) (EQ s230 1) (EQ s233 1))) (AND (EQ s249 1) (EQ s252 1) (EQ s255 1))), p2:(EQ s28 1), p1:(OR (EQ s208 1) (AND (EQ s249 1) (EQ ...], 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]]
Stuttering criterion allowed to conclude after 189 steps with 3 reset in 6 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-08 finished in 437 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))&&F(p1)))'
Support contains 6 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 02:48:47] [INFO ] Invariant cache hit.
[2024-05-28 02:48:47] [INFO ] Implicit Places using invariants in 158 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s81 0) (EQ s84 0) (EQ s87 0)), p1:(OR (EQ s153 0) (EQ s156 0) (EQ s159 0))], 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 4 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-10 finished in 318 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 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 92 rules applied. Total rules applied 92 place count 252 transition count 154
Applied a total of 92 rules in 17 ms. Remains 252 /298 variables (removed 46) and now considering 154/200 (removed 46) transitions.
// Phase 1: matrix 154 rows 252 cols
[2024-05-28 02:48:47] [INFO ] Computed 148 invariants in 2 ms
[2024-05-28 02:48:47] [INFO ] Implicit Places using invariants in 157 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/298 places, 154/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 251 /251 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 251/298 places, 154/200 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=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:(OR (NEQ s168 1) (NEQ s174 1)), p1:(AND (EQ s65 1) (EQ s70 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 101 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-11 finished in 331 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(F(p0))||(F(G(p1))&&F(p2)))))'
Support contains 7 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2024-05-28 02:48:47] [INFO ] Computed 148 invariants in 1 ms
[2024-05-28 02:48:47] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-28 02:48:47] [INFO ] Invariant cache hit.
[2024-05-28 02:48:48] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-28 02:48:48] [INFO ] Invariant cache hit.
[2024-05-28 02:48:48] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 298/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s196 1) (EQ s139 1) (EQ s145 1)), p0:(AND (EQ s293 1) (EQ s297 1)), p1:(OR (EQ s67 0) (EQ s73 0))], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 338 steps with 3 reset in 8 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-13 finished in 884 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(G(p1)) U G(p1)))&&p0)))'
Support contains 3 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-28 02:48:48] [INFO ] Invariant cache hit.
[2024-05-28 02:48:48] [INFO ] Implicit Places using invariants in 166 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 168 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/298 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 297/298 places, 200/200 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLFireability-14 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: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s113 1) (EQ s119 1)), p1:(EQ s100 1)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLFireability-14 finished in 380 ms.
All properties solved by simple procedures.
Total runtime 14557 ms.

BK_STOP 1716864529894

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-R003C050"
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-R003C050, 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-171662362500518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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