fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016700451
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1549.420 92186.00 161792.00 369.40 FTFTFFFFFTTFTTFT normal

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.r168-tall-165277016700451.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 PolyORBLF-COL-S02J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016700451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 8.2K Apr 29 13:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 13:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:50 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.4K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652851979656

Running Version 202205111006
[2022-05-18 05:33:00] [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-18 05:33:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 05:33:00] [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-18 05:33:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 05:33:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 661 ms
[2022-05-18 05:33:01] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 05:33:01] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2022-05-18 05:33:01] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-15 TRUE 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 10000 steps, including 3 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-18 05:33:02] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 05:33:02] [INFO ] Computed 26 place invariants in 12 ms
[2022-05-18 05:33:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 05:33:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 05:33:03] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:2
[2022-05-18 05:33:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 05:33:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 05:33:03] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2022-05-18 05:33:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-18 05:33:03] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2022-05-18 05:33:03] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 4 ms to minimize.
[2022-05-18 05:33:03] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2022-05-18 05:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2022-05-18 05:33:03] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-18 05:33:03] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 80 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 74 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 15 place count 73 transition count 54
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 35 place count 63 transition count 48
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 63 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 61 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 61 transition count 46
Applied a total of 40 rules in 28 ms. Remains 61 /81 variables (removed 20) and now considering 46/65 (removed 19) transitions.
[2022-05-18 05:33:03] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 61 cols
[2022-05-18 05:33:03] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-18 05:33:03] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 61/81 places, 44/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 42
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 58 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 4 ms. Remains 58 /61 variables (removed 3) and now considering 40/44 (removed 4) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/81 places, 40/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 05:33:03] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-18 05:33:03] [INFO ] Flatten gal took : 28 ms
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 05:33:03] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2022-05-18 05:33:03] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 23 ms.
[2022-05-18 05:33:03] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 175 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 38 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
[2022-05-18 05:33:03] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2022-05-18 05:33:03] [INFO ] Computed 48 place invariants in 40 ms
[2022-05-18 05:33:04] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
[2022-05-18 05:33:04] [INFO ] Flow matrix only has 1010 transitions (discarded 16 similar events)
// Phase 1: matrix 1010 rows 612 cols
[2022-05-18 05:33:04] [INFO ] Computed 48 place invariants in 44 ms
[2022-05-18 05:33:04] [INFO ] Implicit Places using invariants in 406 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 413 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 604/614 places, 1026/1114 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 602 transition count 1010
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 586 transition count 994
Applied a total of 18 rules in 19 ms. Remains 586 /604 variables (removed 18) and now considering 994/1026 (removed 32) transitions.
[2022-05-18 05:33:04] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 586 cols
[2022-05-18 05:33:04] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 05:33:05] [INFO ] Implicit Places using invariants in 284 ms returned []
[2022-05-18 05:33:05] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 586 cols
[2022-05-18 05:33:05] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 05:33:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:33:07] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 2664 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 586/614 places, 994/1114 transitions.
Finished structural reductions, in 2 iterations. Remains : 586/614 places, 994/1114 transitions.
Support contains 175 out of 586 places after structural reductions.
[2022-05-18 05:33:07] [INFO ] Flatten gal took : 86 ms
[2022-05-18 05:33:07] [INFO ] Flatten gal took : 97 ms
[2022-05-18 05:33:07] [INFO ] Input system was already deterministic with 994 transitions.
Incomplete random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 05:33:08] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 586 cols
[2022-05-18 05:33:08] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 05:33:08] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 05:33:08] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 27 ms returned sat
[2022-05-18 05:33:08] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
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' '!(F(G(p0)))'
Support contains 16 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 994/994 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 586 transition count 930
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 522 transition count 930
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 128 place count 522 transition count 866
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 256 place count 458 transition count 866
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 264 place count 450 transition count 858
Iterating global reduction 2 with 8 rules applied. Total rules applied 272 place count 450 transition count 858
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 384 place count 394 transition count 802
Applied a total of 384 rules in 106 ms. Remains 394 /586 variables (removed 192) and now considering 802/994 (removed 192) transitions.
[2022-05-18 05:33:08] [INFO ] Flow matrix only has 786 transitions (discarded 16 similar events)
// Phase 1: matrix 786 rows 394 cols
[2022-05-18 05:33:08] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 05:33:08] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
[2022-05-18 05:33:08] [INFO ] Flow matrix only has 786 transitions (discarded 16 similar events)
// Phase 1: matrix 786 rows 394 cols
[2022-05-18 05:33:08] [INFO ] Computed 40 place invariants in 23 ms
[2022-05-18 05:33:09] [INFO ] Implicit Places using invariants in 289 ms returned []
[2022-05-18 05:33:09] [INFO ] Flow matrix only has 786 transitions (discarded 16 similar events)
// Phase 1: matrix 786 rows 394 cols
[2022-05-18 05:33:09] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 05:33:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:33:12] [INFO ] Implicit Places using invariants and state equation in 2885 ms returned []
Implicit Place search using SMT with State Equation took 3179 ms to find 0 implicit places.
[2022-05-18 05:33:12] [INFO ] Redundant transitions in 49 ms returned []
[2022-05-18 05:33:12] [INFO ] Flow matrix only has 786 transitions (discarded 16 similar events)
// Phase 1: matrix 786 rows 394 cols
[2022-05-18 05:33:12] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 05:33:12] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/586 places, 802/994 transitions.
Finished structural reductions, in 1 iterations. Remains : 394/586 places, 802/994 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s314 s315 s316 s317 s318 s319 s320 s321) (ADD s98 s99 s100 s101 s102 s103 s104 s105))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 39 reset in 521 ms.
Stack based approach found an accepted trace after 1852 steps with 2 reset with depth 1167 and stack size 1167 in 25 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-00 finished in 4839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 56 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 994/994 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 578 transition count 986
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 578 transition count 986
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 570 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 570 transition count 978
Applied a total of 32 rules in 44 ms. Remains 570 /586 variables (removed 16) and now considering 978/994 (removed 16) transitions.
[2022-05-18 05:33:13] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:33:13] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 05:33:13] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
[2022-05-18 05:33:13] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:33:13] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 05:33:14] [INFO ] Implicit Places using invariants in 327 ms returned []
[2022-05-18 05:33:14] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:33:14] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 05:33:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:33:18] [INFO ] Implicit Places using invariants and state equation in 4836 ms returned []
Implicit Place search using SMT with State Equation took 5164 ms to find 0 implicit places.
[2022-05-18 05:33:18] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:33:18] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 05:33:19] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/586 places, 978/994 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/586 places, 978/994 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521) (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 604 ms.
Product exploration explored 100000 steps with 50000 reset in 513 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-01 finished in 7382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0)))||(X(p1)&&(!p0 U !p1))))'
Support contains 7 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 994/994 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 578 transition count 986
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 578 transition count 986
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 570 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 570 transition count 978
Applied a total of 32 rules in 43 ms. Remains 570 /586 variables (removed 16) and now considering 978/994 (removed 16) transitions.
[2022-05-18 05:33:20] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:33:20] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 05:33:21] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
[2022-05-18 05:33:21] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:33:21] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 05:33:21] [INFO ] Implicit Places using invariants in 343 ms returned []
[2022-05-18 05:33:21] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:33:21] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 05:33:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:33:26] [INFO ] Implicit Places using invariants and state equation in 5017 ms returned []
Implicit Place search using SMT with State Equation took 5371 ms to find 0 implicit places.
[2022-05-18 05:33:26] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:33:26] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 05:33:26] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/586 places, 978/994 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/586 places, 978/994 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 s200), p0:(GT s164 (ADD s206 s207 s208 s209 s210))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 19505 steps with 3 reset in 61 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-02 finished in 6495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 40 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 994/994 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 586 transition count 922
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 514 transition count 922
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 144 place count 514 transition count 898
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 192 place count 490 transition count 898
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 200 place count 482 transition count 890
Iterating global reduction 2 with 8 rules applied. Total rules applied 208 place count 482 transition count 890
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 336 place count 418 transition count 826
Applied a total of 336 rules in 63 ms. Remains 418 /586 variables (removed 168) and now considering 826/994 (removed 168) transitions.
[2022-05-18 05:33:27] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:27] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 05:33:27] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
[2022-05-18 05:33:27] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:27] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 05:33:27] [INFO ] Implicit Places using invariants in 267 ms returned []
[2022-05-18 05:33:27] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:27] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 05:33:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:33:30] [INFO ] Implicit Places using invariants and state equation in 2928 ms returned []
Implicit Place search using SMT with State Equation took 3196 ms to find 0 implicit places.
[2022-05-18 05:33:30] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-18 05:33:30] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:30] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 05:33:31] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/586 places, 826/994 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/586 places, 826/994 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-05 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 1 (ADD s378 s379 s380 s381 s382 s383 s384 s385 s386 s387 s388 s389 s390 s391 s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405...], 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 3954 reset in 328 ms.
Product exploration explored 100000 steps with 3940 reset in 326 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2022-05-18 05:33:32] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:32] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 05:33:32] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 05:33:32] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 99 ms returned sat
[2022-05-18 05:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:33:34] [INFO ] [Real]Absence check using state equation in 1533 ms returned sat
[2022-05-18 05:33:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:33:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 05:33:34] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 60 ms returned sat
[2022-05-18 05:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:33:35] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2022-05-18 05:33:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:33:35] [INFO ] [Nat]Added 96 Read/Feed constraints in 177 ms returned sat
[2022-05-18 05:33:36] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2022-05-18 05:33:36] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2022-05-18 05:33:36] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2022-05-18 05:33:36] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2022-05-18 05:33:36] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2022-05-18 05:33:36] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2022-05-18 05:33:36] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2022-05-18 05:33:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 779 ms
[2022-05-18 05:33:36] [INFO ] Computed and/alt/rep : 464/2053/456 causal constraints (skipped 352 transitions) in 68 ms.
[2022-05-18 05:33:39] [INFO ] Added : 212 causal constraints over 43 iterations in 2352 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 40 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 826/826 transitions.
Applied a total of 0 rules in 15 ms. Remains 418 /418 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2022-05-18 05:33:39] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:39] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 05:33:39] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
[2022-05-18 05:33:39] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:39] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 05:33:39] [INFO ] Implicit Places using invariants in 270 ms returned []
[2022-05-18 05:33:39] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:39] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 05:33:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:33:42] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2022-05-18 05:33:42] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-18 05:33:42] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:42] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 05:33:42] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 826/826 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2022-05-18 05:33:43] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:33:43] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 05:33:43] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 05:33:43] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 93 ms returned sat
[2022-05-18 05:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:33:45] [INFO ] [Real]Absence check using state equation in 1533 ms returned sat
[2022-05-18 05:33:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:33:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 05:33:45] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 57 ms returned sat
[2022-05-18 05:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:33:46] [INFO ] [Nat]Absence check using state equation in 1110 ms returned sat
[2022-05-18 05:33:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:33:46] [INFO ] [Nat]Added 96 Read/Feed constraints in 182 ms returned sat
[2022-05-18 05:33:46] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2022-05-18 05:33:47] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 0 ms to minimize.
[2022-05-18 05:33:47] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2022-05-18 05:33:47] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2022-05-18 05:33:47] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2022-05-18 05:33:47] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2022-05-18 05:33:47] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2022-05-18 05:33:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 800 ms
[2022-05-18 05:33:47] [INFO ] Computed and/alt/rep : 464/2053/456 causal constraints (skipped 352 transitions) in 78 ms.
[2022-05-18 05:33:49] [INFO ] Added : 212 causal constraints over 43 iterations in 2343 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3953 reset in 327 ms.
Product exploration explored 100000 steps with 3979 reset in 344 ms.
Built C files in :
/tmp/ltsmin15196838722205476132
[2022-05-18 05:33:50] [INFO ] Computing symmetric may disable matrix : 826 transitions.
[2022-05-18 05:33:50] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 05:33:50] [INFO ] Computing symmetric may enable matrix : 826 transitions.
[2022-05-18 05:33:50] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 05:33:50] [INFO ] Computing Do-Not-Accords matrix : 826 transitions.
[2022-05-18 05:33:50] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 05:33:50] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15196838722205476132
Running compilation step : cd /tmp/ltsmin15196838722205476132;'/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 2314 ms.
Running link step : cd /tmp/ltsmin15196838722205476132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin15196838722205476132;'/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/stateBased14712240814634545656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 40 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 826/826 transitions.
Applied a total of 0 rules in 14 ms. Remains 418 /418 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2022-05-18 05:34:05] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:34:05] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 05:34:06] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
[2022-05-18 05:34:06] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:34:06] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 05:34:06] [INFO ] Implicit Places using invariants in 289 ms returned []
[2022-05-18 05:34:06] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:34:06] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 05:34:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:34:09] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 2977 ms to find 0 implicit places.
[2022-05-18 05:34:09] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-18 05:34:09] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2022-05-18 05:34:09] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 05:34:09] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 826/826 transitions.
Built C files in :
/tmp/ltsmin1068458372311595940
[2022-05-18 05:34:09] [INFO ] Computing symmetric may disable matrix : 826 transitions.
[2022-05-18 05:34:09] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 05:34:09] [INFO ] Computing symmetric may enable matrix : 826 transitions.
[2022-05-18 05:34:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 05:34:09] [INFO ] Computing Do-Not-Accords matrix : 826 transitions.
[2022-05-18 05:34:09] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 05:34:09] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1068458372311595940
Running compilation step : cd /tmp/ltsmin1068458372311595940;'/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 2169 ms.
Running link step : cd /tmp/ltsmin1068458372311595940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1068458372311595940;'/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/stateBased1448602227495666127.hoa' '--buchi-type=spotba'
LTSmin run took 3400 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-05 finished in 48385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(!(p0 U p1)))&&X(X(p2))))))'
Support contains 72 out of 586 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 994/994 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 578 transition count 986
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 578 transition count 986
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 570 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 570 transition count 978
Applied a total of 32 rules in 21 ms. Remains 570 /586 variables (removed 16) and now considering 978/994 (removed 16) transitions.
[2022-05-18 05:34:15] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:34:15] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 05:34:15] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
[2022-05-18 05:34:15] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:34:15] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 05:34:16] [INFO ] Implicit Places using invariants in 302 ms returned []
[2022-05-18 05:34:16] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:34:16] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 05:34:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:34:21] [INFO ] Implicit Places using invariants and state equation in 5586 ms returned []
Implicit Place search using SMT with State Equation took 5892 ms to find 0 implicit places.
[2022-05-18 05:34:21] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:34:21] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 05:34:22] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/586 places, 978/994 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/586 places, 978/994 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(GT (ADD s522 s523 s524 s525 s526 s527 s528 s529) (ADD s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521)), p1:(LEQ (ADD ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-07 finished in 6930 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(p1)))'
Support contains 26 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 994/994 transitions.
Applied a total of 0 rules in 9 ms. Remains 586 /586 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2022-05-18 05:34:22] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 586 cols
[2022-05-18 05:34:22] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 05:34:22] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
[2022-05-18 05:34:22] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 586 cols
[2022-05-18 05:34:22] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 05:34:23] [INFO ] Implicit Places using invariants in 322 ms returned []
[2022-05-18 05:34:23] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 586 cols
[2022-05-18 05:34:23] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 05:34:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:34:26] [INFO ] Implicit Places using invariants and state equation in 2912 ms returned []
Implicit Place search using SMT with State Equation took 3235 ms to find 0 implicit places.
[2022-05-18 05:34:26] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 586 cols
[2022-05-18 05:34:26] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 05:34:26] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 586/586 places, 994/994 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-11 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 (ADD s500 s501 s502 s503 s504 s505 s506 s507) (ADD s520 s521)), p1:(LEQ (ADD s351 s352 s353 s354 s355 s356 s357 s358) (ADD s418 s419 s420 s421 s42...], 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]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-11 finished in 4185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 994/994 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 578 transition count 986
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 578 transition count 986
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 570 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 570 transition count 978
Applied a total of 32 rules in 22 ms. Remains 570 /586 variables (removed 16) and now considering 978/994 (removed 16) transitions.
[2022-05-18 05:34:26] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:34:26] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 05:34:26] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
[2022-05-18 05:34:26] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:34:27] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 05:34:27] [INFO ] Implicit Places using invariants in 348 ms returned []
[2022-05-18 05:34:27] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:34:27] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 05:34:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:34:31] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 4265 ms to find 0 implicit places.
[2022-05-18 05:34:31] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 05:34:31] [INFO ] Computed 40 place invariants in 21 ms
[2022-05-18 05:34:31] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/586 places, 978/994 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/586 places, 978/994 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s283)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-14 finished in 5222 ms.
All properties solved by simple procedures.
Total runtime 90969 ms.

BK_STOP 1652852071842

--------------------
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="PolyORBLF-COL-S02J04T08"
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 PolyORBLF-COL-S02J04T08, 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 r168-tall-165277016700451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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