About the Execution of 2023-gold for ResAllocation-PT-R003C100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 452.867 | 41880.00 | 57770.00 | 546.40 | FTFFFFFFTTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r329-tall-171662362500523.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ResAllocation-PT-R003C100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362500523
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 11 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 11 23:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 721K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716864681839
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:51:23] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-28 02:51:23] [INFO ] Transformed 600 places.
[2024-05-28 02:51:23] [INFO ] Transformed 400 transitions.
[2024-05-28 02:51:23] [INFO ] Found NUPN structural information;
[2024-05-28 02:51:23] [INFO ] Parsed PT model containing 600 places and 400 transitions and 1794 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R003C100-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 48 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 600 cols
[2024-05-28 02:51:24] [INFO ] Computed 300 invariants in 19 ms
[2024-05-28 02:51:24] [INFO ] Implicit Places using invariants in 527 ms returned [597, 599]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 747 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 598/600 places, 400/400 transitions.
Applied a total of 0 rules in 24 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 819 ms. Remains : 598/600 places, 400/400 transitions.
Support contains 65 out of 598 places after structural reductions.
[2024-05-28 02:51:24] [INFO ] Flatten gal took : 66 ms
[2024-05-28 02:51:24] [INFO ] Flatten gal took : 38 ms
[2024-05-28 02:51:24] [INFO ] Input system was already deterministic with 400 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 400 rows 598 cols
[2024-05-28 02:51:25] [INFO ] Computed 298 invariants in 10 ms
[2024-05-28 02:51:25] [INFO ] [Real]Absence check using 298 positive place invariants in 40 ms returned sat
[2024-05-28 02:51:25] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 02:51:25] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
[2024-05-28 02:51:25] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:51:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:51:25] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:51:25] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 720 ms
[2024-05-28 02:51:26] [INFO ] After 924ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:51:26] [INFO ] After 1102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:51:26] [INFO ] [Nat]Absence check using 298 positive place invariants in 42 ms returned sat
[2024-05-28 02:51:26] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-28 02:51:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-28 02:51:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 638 ms
[2024-05-28 02:51:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 638 ms
[2024-05-28 02:51:27] [INFO ] After 822ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-28 02:51:27] [INFO ] After 1052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 498 transition count 301
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 201 place count 498 transition count 299
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 205 place count 494 transition count 299
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 207 place count 494 transition count 297
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 211 place count 492 transition count 295
Free-agglomeration rule (complex) applied 98 times.
Iterating global reduction 2 with 98 rules applied. Total rules applied 309 place count 492 transition count 197
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t4 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 2 with 96 rules applied. Total rules applied 405 place count 198 transition count 101
Reduce places removed 188 places and 0 transitions.
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 3 with 282 rules applied. Total rules applied 687 place count 10 transition count 7
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 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 693 place count 6 transition count 5
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 695 place count 6 transition count 3
Ensure Unique test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 697 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 697 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 700 place count 2 transition count 2
Applied a total of 700 rules in 70 ms. Remains 2 /598 variables (removed 596) and now considering 2/400 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 2/598 places, 2/400 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 10 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 0 with 190 rules applied. Total rules applied 190 place count 503 transition count 305
Applied a total of 190 rules in 31 ms. Remains 503 /598 variables (removed 95) and now considering 305/400 (removed 95) transitions.
// Phase 1: matrix 305 rows 503 cols
[2024-05-28 02:51:27] [INFO ] Computed 298 invariants in 3 ms
[2024-05-28 02:51:28] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-28 02:51:28] [INFO ] Invariant cache hit.
[2024-05-28 02:51:28] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2024-05-28 02:51:28] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 02:51:28] [INFO ] Invariant cache hit.
[2024-05-28 02:51:28] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/598 places, 305/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1117 ms. Remains : 503/598 places, 305/400 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 281 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s76 1) (EQ s82 1)), p0:(OR (AND (EQ s447 1) (EQ s451 1) (EQ s452 1) (OR (EQ s495 0) (EQ s500 0) (EQ s501 0))) (AND (EQ s138 1) (EQ s144 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 73 steps with 0 reset in 10 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-00 finished in 1463 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(p1))&&(F(G(!p2)) U G(p0)))))'
Support contains 6 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 598 cols
[2024-05-28 02:51:29] [INFO ] Computed 298 invariants in 6 ms
[2024-05-28 02:51:29] [INFO ] Implicit Places using invariants in 314 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 316 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 330 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p2), acceptance={1} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 6}, { cond=(AND p0 p2), acceptance={0, 1} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={1} source=3 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={1} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=7 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=7 dest: 6}]], initial=0, aps=[p0:(AND (EQ s345 1) (EQ s348 1) (EQ s351 1)), p1:(EQ s306 1), p2:(AND (EQ s259 1) (EQ s265 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 483 reset in 1078 ms.
Product exploration explored 100000 steps with 482 reset in 1161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 1112 ms. Reduced automaton from 8 states, 33 edges and 3 AP (stutter sensitive) to 8 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 1312 steps, including 6 resets, run visited all 12 properties in 19 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) (NOT p2))), (F p0), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 1421 ms. Reduced automaton from 8 states, 32 edges and 3 AP (stutter sensitive) to 8 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
// Phase 1: matrix 400 rows 597 cols
[2024-05-28 02:51:36] [INFO ] Computed 297 invariants in 3 ms
[2024-05-28 02:51:36] [INFO ] [Real]Absence check using 297 positive place invariants in 22 ms returned unsat
Proved EG (NOT p1)
[2024-05-28 02:51:36] [INFO ] Invariant cache hit.
[2024-05-28 02:51:37] [INFO ] [Real]Absence check using 297 positive place invariants in 281 ms returned sat
[2024-05-28 02:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:51:47] [INFO ] [Real]Absence check using state equation in 10609 ms returned sat
[2024-05-28 02:51:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:51:48] [INFO ] [Nat]Absence check using 297 positive place invariants in 103 ms returned sat
[2024-05-28 02:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 02:51:48] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2024-05-28 02:51:48] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-28 02:51:48] [INFO ] Added : 40 causal constraints over 8 iterations in 288 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) (NOT p2))), (F p0), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 1425 ms. Reduced automaton from 8 states, 32 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R003C100-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C100-LTLFireability-02 finished in 20937 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||X((F((p2||G(p3)))||p1))))))'
Support contains 11 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 598 cols
[2024-05-28 02:51:50] [INFO ] Computed 298 invariants in 3 ms
[2024-05-28 02:51:50] [INFO ] Implicit Places using invariants in 311 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 312 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 331 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s105 1) (EQ s108 1) (EQ s111 1)), p1:(OR (AND (EQ s97 1) (EQ s103 1) (EQ s104 1)) (AND (EQ s173 1) (EQ s179 1))), p2:(AND (EQ s173 1) (EQ s179...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1265 steps with 130 reset in 27 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-03 finished in 551 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((X(p1)&&p0))||(G(F(p2))&&F(p1)))))'
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-28 02:51:50] [INFO ] Invariant cache hit.
[2024-05-28 02:51:51] [INFO ] Implicit Places using invariants in 332 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 333 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 348 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s269 1) (EQ s275 1)), p2:(AND (EQ s269 1) (EQ s275 1)), p1:(AND (EQ s449 1) (EQ s455 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 283 steps with 29 reset in 5 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-04 finished in 698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !p1))))'
Support contains 6 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 498 transition count 301
Applied a total of 199 rules in 26 ms. Remains 498 /598 variables (removed 100) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2024-05-28 02:51:51] [INFO ] Computed 297 invariants in 1 ms
[2024-05-28 02:51:51] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-28 02:51:51] [INFO ] Invariant cache hit.
[2024-05-28 02:51:52] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2024-05-28 02:51:52] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-28 02:51:52] [INFO ] Invariant cache hit.
[2024-05-28 02:51:52] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/598 places, 301/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1187 ms. Remains : 498/598 places, 301/400 transitions.
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s61 1) (EQ s66 1) (EQ s67 1)), p0:(AND (EQ s194 1) (EQ s198 1) (EQ s199 1))], 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 503 reset in 1035 ms.
Stack based approach found an accepted trace after 87290 steps with 441 reset with depth 48 and stack size 48 in 959 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-05 finished in 3287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 498 transition count 301
Applied a total of 199 rules in 28 ms. Remains 498 /598 variables (removed 100) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2024-05-28 02:51:54] [INFO ] Computed 297 invariants in 4 ms
[2024-05-28 02:51:55] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-28 02:51:55] [INFO ] Invariant cache hit.
[2024-05-28 02:51:55] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2024-05-28 02:51:55] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-28 02:51:55] [INFO ] Invariant cache hit.
[2024-05-28 02:51:55] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/598 places, 301/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1138 ms. Remains : 498/598 places, 301/400 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s484 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 7 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-06 finished in 1206 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)))))'
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 598 cols
[2024-05-28 02:51:56] [INFO ] Computed 298 invariants in 2 ms
[2024-05-28 02:51:56] [INFO ] Implicit Places using invariants in 331 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 340 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s184 1), p1:(OR (NEQ s447 1) (NEQ s453 1) (NEQ s454 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 1096 ms.
Product exploration explored 100000 steps with 50000 reset in 1196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R003C100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C100-LTLFireability-08 finished in 2908 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((X(G(p1))&&p0))))'
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-28 02:51:58] [INFO ] Invariant cache hit.
[2024-05-28 02:51:59] [INFO ] Implicit Places using invariants in 310 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s205 1) (EQ s211 1) (EQ s212 1)), p1:(AND (EQ s367 1) (EQ s373 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 206 steps with 0 reset in 4 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-10 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(p1)))&&(p2||F(p0)))))'
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-28 02:51:59] [INFO ] Invariant cache hit.
[2024-05-28 02:51:59] [INFO ] Implicit Places using invariants in 308 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 309 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 324 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s136 1), p0:(AND (EQ s437 1) (EQ s443 1)), p1:(AND (EQ s331 1) (EQ s337 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]]
Entered a terminal (fully accepting) state of product in 127 steps with 3 reset in 5 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-11 finished in 602 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)&&X((G(!p1) U p2))))'
Support contains 7 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-28 02:51:59] [INFO ] Invariant cache hit.
[2024-05-28 02:52:00] [INFO ] Implicit Places using invariants in 330 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 335 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), true, p1]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s209 1) (EQ s215 1)), p2:(AND (EQ s245 1) (EQ s251 1)), p1:(AND (EQ s423 1) (EQ s429 1) (EQ s430 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 852 steps with 319 reset in 15 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-12 finished in 615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p0))))))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-28 02:52:00] [INFO ] Invariant cache hit.
[2024-05-28 02:52:00] [INFO ] Implicit Places using invariants in 322 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 323 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 337 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-13 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:(EQ s544 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1803 steps with 8 reset in 25 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-13 finished in 483 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))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 497 transition count 300
Applied a total of 201 rules in 23 ms. Remains 497 /598 variables (removed 101) and now considering 300/400 (removed 100) transitions.
// Phase 1: matrix 300 rows 497 cols
[2024-05-28 02:52:01] [INFO ] Computed 297 invariants in 3 ms
[2024-05-28 02:52:01] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-28 02:52:01] [INFO ] Invariant cache hit.
[2024-05-28 02:52:01] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2024-05-28 02:52:01] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 02:52:01] [INFO ] Invariant cache hit.
[2024-05-28 02:52:02] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/598 places, 300/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1145 ms. Remains : 497/598 places, 300/400 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s113 1) (EQ s117 1) (EQ s118 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][true]]
Stuttering criterion allowed to conclude after 421 steps with 2 reset in 9 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-14 finished in 1220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 598 cols
[2024-05-28 02:52:02] [INFO ] Computed 298 invariants in 3 ms
[2024-05-28 02:52:02] [INFO ] Implicit Places using invariants in 327 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 340 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s541 1) (EQ s547 1) (EQ s548 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 220 steps with 0 reset in 6 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-15 finished in 438 ms.
All properties solved by simple procedures.
Total runtime 39347 ms.
BK_STOP 1716864723719
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ResAllocation-PT-R003C100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662362500523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 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 '
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 ;