Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414800298.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414800298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 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 BusinessProcesses-PT-04-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716650382823

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=BusinessProcesses-PT-04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:19:44] [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-25 15:19:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:19:44] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-25 15:19:44] [INFO ] Transformed 288 places.
[2024-05-25 15:19:44] [INFO ] Transformed 283 transitions.
[2024-05-25 15:19:44] [INFO ] Found NUPN structural information;
[2024-05-25 15:19:44] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 245 transition count 243
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 245 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 245 transition count 242
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 95 place count 230 transition count 227
Iterating global reduction 2 with 15 rules applied. Total rules applied 110 place count 230 transition count 227
Applied a total of 110 rules in 51 ms. Remains 230 /286 variables (removed 56) and now considering 227/281 (removed 54) transitions.
// Phase 1: matrix 227 rows 230 cols
[2024-05-25 15:19:45] [INFO ] Computed 41 invariants in 20 ms
[2024-05-25 15:19:46] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2024-05-25 15:19:46] [INFO ] Invariant cache hit.
[2024-05-25 15:19:46] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2024-05-25 15:19:46] [INFO ] Invariant cache hit.
[2024-05-25 15:19:47] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/286 places, 227/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2009 ms. Remains : 230/286 places, 227/281 transitions.
Support contains 51 out of 230 places after structural reductions.
[2024-05-25 15:19:47] [INFO ] Flatten gal took : 109 ms
[2024-05-25 15:19:47] [INFO ] Flatten gal took : 36 ms
[2024-05-25 15:19:47] [INFO ] Input system was already deterministic with 227 transitions.
Support contains 50 out of 230 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 39) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 15:19:48] [INFO ] Invariant cache hit.
[2024-05-25 15:19:48] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-25 15:19:48] [INFO ] [Real]Absence check using 20 positive and 21 generalized place invariants in 66 ms returned sat
[2024-05-25 15:19:49] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:3
[2024-05-25 15:19:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-25 15:19:49] [INFO ] [Nat]Absence check using 20 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-25 15:19:49] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-04-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 207 stabilizing places and 205 stable transitions
Graph (complete) has 568 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
FORMULA BusinessProcesses-PT-04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 222 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 222 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 220 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 220 transition count 217
Applied a total of 20 rules in 17 ms. Remains 220 /230 variables (removed 10) and now considering 217/227 (removed 10) transitions.
// Phase 1: matrix 217 rows 220 cols
[2024-05-25 15:19:50] [INFO ] Computed 41 invariants in 4 ms
[2024-05-25 15:19:50] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-25 15:19:50] [INFO ] Invariant cache hit.
[2024-05-25 15:19:50] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-05-25 15:19:50] [INFO ] Invariant cache hit.
[2024-05-25 15:19:50] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/230 places, 217/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 220/230 places, 217/227 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 249 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s184 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 342 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Computed a total of 197 stabilizing places and 195 stable transitions
Graph (complete) has 558 edges and 220 vertex of which 219 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 197 stabilizing places and 195 stable transitions
Detected a total of 197/220 stabilizing places and 195/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 35 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLFireability-00 finished in 1516 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||X((G((F(p1) U (p1||X(p2)))) U (p0&&G((F(p1) U (p1||X(p2)))))))))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 222 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 222 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 221 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 221 transition count 218
Applied a total of 18 rules in 13 ms. Remains 221 /230 variables (removed 9) and now considering 218/227 (removed 9) transitions.
// Phase 1: matrix 218 rows 221 cols
[2024-05-25 15:19:51] [INFO ] Computed 41 invariants in 6 ms
[2024-05-25 15:19:52] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-25 15:19:52] [INFO ] Invariant cache hit.
[2024-05-25 15:19:52] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-25 15:19:52] [INFO ] Invariant cache hit.
[2024-05-25 15:19:52] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/230 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 221/230 places, 218/227 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s208 1), p1:(EQ s166 1), p2:(AND (EQ s52 1) (EQ s146 1) (EQ s178 1))], 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]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-01 finished in 1092 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(p1)))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 222 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 222 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 221 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 221 transition count 218
Applied a total of 18 rules in 16 ms. Remains 221 /230 variables (removed 9) and now considering 218/227 (removed 9) transitions.
// Phase 1: matrix 218 rows 221 cols
[2024-05-25 15:19:52] [INFO ] Computed 41 invariants in 4 ms
[2024-05-25 15:19:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-25 15:19:53] [INFO ] Invariant cache hit.
[2024-05-25 15:19:53] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-25 15:19:53] [INFO ] Invariant cache hit.
[2024-05-25 15:19:53] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/230 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 221/230 places, 218/227 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s173 1), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-02 finished in 537 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 p1)||X((!p0&&F((!p0&&X(p2)))))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 222 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 222 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 220 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 220 transition count 217
Applied a total of 20 rules in 17 ms. Remains 220 /230 variables (removed 10) and now considering 217/227 (removed 10) transitions.
// Phase 1: matrix 217 rows 220 cols
[2024-05-25 15:19:53] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 15:19:53] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 15:19:53] [INFO ] Invariant cache hit.
[2024-05-25 15:19:53] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-25 15:19:53] [INFO ] Invariant cache hit.
[2024-05-25 15:19:53] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/230 places, 217/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 220/230 places, 217/227 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (OR (NOT p2) p0), (OR (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 1}]], initial=2, aps=[p0:(NEQ s42 1), p2:(EQ s155 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3682 reset in 171 ms.
Stack based approach found an accepted trace after 127 steps with 5 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-05 finished in 939 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))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 222 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 222 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 220 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 220 transition count 217
Applied a total of 20 rules in 8 ms. Remains 220 /230 variables (removed 10) and now considering 217/227 (removed 10) transitions.
// Phase 1: matrix 217 rows 220 cols
[2024-05-25 15:19:54] [INFO ] Computed 41 invariants in 16 ms
[2024-05-25 15:19:54] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-25 15:19:54] [INFO ] Invariant cache hit.
[2024-05-25 15:19:54] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-25 15:19:54] [INFO ] Invariant cache hit.
[2024-05-25 15:19:54] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/230 places, 217/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 220/230 places, 217/227 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s176 1) (AND (EQ s81 1) (EQ s150 1) (EQ s211 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-06 finished in 595 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)||G(F(p1)))))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Graph (trivial) has 101 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 561 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 223 transition count 199
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 203 transition count 199
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 42 place count 203 transition count 151
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 144 place count 149 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 143 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 143 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 156 place count 143 transition count 144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 142 transition count 144
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 250 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 252 place count 95 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 94 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 254 place count 93 transition count 100
Applied a total of 254 rules in 70 ms. Remains 93 /230 variables (removed 137) and now considering 100/227 (removed 127) transitions.
// Phase 1: matrix 100 rows 93 cols
[2024-05-25 15:19:55] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:19:55] [INFO ] Implicit Places using invariants in 117 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/230 places, 100/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 92/230 places, 100/227 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1), p1:(EQ s60 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10454 reset in 233 ms.
Product exploration explored 100000 steps with 10446 reset in 195 ms.
Computed a total of 85 stabilizing places and 93 stable transitions
Computed a total of 85 stabilizing places and 93 stable transitions
Detected a total of 85/92 stabilizing places and 93/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 403 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 92 cols
[2024-05-25 15:19:56] [INFO ] Computed 33 invariants in 2 ms
[2024-05-25 15:19:56] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:19:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-25 15:19:56] [INFO ] [Nat]Absence check using 16 positive and 17 generalized place invariants in 30 ms returned sat
[2024-05-25 15:19:56] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:19:56] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:56] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
[2024-05-25 15:19:56] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:19:56] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:19:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 243 ms
[2024-05-25 15:19:56] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-25 15:19:56] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 92 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-25 15:19:56] [INFO ] Invariant cache hit.
[2024-05-25 15:19:57] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-25 15:19:57] [INFO ] Invariant cache hit.
[2024-05-25 15:19:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:19:57] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [37, 38, 47, 49, 55]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 329 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/92 places, 100/100 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 86 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 82 transition count 94
Applied a total of 10 rules in 8 ms. Remains 82 /87 variables (removed 5) and now considering 94/100 (removed 6) transitions.
// Phase 1: matrix 94 rows 82 cols
[2024-05-25 15:19:57] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 15:19:57] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-25 15:19:57] [INFO ] Invariant cache hit.
[2024-05-25 15:19:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:19:57] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/92 places, 94/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 597 ms. Remains : 82/92 places, 94/100 transitions.
Computed a total of 75 stabilizing places and 87 stable transitions
Computed a total of 75 stabilizing places and 87 stable transitions
Detected a total of 75/82 stabilizing places and 87/94 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1)]
Finished random walk after 57 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10962 reset in 163 ms.
Product exploration explored 100000 steps with 10936 reset in 161 ms.
Built C files in :
/tmp/ltsmin11203052573176910185
[2024-05-25 15:19:58] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2024-05-25 15:19:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:58] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2024-05-25 15:19:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:58] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2024-05-25 15:19:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11203052573176910185
Running compilation step : cd /tmp/ltsmin11203052573176910185;'/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 439 ms.
Running link step : cd /tmp/ltsmin11203052573176910185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11203052573176910185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7997894279145074931.hoa' '--buchi-type=spotba'
LTSmin run took 279 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-04-LTLFireability-07 finished in 4328 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))||G(p1)))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Graph (trivial) has 99 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 561 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 223 transition count 200
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 204 transition count 200
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 40 place count 204 transition count 154
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 138 place count 152 transition count 154
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 145 place count 145 transition count 147
Iterating global reduction 2 with 7 rules applied. Total rules applied 152 place count 145 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 152 place count 145 transition count 146
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 154 place count 144 transition count 146
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 250 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 252 place count 95 transition count 101
Applied a total of 252 rules in 31 ms. Remains 95 /230 variables (removed 135) and now considering 101/227 (removed 126) transitions.
// Phase 1: matrix 101 rows 95 cols
[2024-05-25 15:19:59] [INFO ] Computed 35 invariants in 2 ms
[2024-05-25 15:19:59] [INFO ] Implicit Places using invariants in 116 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 119 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/230 places, 101/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 90/230 places, 101/227 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s16 1), p0:(EQ s36 1)], nbAcceptance=1, 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-09 finished in 269 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||G(p1)) U (!p2 U p3)))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Graph (trivial) has 97 edges and 230 vertex of which 6 / 230 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 561 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 223 transition count 202
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 206 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 205 transition count 201
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 38 place count 205 transition count 155
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 136 place count 153 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 141 place count 148 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 148 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 146 place count 148 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 147 transition count 149
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 3 with 98 rules applied. Total rules applied 246 place count 98 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 97 transition count 103
Applied a total of 248 rules in 37 ms. Remains 97 /230 variables (removed 133) and now considering 103/227 (removed 124) transitions.
// Phase 1: matrix 103 rows 97 cols
[2024-05-25 15:19:59] [INFO ] Computed 35 invariants in 1 ms
[2024-05-25 15:19:59] [INFO ] Implicit Places using invariants in 154 ms returned [1, 11, 35, 36]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 158 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/230 places, 103/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 93/230 places, 103/227 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p3), true, (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s58 1), p0:(EQ s34 1), p1:(EQ s11 1), p2:(OR (EQ s58 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-10 finished in 466 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 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 219 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 219 transition count 216
Applied a total of 22 rules in 10 ms. Remains 219 /230 variables (removed 11) and now considering 216/227 (removed 11) transitions.
// Phase 1: matrix 216 rows 219 cols
[2024-05-25 15:20:00] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 15:20:00] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 15:20:00] [INFO ] Invariant cache hit.
[2024-05-25 15:20:00] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-25 15:20:00] [INFO ] Invariant cache hit.
[2024-05-25 15:20:00] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/230 places, 216/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 723 ms. Remains : 219/230 places, 216/227 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-12 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:(NEQ s101 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 132 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-12 finished in 837 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)) U !p1) U (X(p1) U p0)))'
Support contains 6 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 219 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 219 transition count 216
Applied a total of 22 rules in 5 ms. Remains 219 /230 variables (removed 11) and now considering 216/227 (removed 11) transitions.
[2024-05-25 15:20:00] [INFO ] Invariant cache hit.
[2024-05-25 15:20:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-25 15:20:00] [INFO ] Invariant cache hit.
[2024-05-25 15:20:01] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-25 15:20:01] [INFO ] Invariant cache hit.
[2024-05-25 15:20:01] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/230 places, 216/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 219/230 places, 216/227 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s52 1) (EQ s146 1) (EQ s176 1)), p1:(AND (EQ s51 1) (EQ s130 1) (EQ s175 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-13 finished in 599 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)||X(F(p1))))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 219 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 219 transition count 216
Applied a total of 22 rules in 6 ms. Remains 219 /230 variables (removed 11) and now considering 216/227 (removed 11) transitions.
[2024-05-25 15:20:01] [INFO ] Invariant cache hit.
[2024-05-25 15:20:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 15:20:01] [INFO ] Invariant cache hit.
[2024-05-25 15:20:01] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-25 15:20:01] [INFO ] Invariant cache hit.
[2024-05-25 15:20:01] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/230 places, 216/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 219/230 places, 216/227 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s102 0) (EQ s154 0) (EQ s184 0)), p0:(AND (EQ s44 1) (EQ s153 1) (EQ s184 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]]
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Computed a total of 196 stabilizing places and 194 stable transitions
Graph (complete) has 556 edges and 219 vertex of which 218 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 196 stabilizing places and 194 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 25 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLFireability-14 finished in 921 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)) U G((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 227/227 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 221 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 221 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 220 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 220 transition count 217
Applied a total of 20 rules in 10 ms. Remains 220 /230 variables (removed 10) and now considering 217/227 (removed 10) transitions.
// Phase 1: matrix 217 rows 220 cols
[2024-05-25 15:20:02] [INFO ] Computed 41 invariants in 8 ms
[2024-05-25 15:20:02] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 15:20:02] [INFO ] Invariant cache hit.
[2024-05-25 15:20:02] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-25 15:20:02] [INFO ] Invariant cache hit.
[2024-05-25 15:20:02] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/230 places, 217/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 220/230 places, 217/227 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={1} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s119 1), p2:(AND (EQ s203 1) (EQ s206 1)), p0:(EQ s169 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLFireability-15 finished in 817 ms.
All properties solved by simple procedures.
Total runtime 18453 ms.

BK_STOP 1716650403398

--------------------
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="BusinessProcesses-PT-04"
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 BusinessProcesses-PT-04, 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 r065-tajo-171620414800298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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