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.r597-smll-171734926500103.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 MedleyA-PT-21, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16:33 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 MedleyA-PT-21-LTLFireability-00
FORMULA_NAME MedleyA-PT-21-LTLFireability-01
FORMULA_NAME MedleyA-PT-21-LTLFireability-02
FORMULA_NAME MedleyA-PT-21-LTLFireability-03
FORMULA_NAME MedleyA-PT-21-LTLFireability-04
FORMULA_NAME MedleyA-PT-21-LTLFireability-05
FORMULA_NAME MedleyA-PT-21-LTLFireability-06
FORMULA_NAME MedleyA-PT-21-LTLFireability-07
FORMULA_NAME MedleyA-PT-21-LTLFireability-08
FORMULA_NAME MedleyA-PT-21-LTLFireability-09
FORMULA_NAME MedleyA-PT-21-LTLFireability-10
FORMULA_NAME MedleyA-PT-21-LTLFireability-11
FORMULA_NAME MedleyA-PT-21-LTLFireability-12
FORMULA_NAME MedleyA-PT-21-LTLFireability-13
FORMULA_NAME MedleyA-PT-21-LTLFireability-14
FORMULA_NAME MedleyA-PT-21-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717367397871

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=MedleyA-PT-21
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:30:00] [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-06-02 22:30:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:30:00] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-02 22:30:00] [INFO ] Transformed 306 places.
[2024-06-02 22:30:00] [INFO ] Transformed 298 transitions.
[2024-06-02 22:30:00] [INFO ] Found NUPN structural information;
[2024-06-02 22:30:00] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-21-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 269 transition count 261
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 269 transition count 261
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 106 place count 237 transition count 229
Iterating global reduction 0 with 32 rules applied. Total rules applied 138 place count 237 transition count 229
Applied a total of 138 rules in 90 ms. Remains 237 /306 variables (removed 69) and now considering 229/298 (removed 69) transitions.
// Phase 1: matrix 229 rows 237 cols
[2024-06-02 22:30:01] [INFO ] Computed 20 invariants in 31 ms
[2024-06-02 22:30:01] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-06-02 22:30:01] [INFO ] Invariant cache hit.
[2024-06-02 22:30:02] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2024-06-02 22:30:02] [INFO ] Invariant cache hit.
[2024-06-02 22:30:02] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/306 places, 229/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 237/306 places, 229/298 transitions.
Support contains 35 out of 237 places after structural reductions.
[2024-06-02 22:30:02] [INFO ] Flatten gal took : 63 ms
[2024-06-02 22:30:02] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:30:02] [INFO ] Input system was already deterministic with 229 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=13 ) properties (out of 27) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:30:03] [INFO ] Invariant cache hit.
[2024-06-02 22:30:04] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-06-02 22:30:04] [INFO ] After 142ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 22:30:04] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 17 ms to minimize.
[2024-06-02 22:30:04] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:30:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2024-06-02 22:30:04] [INFO ] After 412ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:30:04] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:30:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-06-02 22:30:04] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:30:04] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:30:04] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:30:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2024-06-02 22:30:04] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-02 22:30:04] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 180 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 3 ms.
FORMULA MedleyA-PT-21-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 39 stabilizing places and 39 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' '!((F(G(p0))||G((F(p1) U X(X(p2))))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 222 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 222 transition count 214
Applied a total of 30 rules in 18 ms. Remains 222 /237 variables (removed 15) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-02 22:30:05] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 22:30:05] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 22:30:05] [INFO ] Invariant cache hit.
[2024-06-02 22:30:05] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-06-02 22:30:05] [INFO ] Invariant cache hit.
[2024-06-02 22:30:05] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 222/237 places, 214/229 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 585 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s207 1)), p2:(NEQ s153 1), p0:(EQ s65 0)], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 28639 reset in 424 ms.
Product exploration explored 100000 steps with 28617 reset in 342 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/222 stabilizing places and 38/214 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 171 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:30:08] [INFO ] Invariant cache hit.
[2024-06-02 22:30:08] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-06-02 22:30:08] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:30:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-06-02 22:30:08] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:30:08] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-02 22:30:08] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=68 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F p1), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 420 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 222 /222 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-06-02 22:30:09] [INFO ] Invariant cache hit.
[2024-06-02 22:30:09] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 22:30:09] [INFO ] Invariant cache hit.
[2024-06-02 22:30:09] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 22:30:09] [INFO ] Invariant cache hit.
[2024-06-02 22:30:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 222/222 places, 214/214 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/222 stabilizing places and 38/214 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 148 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:30:10] [INFO ] Invariant cache hit.
[2024-06-02 22:30:10] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-06-02 22:30:10] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:30:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-06-02 22:30:11] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:30:11] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-06-02 22:30:11] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=68 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F p1), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 640 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 28643 reset in 202 ms.
Product exploration explored 100000 steps with 28577 reset in 214 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 214/214 transitions.
Graph (trivial) has 145 edges and 222 vertex of which 6 / 222 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 217 transition count 209
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 42 place count 217 transition count 220
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 71 place count 217 transition count 220
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 87 place count 201 transition count 204
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 103 place count 201 transition count 204
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 153 place count 201 transition count 215
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 184 place count 170 transition count 184
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 215 place count 170 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 217 place count 170 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 219 place count 168 transition count 197
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 221 place count 168 transition count 197
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 221 rules in 84 ms. Remains 168 /222 variables (removed 54) and now considering 197/214 (removed 17) transitions.
[2024-06-02 22:30:13] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 197 rows 168 cols
[2024-06-02 22:30:13] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 22:30:13] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/222 places, 197/214 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 168/222 places, 197/214 transitions.
Built C files in :
/tmp/ltsmin1145224021382323750
[2024-06-02 22:30:14] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1145224021382323750
Running compilation step : cd /tmp/ltsmin1145224021382323750;'/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 711 ms.
Running link step : cd /tmp/ltsmin1145224021382323750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1145224021382323750;'/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/stateBased9493954780733874368.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 222 /222 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-02 22:30:29] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 22:30:29] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 22:30:29] [INFO ] Invariant cache hit.
[2024-06-02 22:30:29] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-02 22:30:29] [INFO ] Invariant cache hit.
[2024-06-02 22:30:29] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 222/222 places, 214/214 transitions.
Built C files in :
/tmp/ltsmin12815421108827488801
[2024-06-02 22:30:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12815421108827488801
Running compilation step : cd /tmp/ltsmin12815421108827488801;'/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 499 ms.
Running link step : cd /tmp/ltsmin12815421108827488801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12815421108827488801;'/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/stateBased13469122442695100526.hoa' '--buchi-type=spotba'
LTSmin run took 298 ms.
FORMULA MedleyA-PT-21-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-21-LTLFireability-01 finished in 25221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((p1||(F(p0) U p2)))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 160 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 231 transition count 172
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 180 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 179 transition count 171
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 105 place count 179 transition count 138
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 171 place count 146 transition count 138
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 179 place count 138 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 187 place count 138 transition count 130
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 187 place count 138 transition count 126
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 195 place count 134 transition count 126
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 269 place count 97 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 281 place count 91 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 282 place count 90 transition count 134
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 24 edges and 89 vertex of which 4 / 89 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 284 place count 87 transition count 134
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 287 place count 86 transition count 132
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 293 place count 83 transition count 129
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 83 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 295 place count 83 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 297 place count 82 transition count 126
Applied a total of 297 rules in 68 ms. Remains 82 /237 variables (removed 155) and now considering 126/229 (removed 103) transitions.
// Phase 1: matrix 126 rows 82 cols
[2024-06-02 22:30:30] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 22:30:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:30:30] [INFO ] Invariant cache hit.
[2024-06-02 22:30:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 22:30:30] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-06-02 22:30:30] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:30:30] [INFO ] Invariant cache hit.
[2024-06-02 22:30:30] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/237 places, 126/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 82/237 places, 126/229 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s10 1), p1:(AND (EQ s73 1) (EQ s78 1)), p2:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-02 finished in 518 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(G((p1&&F(p2)))))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 228 transition count 220
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 228 transition count 220
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 223 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 223 transition count 215
Applied a total of 28 rules in 19 ms. Remains 223 /237 variables (removed 14) and now considering 215/229 (removed 14) transitions.
// Phase 1: matrix 215 rows 223 cols
[2024-06-02 22:30:31] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 22:30:31] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:30:31] [INFO ] Invariant cache hit.
[2024-06-02 22:30:31] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-02 22:30:31] [INFO ] Invariant cache hit.
[2024-06-02 22:30:31] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/237 places, 215/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 223/237 places, 215/229 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s47 1), p1:(EQ s216 0), p2:(EQ s216 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Stack based approach found an accepted trace after 234 steps with 0 reset with depth 235 and stack size 235 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-03 finished in 822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||X(p1)))||G(!p2))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 222 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 222 transition count 214
Applied a total of 30 rules in 12 ms. Remains 222 /237 variables (removed 15) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-02 22:30:31] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 22:30:32] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 22:30:32] [INFO ] Invariant cache hit.
[2024-06-02 22:30:32] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 22:30:32] [INFO ] Invariant cache hit.
[2024-06-02 22:30:32] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 222/237 places, 214/229 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s73 1), p1:(NEQ s208 1), p2:(AND (EQ s196 1) (EQ s217 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 175 ms.
Product exploration explored 100000 steps with 33333 reset in 191 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-21-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-21-LTLFireability-04 finished in 1114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 221 transition count 213
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 221 transition count 213
Applied a total of 32 rules in 10 ms. Remains 221 /237 variables (removed 16) and now considering 213/229 (removed 16) transitions.
// Phase 1: matrix 213 rows 221 cols
[2024-06-02 22:30:33] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 22:30:33] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 22:30:33] [INFO ] Invariant cache hit.
[2024-06-02 22:30:33] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-06-02 22:30:33] [INFO ] Invariant cache hit.
[2024-06-02 22:30:33] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/237 places, 213/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 221/237 places, 213/229 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s75 1) (EQ s99 1)), p1:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Stack based approach found an accepted trace after 150 steps with 0 reset with depth 151 and stack size 151 in 0 ms.
FORMULA MedleyA-PT-21-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-05 finished in 860 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 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 165 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 231 transition count 168
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 176 transition count 168
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 111 place count 176 transition count 137
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 173 place count 145 transition count 137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 182 place count 136 transition count 128
Iterating global reduction 2 with 9 rules applied. Total rules applied 191 place count 136 transition count 128
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 191 place count 136 transition count 122
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 130 transition count 122
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 279 place count 92 transition count 84
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 285 place count 89 transition count 107
Applied a total of 285 rules in 32 ms. Remains 89 /237 variables (removed 148) and now considering 107/229 (removed 122) transitions.
// Phase 1: matrix 107 rows 89 cols
[2024-06-02 22:30:33] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 22:30:33] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 22:30:33] [INFO ] Invariant cache hit.
[2024-06-02 22:30:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 22:30:34] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-06-02 22:30:34] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 22:30:34] [INFO ] Invariant cache hit.
[2024-06-02 22:30:34] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/237 places, 107/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 89/237 places, 107/229 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-06 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 (EQ s79 0) (EQ s87 0))], 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 2 reset in 145 ms.
Stack based approach found an accepted trace after 43 steps with 1 reset with depth 22 and stack size 22 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-06 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((F(G(p0)) U (p1 U p0))))))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 222 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 222 transition count 214
Applied a total of 30 rules in 10 ms. Remains 222 /237 variables (removed 15) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-02 22:30:34] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 22:30:34] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 22:30:34] [INFO ] Invariant cache hit.
[2024-06-02 22:30:34] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 22:30:34] [INFO ] Invariant cache hit.
[2024-06-02 22:30:35] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 222/237 places, 214/229 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s211 1), p1:(NEQ s69 1)], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 23 reset in 160 ms.
Stack based approach found an accepted trace after 1172 steps with 52 reset with depth 192 and stack size 192 in 3 ms.
FORMULA MedleyA-PT-21-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-08 finished in 1074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 227 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 227 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 222 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 222 transition count 214
Applied a total of 30 rules in 9 ms. Remains 222 /237 variables (removed 15) and now considering 214/229 (removed 15) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-02 22:30:35] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 22:30:35] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:30:35] [INFO ] Invariant cache hit.
[2024-06-02 22:30:35] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-02 22:30:35] [INFO ] Invariant cache hit.
[2024-06-02 22:30:36] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/237 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 222/237 places, 214/229 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s158 1) (EQ s178 1)), p0:(EQ s142 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 0 reset in 116 ms.
Stack based approach found an accepted trace after 178 steps with 0 reset with depth 179 and stack size 179 in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLFireability-09 finished in 799 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 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 166 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 232 transition count 170
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 178 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 177 transition count 169
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 111 place count 177 transition count 139
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 171 place count 147 transition count 139
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 180 place count 138 transition count 130
Iterating global reduction 3 with 9 rules applied. Total rules applied 189 place count 138 transition count 130
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 189 place count 138 transition count 123
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 203 place count 131 transition count 123
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 281 place count 92 transition count 84
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 place count 89 transition count 107
Applied a total of 287 rules in 31 ms. Remains 89 /237 variables (removed 148) and now considering 107/229 (removed 122) transitions.
// Phase 1: matrix 107 rows 89 cols
[2024-06-02 22:30:36] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 22:30:36] [INFO ] Implicit Places using invariants in 88 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/237 places, 107/229 transitions.
Graph (trivial) has 32 edges and 88 vertex of which 4 / 88 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 6 ms. Remains 86 /88 variables (removed 2) and now considering 105/107 (removed 2) transitions.
[2024-06-02 22:30:36] [INFO ] Flow matrix only has 103 transitions (discarded 2 similar events)
// Phase 1: matrix 103 rows 86 cols
[2024-06-02 22:30:36] [INFO ] Computed 19 invariants in 1 ms
[2024-06-02 22:30:36] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:30:36] [INFO ] Flow matrix only has 103 transitions (discarded 2 similar events)
[2024-06-02 22:30:36] [INFO ] Invariant cache hit.
[2024-06-02 22:30:36] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 22:30:36] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/237 places, 105/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 339 ms. Remains : 86/237 places, 105/229 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-10 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 (EQ s0 1) (AND (EQ s28 1) (EQ s30 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-10 finished in 438 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 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 226 transition count 218
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 226 transition count 218
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 220 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 220 transition count 212
Applied a total of 34 rules in 11 ms. Remains 220 /237 variables (removed 17) and now considering 212/229 (removed 17) transitions.
// Phase 1: matrix 212 rows 220 cols
[2024-06-02 22:30:36] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 22:30:36] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 22:30:36] [INFO ] Invariant cache hit.
[2024-06-02 22:30:37] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-02 22:30:37] [INFO ] Invariant cache hit.
[2024-06-02 22:30:37] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/237 places, 212/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 220/237 places, 212/229 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-11 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:(OR (EQ s159 0) (EQ s208 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 97 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-21-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-11 finished in 665 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((F(p1)&&p0)))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 160 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 231 transition count 172
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 180 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 179 transition count 171
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 105 place count 179 transition count 139
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 169 place count 147 transition count 139
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 177 place count 139 transition count 131
Iterating global reduction 3 with 8 rules applied. Total rules applied 185 place count 139 transition count 131
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 185 place count 139 transition count 126
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 134 transition count 126
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 273 place count 95 transition count 87
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 283 place count 90 transition count 120
Applied a total of 283 rules in 31 ms. Remains 90 /237 variables (removed 147) and now considering 120/229 (removed 109) transitions.
// Phase 1: matrix 120 rows 90 cols
[2024-06-02 22:30:37] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 22:30:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:30:37] [INFO ] Invariant cache hit.
[2024-06-02 22:30:37] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 22:30:37] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 22:30:37] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:30:37] [INFO ] Invariant cache hit.
[2024-06-02 22:30:37] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/237 places, 120/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 90/237 places, 120/229 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s11 1) (EQ s23 1)), p0:(AND (EQ s76 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLFireability-12 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&F(G(p2))))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Graph (trivial) has 159 edges and 237 vertex of which 6 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 231 transition count 170
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 178 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 177 transition count 169
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 109 place count 177 transition count 138
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 171 place count 146 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 140 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 140 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 183 place count 140 transition count 128
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 136 transition count 128
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 269 place count 97 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 94 transition count 112
Applied a total of 275 rules in 31 ms. Remains 94 /237 variables (removed 143) and now considering 112/229 (removed 117) transitions.
// Phase 1: matrix 112 rows 94 cols
[2024-06-02 22:30:37] [INFO ] Computed 20 invariants in 0 ms
[2024-06-02 22:30:38] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:30:38] [INFO ] Invariant cache hit.
[2024-06-02 22:30:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 22:30:38] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-02 22:30:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:30:38] [INFO ] Invariant cache hit.
[2024-06-02 22:30:38] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/237 places, 112/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 94/237 places, 112/229 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-21-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s64 1), p1:(OR (EQ s35 0) (EQ s81 1)), p2:(EQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6 reset in 227 ms.
Product exploration explored 100000 steps with 2 reset in 245 ms.
Computed a total of 1 stabilizing places and 18 stable transitions
Computed a total of 1 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:30:39] [INFO ] Invariant cache hit.
[2024-06-02 22:30:39] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:30:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-06-02 22:30:39] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:30:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 22:30:39] [INFO ] After 21ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:30:39] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 22:30:39] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 1 ms.
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 112/112 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 92 transition count 109
Free-agglomeration rule applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 30 place count 92 transition count 84
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 57 place count 67 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 67 transition count 82
Applied a total of 58 rules in 18 ms. Remains 67 /94 variables (removed 27) and now considering 82/112 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 67/94 places, 82/112 transitions.
Finished random walk after 44 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (AND p0 p2))]
Knowledge based reduction with 7 factoid took 368 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 2 out of 94 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 : 94/94 places, 112/112 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-02 22:30:40] [INFO ] Invariant cache hit.
[2024-06-02 22:30:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 22:30:40] [INFO ] Invariant cache hit.
[2024-06-02 22:30:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 22:30:40] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-02 22:30:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:30:40] [INFO ] Invariant cache hit.
[2024-06-02 22:30:40] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 343 ms. Remains : 94/94 places, 112/112 transitions.
Computed a total of 1 stabilizing places and 18 stable transitions
Computed a total of 1 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 7 factoid took 235 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:30:41] [INFO ] Invariant cache hit.
[2024-06-02 22:30:41] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:30:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-06-02 22:30:41] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:30:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 22:30:41] [INFO ] After 12ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:30:41] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-02 22:30:41] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 41 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (AND p0 p2))]
Knowledge based reduction with 7 factoid took 361 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 1 reset in 140 ms.
Product exploration explored 100000 steps with 6 reset in 238 ms.
Built C files in :
/tmp/ltsmin10751560570661718922
[2024-06-02 22:30:43] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2024-06-02 22:30:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:30:43] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2024-06-02 22:30:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:30:43] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2024-06-02 22:30:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:30:43] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10751560570661718922
Running compilation step : cd /tmp/ltsmin10751560570661718922;'/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 361 ms.
Running link step : cd /tmp/ltsmin10751560570661718922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10751560570661718922;'/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/stateBased18192843437256377203.hoa' '--buchi-type=spotba'
LTSmin run took 752 ms.
FORMULA MedleyA-PT-21-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-21-LTLFireability-14 finished in 6349 ms.
All properties solved by simple procedures.
Total runtime 43637 ms.

BK_STOP 1717367445717

--------------------
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="MedleyA-PT-21"
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 MedleyA-PT-21, 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 r597-smll-171734926500103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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