Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416300788.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ResAllocation-PT-R010C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416300788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K 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.3K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 43K May 5 16:51 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-R010C002-00
FORMULA_NAME ResAllocation-PT-R010C002-01
FORMULA_NAME ResAllocation-PT-R010C002-02
FORMULA_NAME ResAllocation-PT-R010C002-03
FORMULA_NAME ResAllocation-PT-R010C002-04
FORMULA_NAME ResAllocation-PT-R010C002-05
FORMULA_NAME ResAllocation-PT-R010C002-06
FORMULA_NAME ResAllocation-PT-R010C002-07
FORMULA_NAME ResAllocation-PT-R010C002-08
FORMULA_NAME ResAllocation-PT-R010C002-09
FORMULA_NAME ResAllocation-PT-R010C002-10
FORMULA_NAME ResAllocation-PT-R010C002-11
FORMULA_NAME ResAllocation-PT-R010C002-12
FORMULA_NAME ResAllocation-PT-R010C002-13
FORMULA_NAME ResAllocation-PT-R010C002-14
FORMULA_NAME ResAllocation-PT-R010C002-15

=== Now, execution of the tool begins

BK_START 1621266721408

Running Version 0
[2021-05-17 15:52:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-17 15:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:52:03] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-17 15:52:03] [INFO ] Transformed 40 places.
[2021-05-17 15:52:03] [INFO ] Transformed 22 transitions.
[2021-05-17 15:52:03] [INFO ] Parsed PT model containing 40 places and 22 transitions in 75 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:52:03] [INFO ] Initial state test concluded for 3 properties.
FORMULA ResAllocation-PT-R010C002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 14 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 40 cols
[2021-05-17 15:52:03] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-17 15:52:03] [INFO ] Implicit Places using invariants in 100 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:03] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-17 15:52:03] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 39/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:03] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-17 15:52:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 39/40 places, 22/22 transitions.
[2021-05-17 15:52:03] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 15:52:03] [INFO ] Flatten gal took : 20 ms
FORMULA ResAllocation-PT-R010C002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:52:03] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:52:03] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 2990 resets, run finished after 215 ms. (steps per millisecond=465 ) properties (out of 23) seen :12
Running SMT prover for 11 properties.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:04] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned unsat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned unsat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned unsat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2021-05-17 15:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 15:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:52:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2021-05-17 15:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:52:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-17 15:52:04] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 15:52:04] [INFO ] Added : 17 causal constraints over 4 iterations in 26 ms. Result :sat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned unsat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 1 ms returned unsat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2021-05-17 15:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 15:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:52:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2021-05-17 15:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:52:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-17 15:52:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
[2021-05-17 15:52:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-17 15:52:04] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 15:52:04] [INFO ] Added : 14 causal constraints over 3 iterations in 20 ms. Result :sat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2021-05-17 15:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 15:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:52:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2021-05-17 15:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:52:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-17 15:52:04] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-17 15:52:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 1 ms returned unsat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2021-05-17 15:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 15:52:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:52:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2021-05-17 15:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:52:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 15:52:04] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 15:52:04] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-17 15:52:04] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
[2021-05-17 15:52:04] [INFO ] Initial state test concluded for 4 properties.
FORMULA ResAllocation-PT-R010C002-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 22/22 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 36 transition count 20
Applied a total of 5 rules in 11 ms. Remains 36 /39 variables (removed 3) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 36 cols
[2021-05-17 15:52:04] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-17 15:52:04] [INFO ] Implicit Places using invariants in 48 ms returned [20, 23, 25, 27, 29, 31, 33, 35]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 49 ms to find 8 implicit places.
[2021-05-17 15:52:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 15:52:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 15:52:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 28/39 places, 20/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2021-05-17 15:52:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 15:52:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 15:52:04] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/39 places, 20/22 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R010C002-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s17)], 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 31 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R010C002-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R010C002-00 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||G(p1)||F((!p1&&X(X(!p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:04] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-17 15:52:05] [INFO ] Implicit Places using invariants in 30 ms returned [21, 23, 26, 28, 32, 34, 38]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 32 ms to find 7 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 15:52:05] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 15:52:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 32/39 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 15:52:05] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 15:52:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/39 places, 22/22 transitions.
Stuttering acceptance computed with spot in 273 ms :[false, false, false, (AND (NOT p1) p0), p0, (OR p0 p1), p0, p0]
Running random walk in product with property : ResAllocation-PT-R010C002-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 6}, { cond=p1, acceptance={0} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=7 dest: 5}]], initial=1, aps=[p1:(LEQ s30 s26), p0:(LEQ s13 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 188 steps with 6 reset in 2 ms.
FORMULA ResAllocation-PT-R010C002-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R010C002-02 finished in 380 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:05] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-17 15:52:05] [INFO ] Implicit Places using invariants in 39 ms returned [23, 26, 28, 30, 32, 34, 36, 38]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 40 ms to find 8 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 15:52:05] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 15:52:05] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 31/39 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 15:52:05] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 15:52:05] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/39 places, 22/22 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R010C002-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s23 s21) (LEQ s16 s12))], 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][false, false, false]]
Product exploration explored 100000 steps with 2985 reset in 213 ms.
Product exploration explored 100000 steps with 2983 reset in 137 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2988 reset in 117 ms.
Product exploration explored 100000 steps with 2977 reset in 111 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2021-05-17 15:52:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 15:52:06] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 15:52:06] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 22/22 transitions.
Product exploration explored 100000 steps with 2985 reset in 255 ms.
Product exploration explored 100000 steps with 2992 reset in 185 ms.
[2021-05-17 15:52:06] [INFO ] Flatten gal took : 4 ms
[2021-05-17 15:52:06] [INFO ] Flatten gal took : 5 ms
[2021-05-17 15:52:06] [INFO ] Time to serialize gal into /tmp/LTL6542678789343937182.gal : 1 ms
[2021-05-17 15:52:06] [INFO ] Time to serialize properties into /tmp/LTL6764202946547410218.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/LTL6542678789343937182.gal, -t, CGAL, -LTL, /tmp/LTL6764202946547410218.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/LTL6542678789343937182.gal -t CGAL -LTL /tmp/LTL6764202946547410218.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("((p_1_2<=r_1_0)||(p_0_8<=p_0_6))"))))
Formula 0 simplified : !XG"((p_1_2<=r_1_0)||(p_0_8<=p_0_6))"
Reverse transition relation is NOT exact ! Due to transitions t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/20/2/22
Computing Next relation with stutter on 9 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 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,0.086398,18616,1,0,126,12700,67,161,952,18682,332
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R010C002-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R010C002-04 finished in 1717 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:07] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-17 15:52:07] [INFO ] Implicit Places using invariants in 49 ms returned [21, 23, 26, 28, 30, 32, 34, 36, 38]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 15:52:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 30/39 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 15:52:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/39 places, 22/22 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ResAllocation-PT-R010C002-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s22 s0), p1:(OR (LEQ s9 s13) (LEQ s5 s0))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 79 steps with 2 reset in 1 ms.
FORMULA ResAllocation-PT-R010C002-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R010C002-05 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:07] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-17 15:52:07] [INFO ] Implicit Places using invariants in 28 ms returned [21, 23, 26, 28, 30, 32, 34, 36, 38]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 29 ms to find 9 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 15:52:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 30/39 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 15:52:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/39 places, 22/22 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0, p0]
Running random walk in product with property : ResAllocation-PT-R010C002-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s24)], 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 84 steps with 2 reset in 0 ms.
FORMULA ResAllocation-PT-R010C002-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R010C002-08 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(G((p1||X(G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:07] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-17 15:52:07] [INFO ] Implicit Places using invariants in 29 ms returned [21, 26, 28, 30, 34, 36, 38]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 30 ms to find 7 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 15:52:07] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 32/39 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 15:52:07] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/39 places, 22/22 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R010C002-11 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=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(GT s12 s22), p0:(GT 1 s28)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R010C002-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R010C002-11 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 39 cols
[2021-05-17 15:52:07] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-17 15:52:07] [INFO ] Implicit Places using invariants in 28 ms returned [21, 23, 26, 28, 30, 32, 34, 36, 38]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 29 ms to find 9 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 15:52:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 30/39 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 15:52:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/39 places, 22/22 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R010C002-13 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s0 s3)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R010C002-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R010C002-13 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 22/22 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 36 transition count 20
Applied a total of 5 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 36 cols
[2021-05-17 15:52:07] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 15:52:07] [INFO ] Implicit Places using invariants in 24 ms returned [20, 23, 25, 27, 29, 31, 33, 35]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 25 ms to find 8 implicit places.
[2021-05-17 15:52:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 15:52:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 28/39 places, 20/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2021-05-17 15:52:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 15:52:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/39 places, 20/22 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R010C002-15 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:(LEQ 1 s14)], 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 34 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R010C002-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R010C002-15 finished in 140 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621266728147

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ResAllocation-PT-R010C002"
export BK_EXAMINATION="LTLCardinality"
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 ResAllocation-PT-R010C002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089416300788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R010C002.tgz
mv ResAllocation-PT-R010C002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;