Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679172372923

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT0064DC0016
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 20:46:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:46:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:46:15] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-18 20:46:15] [INFO ] Transformed 9 places.
[2023-03-18 20:46:15] [INFO ] Transformed 8 transitions.
[2023-03-18 20:46:16] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 20 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 20:46:16] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 20:46:16] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-18 20:46:16] [INFO ] Invariant cache hit.
[2023-03-18 20:46:16] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-18 20:46:16] [INFO ] Invariant cache hit.
[2023-03-18 20:46:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 8 out of 9 places after structural reductions.
[2023-03-18 20:46:16] [INFO ] Flatten gal took : 19 ms
[2023-03-18 20:46:16] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:46:16] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:46:17] [INFO ] Invariant cache hit.
[2023-03-18 20:46:17] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-18 20:46:17] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-18 20:46:17] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:46:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:46:17] [INFO ] Invariant cache hit.
[2023-03-18 20:46:17] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 20:46:17] [INFO ] Invariant cache hit.
[2023-03-18 20:46:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT 1 s5), p0:(GT s2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4609 reset in 377 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 8 and stack size 8 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-00 finished in 875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(G(p1)||G(p2)))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:46:18] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:46:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 20:46:18] [INFO ] Invariant cache hit.
[2023-03-18 20:46:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-18 20:46:18] [INFO ] Invariant cache hit.
[2023-03-18 20:46:18] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT 3 s6), p2:(AND (LEQ 3 s6) (LEQ 1 s6)), p0:(GT 1 s6)], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 5 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-01 finished in 513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p0&&F(p1))))))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
[2023-03-18 20:46:19] [INFO ] Invariant cache hit.
[2023-03-18 20:46:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 20:46:19] [INFO ] Invariant cache hit.
[2023-03-18 20:46:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-18 20:46:19] [INFO ] Invariant cache hit.
[2023-03-18 20:46:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s3), p1:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1485 reset in 269 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-03 finished in 610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||(X(X(X(p0)))&&F(!p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
[2023-03-18 20:46:19] [INFO ] Invariant cache hit.
[2023-03-18 20:46:19] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 20:46:19] [INFO ] Invariant cache hit.
[2023-03-18 20:46:19] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-18 20:46:19] [INFO ] Invariant cache hit.
[2023-03-18 20:46:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 11}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(NOT p1), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={} source=8 dest: 4}, { cond=(NOT p0), acceptance={} source=8 dest: 6}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 11}], [{ cond=(NOT p0), acceptance={} source=11 dest: 3}]], initial=8, aps=[p0:(LEQ 1 s1), p1:(GT s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 139 ms.
Product exploration explored 100000 steps with 25000 reset in 107 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 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 441 ms. Reduced automaton from 12 states, 23 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3021 steps, including 0 resets, run visited all 4 properties in 17 ms. (steps per millisecond=177 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 p0)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F p1)]
Knowledge based reduction with 10 factoid took 636 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 304 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-18 20:46:22] [INFO ] Invariant cache hit.
[2023-03-18 20:46:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 20:46:22] [INFO ] Invariant cache hit.
[2023-03-18 20:46:22] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 20:46:22] [INFO ] Invariant cache hit.
[2023-03-18 20:46:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 7/7 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 204 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 334 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 296 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Product exploration explored 100000 steps with 25000 reset in 85 ms.
Built C files in :
/tmp/ltsmin10804015406814965733
[2023-03-18 20:46:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10804015406814965733
Running compilation step : cd /tmp/ltsmin10804015406814965733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin10804015406814965733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin10804015406814965733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2155684450186282794.hoa' '--buchi-type=spotba'
LTSmin run took 198 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-05 finished in 5858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||X(((p0||F(p2)) U G(!p3))))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 9 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-18 20:46:25] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:46:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 20:46:25] [INFO ] Invariant cache hit.
[2023-03-18 20:46:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-18 20:46:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:46:25] [INFO ] Invariant cache hit.
[2023-03-18 20:46:25] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) p3)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s1 s3), p3:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 266 reset in 149 ms.
Stack based approach found an accepted trace after 4541 steps with 10 reset with depth 566 and stack size 482 in 7 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-06 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X((p1 U p2)))))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:46:25] [INFO ] Invariant cache hit.
[2023-03-18 20:46:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 20:46:25] [INFO ] Invariant cache hit.
[2023-03-18 20:46:25] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-18 20:46:25] [INFO ] Invariant cache hit.
[2023-03-18 20:46:25] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s1), p2:(OR (LEQ s4 s3) (LEQ 2 s1)), p1:(OR (LEQ s3 s4) (LEQ s3 s2) (LEQ 3 s6))], 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 20073 reset in 99 ms.
Product exploration explored 100000 steps with 20001 reset in 94 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 p2 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:46:26] [INFO ] Invariant cache hit.
[2023-03-18 20:46:26] [INFO ] After 25ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Support contains 3 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:46:27] [INFO ] Invariant cache hit.
[2023-03-18 20:46:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 20:46:27] [INFO ] Invariant cache hit.
[2023-03-18 20:46:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-18 20:46:27] [INFO ] Invariant cache hit.
[2023-03-18 20:46:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 8/8 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Finished random walk after 188 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND p0 p2), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 19997 reset in 139 ms.
Product exploration explored 100000 steps with 20020 reset in 150 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2)]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 5 ms. Remains 7 /8 variables (removed 1) and now considering 7/8 (removed 1) transitions.
[2023-03-18 20:46:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:46:29] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:46:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49 ms. Remains : 7/8 places, 7/8 transitions.
Built C files in :
/tmp/ltsmin1000782381047475067
[2023-03-18 20:46:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1000782381047475067
Running compilation step : cd /tmp/ltsmin1000782381047475067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 137 ms.
Running link step : cd /tmp/ltsmin1000782381047475067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1000782381047475067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13203659395712636377.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-08 finished in 4096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(!p0) U p1) U (false U !p2))&&X(F(!p0))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-18 20:46:29] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:46:30] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 20:46:30] [INFO ] Invariant cache hit.
[2023-03-18 20:46:30] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-18 20:46:30] [INFO ] Invariant cache hit.
[2023-03-18 20:46:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR p2 p0), p0, (OR (NOT p1) p0), p2, true]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GT 3 s6), p1:(LEQ s6 s7), p0:(GT 1 s3)], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 103 steps with 2 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-09 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p1||F(!p2)))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:46:30] [INFO ] Invariant cache hit.
[2023-03-18 20:46:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 20:46:30] [INFO ] Invariant cache hit.
[2023-03-18 20:46:30] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-18 20:46:30] [INFO ] Invariant cache hit.
[2023-03-18 20:46:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s5), p1:(LEQ s6 s1), p2:(GT 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33209 reset in 129 ms.
Product exploration explored 100000 steps with 33413 reset in 138 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 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 8 factoid took 566 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Finished random walk after 475 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=118 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND p2 (NOT p0))), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) p2 p0))]
Knowledge based reduction with 8 factoid took 580 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:46:32] [INFO ] Invariant cache hit.
[2023-03-18 20:46:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 20:46:32] [INFO ] Invariant cache hit.
[2023-03-18 20:46:32] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-18 20:46:32] [INFO ] Invariant cache hit.
[2023-03-18 20:46:32] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 8/8 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 8 factoid took 402 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Finished random walk after 890 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=178 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2 p0))), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) p0 p2))]
Knowledge based reduction with 8 factoid took 567 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 33408 reset in 120 ms.
Product exploration explored 100000 steps with 33244 reset in 141 ms.
Built C files in :
/tmp/ltsmin7255236669115758971
[2023-03-18 20:46:34] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7255236669115758971
Running compilation step : cd /tmp/ltsmin7255236669115758971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 119 ms.
Running link step : cd /tmp/ltsmin7255236669115758971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7255236669115758971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12467595644890667583.hoa' '--buchi-type=spotba'
LTSmin run took 1052 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-12 finished in 5835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1 U (!p1 U G((p2 U X(!p0)))))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:46:36] [INFO ] Invariant cache hit.
[2023-03-18 20:46:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 20:46:36] [INFO ] Invariant cache hit.
[2023-03-18 20:46:36] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-18 20:46:36] [INFO ] Invariant cache hit.
[2023-03-18 20:46:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 561 ms :[p0, p0, p0, p0, p0, p0, p0, p0, p0, p0, true]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=0 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1 p0), acceptance={0} source=1 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 7}, { cond=(AND p1 p0), acceptance={} source=2 dest: 8}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 7}, { cond=p1, acceptance={} source=3 dest: 8}, { cond=(AND p2 p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 p1 p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 7}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 9}], [{ cond=p0, acceptance={} source=7 dest: 10}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}, { cond=p2, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=9 dest: 7}, { cond=(AND p2 p0), acceptance={0} source=9 dest: 9}], [{ cond=true, acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(GT 1 s3), p2:(LEQ 3 s7), p1:(GT 2 s3)], 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][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 363 steps with 53 reset in 4 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-13 finished in 711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 18 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-18 20:46:36] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 20:46:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:46:36] [INFO ] Invariant cache hit.
[2023-03-18 20:46:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-18 20:46:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:46:36] [INFO ] Invariant cache hit.
[2023-03-18 20:46:37] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/9 places, 5/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 4/9 places, 5/8 transitions.
Stuttering acceptance computed with spot in 52 ms :[p0]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s2)], 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 271 steps with 0 reset in 2 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-15 finished in 190 ms.
All properties solved by simple procedures.
Total runtime 21236 ms.

BK_STOP 1679172398164

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmallOperatingSystem-PT-MT0064DC0016"
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-5348"
echo " Executing tool itstools"
echo " Input is SmallOperatingSystem-PT-MT0064DC0016, 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 r453-smll-167912644900027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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