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

About the Execution of ITS-Tools for Kanban-PT-20000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1019.495 10630.00 17156.00 87.90 FTFTFFFTTTFTTTFF 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.r132-tall-165271820700323.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 Kanban-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820700323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 17:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 17:36 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 3.9K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-20000-LTLCardinality-00
FORMULA_NAME Kanban-PT-20000-LTLCardinality-01
FORMULA_NAME Kanban-PT-20000-LTLCardinality-02
FORMULA_NAME Kanban-PT-20000-LTLCardinality-03
FORMULA_NAME Kanban-PT-20000-LTLCardinality-04
FORMULA_NAME Kanban-PT-20000-LTLCardinality-05
FORMULA_NAME Kanban-PT-20000-LTLCardinality-06
FORMULA_NAME Kanban-PT-20000-LTLCardinality-07
FORMULA_NAME Kanban-PT-20000-LTLCardinality-08
FORMULA_NAME Kanban-PT-20000-LTLCardinality-09
FORMULA_NAME Kanban-PT-20000-LTLCardinality-10
FORMULA_NAME Kanban-PT-20000-LTLCardinality-11
FORMULA_NAME Kanban-PT-20000-LTLCardinality-12
FORMULA_NAME Kanban-PT-20000-LTLCardinality-13
FORMULA_NAME Kanban-PT-20000-LTLCardinality-14
FORMULA_NAME Kanban-PT-20000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652774477676

Running Version 202205111006
[2022-05-17 08:01:18] [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-17 08:01:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 08:01:18] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2022-05-17 08:01:18] [INFO ] Transformed 16 places.
[2022-05-17 08:01:18] [INFO ] Transformed 16 transitions.
[2022-05-17 08:01:18] [INFO ] Parsed PT model containing 16 places and 16 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Kanban-PT-20000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 17 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:01:19] [INFO ] Computed 4 place invariants in 11 ms
[2022-05-17 08:01:19] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:01:19] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 08:01:19] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:01:19] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-17 08:01:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Support contains 13 out of 15 places after structural reductions.
[2022-05-17 08:01:19] [INFO ] Flatten gal took : 15 ms
[2022-05-17 08:01:19] [INFO ] Flatten gal took : 3 ms
[2022-05-17 08:01:19] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 20001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=1000 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:01:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:01:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:01:19] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-17 08:01:19] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 08:01:19] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 08:01:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-17 08:01:19] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 08:01:19] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-17 08:01:19] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 179469 steps, including 0 resets, run visited all 1 properties in 190 ms. (steps per millisecond=944 )
Parikh walk visited 3 properties in 2121 ms.
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' '!((X(F(((F(p0)||G(p1))&&p2)))&&G(X(p3))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:01:22] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-20000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1) p3), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p0) p1 p3), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(LEQ s11 s0), p2:(GT 3 s0), p0:(GT 2 s11), p1:(GT s5 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Kanban-PT-20000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLCardinality-00 finished in 554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U ((F(X(p1)) U p2)&&X(G((X(p2)||p1)))))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:01:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:01:22] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:01:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:01:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:22] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 16/16 transitions.
Stuttering acceptance computed with spot in 681 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-20000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 11}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 12}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 4}], [{ cond=(NOT p1), acceptance={} source=11 dest: 11}, { cond=(NOT p1), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=12 dest: 13}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=12 dest: 14}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=12 dest: 15}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=13 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=14 dest: 15}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=15 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=16 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=16 dest: 11}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=16 dest: 12}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=16 dest: 16}]], initial=0, aps=[p0:(LEQ 3 s5), p2:(LEQ s0 s7), p1:(LEQ 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 8 reset in 2 ms.
FORMULA Kanban-PT-20000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLCardinality-04 finished in 827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(p0)&&p0)))))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 8 / 15 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 3030 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2022-05-17 08:01:26] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:01:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-17 08:01:26] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:01:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-17 08:01:26] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:01:26] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:01:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 11/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-20000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-20000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLCardinality-05 finished in 3271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (!F(p1)||p2))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:01:26] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:26] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : Kanban-PT-20000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 3 s10), p1:(LEQ 3 s0), p0:(OR (LEQ s0 s4) (LEQ 3 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 14 reset in 2 ms.
FORMULA Kanban-PT-20000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLCardinality-06 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(G(X(p0))))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:01:27] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 08:01:27] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s4 s8)], 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 6 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-20000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLCardinality-10 finished in 250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:27] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:01:27] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:01:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-20000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(LEQ s2 s7), p1:(LEQ s10 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 45 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Kanban-PT-20000-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-20000-LTLCardinality-13 finished in 536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F(!p0)))))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 5 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:01:27] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:01:27] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:01:27] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 08:01:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, true, (NOT p0), p0, p0]
Running random walk in product with property : Kanban-PT-20000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10464 reset in 94 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 14 in 0 ms.
FORMULA Kanban-PT-20000-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLCardinality-14 finished in 360 ms.
All properties solved by simple procedures.
Total runtime 9435 ms.

BK_STOP 1652774488306

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Kanban-PT-20000"
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 Kanban-PT-20000, 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 r132-tall-165271820700323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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