Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477100035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GlobalResAllocation-COL-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477100035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 9.2K Apr 30 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 GlobalResAllocation-COL-09-LTLCardinality-00
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-01
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-02
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-03
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-04
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-05
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-06
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-07
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-08
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-09
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-10
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-11
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-12
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-13
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-14
FORMULA_NAME GlobalResAllocation-COL-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652682812043

Running Version 202205111006
[2022-05-16 06:33:34] [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]
[2022-05-16 06:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:33:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 06:33:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 06:33:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1122 ms
[2022-05-16 06:33:35] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 207 PT places and 1003437.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 06:33:35] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 8 ms.
[2022-05-16 06:33:35] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 6 formulas.
FORMULA GlobalResAllocation-COL-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-09-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-09-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-09-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
Normalized transition count is 6 out of 7 initially.
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 06:33:35] [INFO ] Computed 3 place invariants in 12 ms
[2022-05-16 06:33:36] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 06:33:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 06:33:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 06:33:36] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2022-05-16 06:33:36] [INFO ] Flatten gal took : 21 ms
[2022-05-16 06:33:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA GlobalResAllocation-COL-09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 06:33:36] [INFO ] Flatten gal took : 4 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 18
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2022-05-16 06:33:36] [INFO ] Unfolded HLPN to a Petri net with 37 places and 63 transitions 261 arcs in 16 ms.
[2022-05-16 06:33:36] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 37 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 63/63 transitions.
Reduce isomorphic (modulo) transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 37 transition count 54
Applied a total of 18 rules in 9 ms. Remains 37 /37 variables (removed 0) and now considering 54/63 (removed 9) transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:33:36] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-16 06:33:36] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:33:36] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 06:33:36] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:33:36] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 06:33:36] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 37 cols
[2022-05-16 06:33:36] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-16 06:33:36] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/37 places, 54/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 54/63 transitions.
Support contains 37 out of 37 places after structural reductions.
[2022-05-16 06:33:36] [INFO ] Flatten gal took : 14 ms
[2022-05-16 06:33:36] [INFO ] Flatten gal took : 67 ms
[2022-05-16 06:33:36] [INFO ] Input system was already deterministic with 54 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 12 properties in 8 ms. (steps per millisecond=1 )
FORMULA GlobalResAllocation-COL-09-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GlobalResAllocation-COL-09-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GlobalResAllocation-COL-09-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)&&(F(X(G(p1)))||X(p1))))))'
Support contains 10 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Applied a total of 0 rules in 7 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:37] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:33:37] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:33:37] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:37] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 06:33:37] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-05-16 06:33:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:37] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 06:33:37] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 642 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 (ADD s19 s20 s21 s22 s23 s24 s25 s26 s27)), p1:(GT s9 (ADD s19 s20 s21 s22 s23 s24 s25 s26 s27))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 1074 ms.
Product exploration explored 100000 steps with 0 reset in 652 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 429 ms. Reduced automaton from 6 states, 22 edges and 2 AP to 6 states, 22 edges and 2 AP.
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:41] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 06:33:41] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 06:33:41] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 06:33:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-16 06:33:41] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 637 ms. Reduced automaton from 6 states, 22 edges and 2 AP to 6 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:42] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:33:42] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-16 06:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:33:42] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 06:33:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:33:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-16 06:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:33:42] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 06:33:42] [INFO ] Computed and/alt/rep : 18/72/18 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 06:33:42] [INFO ] Added : 2 causal constraints over 2 iterations in 38 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 54/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:42] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:33:42] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:42] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 06:33:42] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:42] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:33:42] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-16 06:33:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:42] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:33:42] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 54/54 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 297 ms. Reduced automaton from 6 states, 19 edges and 2 AP to 6 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 515 ms. Reduced automaton from 6 states, 19 edges and 2 AP to 6 states, 19 edges and 2 AP.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:33:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:33:44] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-16 06:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:33:44] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-16 06:33:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:33:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-16 06:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:33:44] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-16 06:33:44] [INFO ] Computed and/alt/rep : 18/72/18 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 06:33:44] [INFO ] Added : 2 causal constraints over 2 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 444 ms.
Product exploration explored 100000 steps with 2 reset in 364 ms.
Built C files in :
/tmp/ltsmin8353568457998383411
[2022-05-16 06:33:46] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2022-05-16 06:33:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:33:46] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2022-05-16 06:33:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:33:46] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2022-05-16 06:33:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:33:46] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8353568457998383411
Running compilation step : cd /tmp/ltsmin8353568457998383411;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin8353568457998383411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin8353568457998383411;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4404295303488507314.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:01] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:01] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:01] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-16 06:34:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:01] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 54/54 transitions.
Built C files in :
/tmp/ltsmin9473932688284974567
[2022-05-16 06:34:01] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2022-05-16 06:34:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:01] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2022-05-16 06:34:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:01] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2022-05-16 06:34:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9473932688284974567
Running compilation step : cd /tmp/ltsmin9473932688284974567;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 190 ms.
Running link step : cd /tmp/ltsmin9473932688284974567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9473932688284974567;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1161875453867258489.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:34:16] [INFO ] Flatten gal took : 9 ms
[2022-05-16 06:34:16] [INFO ] Flatten gal took : 7 ms
[2022-05-16 06:34:16] [INFO ] Time to serialize gal into /tmp/LTL95640532042876943.gal : 3 ms
[2022-05-16 06:34:16] [INFO ] Time to serialize properties into /tmp/LTL2755197284174854507.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL95640532042876943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2755197284174854507.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9564053...264
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((pr_released_0+pr_released_1)+(pr_released_2+pr_released_3))+((pr_released_4+pr_released_5)+(pr_released_6+pr_released_...521
Formula 0 simplified : !GF(G"(((((pr_released_0+pr_released_1)+(pr_released_2+pr_released_3))+((pr_released_4+pr_released_5)+(pr_released_6+pr_released_7))...503
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
2 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
548 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,5.51931,104848,1,0,193,356538,23,89,10382,426188,500
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-09-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GlobalResAllocation-COL-09-LTLCardinality-01 finished in 45566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U G(F((F(X(p1)) U p0))))))'
Support contains 9 out of 37 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Applied a total of 0 rules in 4 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:22] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:22] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:22] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:23] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:23] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-16 06:34:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:23] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3596 reset in 256 ms.
Stack based approach found an accepted trace after 756 steps with 28 reset with depth 27 and stack size 27 in 3 ms.
FORMULA GlobalResAllocation-COL-09-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLCardinality-03 finished in 542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(F(G(p0)))&&G(p1)))))'
Support contains 27 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 28 transition count 54
Applied a total of 9 rules in 2 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:23] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:23] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:23] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:23] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/37 places, 54/54 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18)), p1:(GT (ADD s19 s20 s21 s22 s23 s24 s25 s26 s27) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-09-LTLCardinality-05 finished in 419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((F(p0) U p1)))||G(X(F(!p0))))))'
Support contains 27 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Applied a total of 0 rules in 2 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:23] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:23] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:23] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 06:34:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 06:34:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:24] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:24] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8)), p0:(LEQ (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18) (ADD s19 s20 s21 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1639 reset in 276 ms.
Stack based approach found an accepted trace after 222 steps with 3 reset with depth 65 and stack size 65 in 1 ms.
FORMULA GlobalResAllocation-COL-09-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-09-LTLCardinality-06 finished in 567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p1)&&p2)||p0))))'
Support contains 19 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Applied a total of 0 rules in 3 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:24] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:24] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:24] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:24] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-16 06:34:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:24] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:24] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 2 s9), p0:(OR (LEQ 1 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18)) (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8) s9)), p1:(LEQ 1 (ADD s10 s11 s12 s13 s14 s15 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11 reset in 341 ms.
Product exploration explored 100000 steps with 7 reset in 297 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (OR p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 488 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:26] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-16 06:34:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-16 06:34:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 06:34:26] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (OR p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p1) p0))), (G (OR p0 p2)), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0) p2)))]
Knowledge based reduction with 12 factoid took 733 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:27] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:27] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-16 06:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:34:27] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 06:34:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:34:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-16 06:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:34:27] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 06:34:27] [INFO ] Computed and/alt/rep : 18/72/18 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 06:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Support contains 10 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 54/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:27] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:27] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:27] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:27] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:27] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:27] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2022-05-16 06:34:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:27] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:27] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 54/54 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:28] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:28] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-16 06:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:34:28] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 06:34:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:34:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-16 06:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:34:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-16 06:34:28] [INFO ] Computed and/alt/rep : 18/72/18 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 06:34:28] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 2 reset in 223 ms.
Product exploration explored 100000 steps with 0 reset in 394 ms.
Built C files in :
/tmp/ltsmin10548112351948425229
[2022-05-16 06:34:29] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2022-05-16 06:34:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:29] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2022-05-16 06:34:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:29] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2022-05-16 06:34:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10548112351948425229
Running compilation step : cd /tmp/ltsmin10548112351948425229;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin10548112351948425229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10548112351948425229;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13019513432128276157.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:44] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:34:44] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:44] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:44] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2022-05-16 06:34:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:34:44] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:34:44] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 54/54 transitions.
Built C files in :
/tmp/ltsmin12475362783619131274
[2022-05-16 06:34:44] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2022-05-16 06:34:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:44] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2022-05-16 06:34:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:44] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2022-05-16 06:34:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:34:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12475362783619131274
Running compilation step : cd /tmp/ltsmin12475362783619131274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 184 ms.
Running link step : cd /tmp/ltsmin12475362783619131274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12475362783619131274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6545301503613558581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 06:34:59] [INFO ] Flatten gal took : 7 ms
[2022-05-16 06:34:59] [INFO ] Flatten gal took : 6 ms
[2022-05-16 06:34:59] [INFO ] Time to serialize gal into /tmp/LTL8506225743312576980.gal : 2 ms
[2022-05-16 06:34:59] [INFO ] Time to serialize properties into /tmp/LTL15009150442722701399.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8506225743312576980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15009150442722701399.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8506225...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((pr_in_0+pr_in_1)+(pr_in_2+pr_in_3))+((pr_in_4+pr_in_5)+(pr_in_6+pr_in_7)))+pr_in_8)>=1)||(((((Processes_0+Processes_1)+...394
Formula 0 simplified : !FG("((((((pr_in_0+pr_in_1)+(pr_in_2+pr_in_3))+((pr_in_4+pr_in_5)+(pr_in_6+pr_in_7)))+pr_in_8)>=1)||(((((Processes_0+Processes_1)+(P...384
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
191 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.92697,45640,1,0,42,78439,44,19,8917,74876,183
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-09-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GlobalResAllocation-COL-09-LTLCardinality-08 finished in 37540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 18 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 54/54 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 28 transition count 54
Applied a total of 9 rules in 1 ms. Remains 28 /37 variables (removed 9) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:35:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:02] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:35:02] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:02] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:35:02] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 28 cols
[2022-05-16 06:35:02] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:35:02] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/37 places, 54/54 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 54/54 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-09-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 2 (ADD s19 s20 s21 s22 s23 s24 s25 s26 s27)), p1:(LEQ 2 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 225 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-09-LTLCardinality-15 finished in 739 ms.
All properties solved by simple procedures.
Total runtime 88672 ms.

BK_STOP 1652682902842

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="GlobalResAllocation-COL-09"
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 GlobalResAllocation-COL-09, 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 r114-smll-165264477100035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-09.tgz
mv GlobalResAllocation-COL-09 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 ;