Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745400053.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmallOperatingSystem-PT-MT0128DC0064, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745400053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 19:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 8.2K May 5 16:52 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 SmallOperatingSystem-PT-MT0128DC0064-00
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-01
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-02
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-03
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-04
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-05
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-06
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-07
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-08
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-09
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-10
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-11
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-12
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-13
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-14
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-15

=== Now, execution of the tool begins

BK_START 1621146115210

Running Version 0
[2021-05-16 06:21:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 06:21:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 06:21:56] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-16 06:21:56] [INFO ] Transformed 9 places.
[2021-05-16 06:21:56] [INFO ] Transformed 8 transitions.
[2021-05-16 06:21:56] [INFO ] Parsed PT model containing 9 places and 8 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 06:21:56] [INFO ] Initial state test concluded for 5 properties.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0128DC0064-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 7 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 06:21:56] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-16 06:21:56] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 06:21:56] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 06:21:56] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 06:21:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 06:21:56] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
[2021-05-16 06:21:57] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 06:21:57] [INFO ] Flatten gal took : 15 ms
FORMULA SmallOperatingSystem-PT-MT0128DC0064-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0128DC0064-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:21:57] [INFO ] Flatten gal took : 3 ms
[2021-05-16 06:21:57] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 1295 steps, including 0 resets, run visited all 12 properties in 5 ms. (steps per millisecond=259 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 10 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 5 cols
[2021-05-16 06:21:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 06:21:57] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-16 06:21:57] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-16 06:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 06:21:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-16 06:21:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-16 06:21:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-16 06:21:57] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/9 places, 6/8 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-00 automaton TGBA [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:(GEQ s3 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 15 steps with 3 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-00 finished in 241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0||G(p1))) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:21:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 06:21:57] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:21:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 06:21:57] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-16 06:21:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:21:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 06:21:57] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s4 1), p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p1:(AND (GEQ s4 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9177 reset in 227 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-02 finished in 375 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 4 transition count 6
Applied a total of 7 rules in 2 ms. Remains 4 /9 variables (removed 5) and now considering 6/8 (removed 2) transitions.
[2021-05-16 06:21:57] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 06:21:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 06:21:57] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-16 06:21:57] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 06:21:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 06:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 06:21:57] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-16 06:21:57] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-16 06:21:57] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 06:21:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 06:21:57] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/9 places, 6/8 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 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 0 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-04 finished in 69 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((p1||(p0 U p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:21:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 06:21:57] [INFO ] Implicit Places using invariants in 8 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:21:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:21:57] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:21:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:21:57] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s4 1) (OR (LT s0 1) (LT s1 1) (LT s2 1))), p2:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25043 reset in 94 ms.
Product exploration explored 100000 steps with 24966 reset in 119 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 24907 reset in 82 ms.
Product exploration explored 100000 steps with 25005 reset in 128 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Support contains 5 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-16 06:21:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:21:58] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 06:21:58] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 7/7 transitions.
Product exploration explored 100000 steps with 25060 reset in 281 ms.
Product exploration explored 100000 steps with 24958 reset in 141 ms.
[2021-05-16 06:21:59] [INFO ] Flatten gal took : 1 ms
[2021-05-16 06:21:59] [INFO ] Flatten gal took : 2 ms
[2021-05-16 06:21:59] [INFO ] Time to serialize gal into /tmp/LTL9975538553024465035.gal : 1 ms
[2021-05-16 06:21:59] [INFO ] Time to serialize properties into /tmp/LTL5070493476992632170.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9975538553024465035.gal, -t, CGAL, -LTL, /tmp/LTL5070493476992632170.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9975538553024465035.gal -t CGAL -LTL /tmp/LTL5070493476992632170.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(TaskReady>=1)"))||(X(("((TaskReady>=1)&&(((TaskOnDisk<1)||(FreeMemSegment<1))||(DiskControllerUnit<1)))")||(("(TaskReady>=1)")U("(((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&(TaskSuspended>=1))"))))))
Formula 0 simplified : !(F"(TaskReady>=1)" | X("((TaskReady>=1)&&(((TaskOnDisk<1)||(FreeMemSegment<1))||(DiskControllerUnit<1)))" | ("(TaskReady>=1)" U "(((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&(TaskSuspended>=1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
182 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.83442,43084,1,0,320,122270,29,64,877,103027,643
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-05 finished in 3179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 4 transition count 6
Applied a total of 7 rules in 2 ms. Remains 4 /9 variables (removed 5) and now considering 6/8 (removed 2) transitions.
[2021-05-16 06:22:01] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 06:22:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-16 06:22:01] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-16 06:22:01] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 06:22:01] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-16 06:22:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 06:22:01] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-16 06:22:01] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-16 06:22:01] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 06:22:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 06:22:01] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/9 places, 6/8 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 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 0 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-06 finished in 62 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0 U p1))||X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 06:22:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 06:22:01] [INFO ] Implicit Places using invariants in 8 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
// Phase 1: matrix 8 rows 8 cols
[2021-05-16 06:22:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 06:22:01] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 8/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-16 06:22:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 06:22:01] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p0:(GEQ s3 1), p2:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10659 reset in 77 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-07 finished in 212 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(F(!p0))||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-16 06:22:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:22:01] [INFO ] Implicit Places using invariants in 9 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
// Phase 1: matrix 8 rows 7 cols
[2021-05-16 06:22:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 06:22:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 7/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 7 cols
[2021-05-16 06:22:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-16 06:22:01] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LT s2 1) (OR (LT s3 1) (LT s2 1))), p1:(OR (LT s3 1) (LT s2 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Support contains 2 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 7/7 places, 8/8 transitions.
Graph (trivial) has 2 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
[2021-05-16 06:22:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-05-16 06:22:01] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-16 06:22:01] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/7 places, 7/8 transitions.
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Product exploration explored 100000 steps with 50000 reset in 56 ms.
[2021-05-16 06:22:02] [INFO ] Flatten gal took : 1 ms
[2021-05-16 06:22:02] [INFO ] Flatten gal took : 1 ms
[2021-05-16 06:22:02] [INFO ] Time to serialize gal into /tmp/LTL14824925005761438524.gal : 1 ms
[2021-05-16 06:22:02] [INFO ] Time to serialize properties into /tmp/LTL14393351056366605589.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14824925005761438524.gal, -t, CGAL, -LTL, /tmp/LTL14393351056366605589.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14824925005761438524.gal -t CGAL -LTL /tmp/LTL14393351056366605589.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(TransferToDisk<1)")))||(("((TaskReady<1)||(TransferToDisk<1))")U(("((TransferToDisk<1)&&((TaskReady<1)||(TransferToDisk<1)))")||(G("((TaskReady<1)||(TransferToDisk<1))"))))))))
Formula 0 simplified : !XF(XF"(TransferToDisk<1)" | ("((TaskReady<1)||(TransferToDisk<1))" U ("((TransferToDisk<1)&&((TaskReady<1)||(TransferToDisk<1)))" | G"((TaskReady<1)||(TransferToDisk<1))")))
Detected timeout of ITS tools.
[2021-05-16 06:22:17] [INFO ] Flatten gal took : 1 ms
[2021-05-16 06:22:17] [INFO ] Applying decomposition
[2021-05-16 06:22:17] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4113385813013864659.txt, -o, /tmp/graph4113385813013864659.bin, -w, /tmp/graph4113385813013864659.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4113385813013864659.bin, -l, -1, -v, -w, /tmp/graph4113385813013864659.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 06:22:17] [INFO ] Decomposing Gal with order
[2021-05-16 06:22:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 06:22:17] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-16 06:22:17] [INFO ] Flatten gal took : 22 ms
[2021-05-16 06:22:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-16 06:22:17] [INFO ] Time to serialize gal into /tmp/LTL13802275370654191966.gal : 1 ms
[2021-05-16 06:22:17] [INFO ] Time to serialize properties into /tmp/LTL9661223065311811166.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13802275370654191966.gal, -t, CGAL, -LTL, /tmp/LTL9661223065311811166.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13802275370654191966.gal -t CGAL -LTL /tmp/LTL9661223065311811166.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(u1.TransferToDisk<1)")))||(("((u0.TaskReady<1)||(u1.TransferToDisk<1))")U(("((u1.TransferToDisk<1)&&((u0.TaskReady<1)||(u1.TransferToDisk<1)))")||(G("((u0.TaskReady<1)||(u1.TransferToDisk<1))"))))))))
Formula 0 simplified : !XF(XF"(u1.TransferToDisk<1)" | ("((u0.TaskReady<1)||(u1.TransferToDisk<1))" U ("((u1.TransferToDisk<1)&&((u0.TaskReady<1)||(u1.TransferToDisk<1)))" | G"((u0.TaskReady<1)||(u1.TransferToDisk<1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8739213598956949674
[2021-05-16 06:22:32] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8739213598956949674
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8739213598956949674]
Compilation finished in 161 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8739213598956949674]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((X(<>((LTLAPp0==true)))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8739213598956949674]
LTSmin run took 47 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-08 finished in 31144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U G(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:22:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:22:32] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:22:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:22:32] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:22:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:22:32] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0, p0, true]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-09 finished in 113 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(F((G(!p2)||p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:22:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 06:22:32] [INFO ] Implicit Places using invariants in 8 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8 ms to find 1 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:22:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:22:32] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:22:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:22:32] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(GEQ s4 1), p2:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p1:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 149 reset in 130 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 34 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-10 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((!p0||G(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:22:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 06:22:32] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:22:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 06:22:32] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-16 06:22:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:22:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 06:22:32] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p0), true]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1) (GEQ s6 1)), p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-12 finished in 99 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:22:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 06:22:32] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:22:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 06:22:32] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-16 06:22:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:22:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-16 06:22:32] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-14 automaton TGBA [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:(OR (LT s4 1) (LT s6 1) (AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1))), p0:(GEQ s7 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 711 steps with 0 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-14 finished in 112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 06:22:33] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 06:22:33] [INFO ] Implicit Places using invariants in 9 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 10 ms to find 1 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:22:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 06:22:33] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-16 06:22:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 06:22:33] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0128DC0064-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0128DC0064-15 finished in 113 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621146154062

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SmallOperatingSystem-PT-MT0128DC0064"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SmallOperatingSystem-PT-MT0128DC0064, 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 r254-tall-162106745400053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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