Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745900404.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-AN02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745900404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 9.4K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 6.5K May 5 16:52 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 Sudoku-COL-AN02-00
FORMULA_NAME Sudoku-COL-AN02-01
FORMULA_NAME Sudoku-COL-AN02-02
FORMULA_NAME Sudoku-COL-AN02-03
FORMULA_NAME Sudoku-COL-AN02-04
FORMULA_NAME Sudoku-COL-AN02-05
FORMULA_NAME Sudoku-COL-AN02-06
FORMULA_NAME Sudoku-COL-AN02-07
FORMULA_NAME Sudoku-COL-AN02-08
FORMULA_NAME Sudoku-COL-AN02-09
FORMULA_NAME Sudoku-COL-AN02-10
FORMULA_NAME Sudoku-COL-AN02-11
FORMULA_NAME Sudoku-COL-AN02-12
FORMULA_NAME Sudoku-COL-AN02-13
FORMULA_NAME Sudoku-COL-AN02-14
FORMULA_NAME Sudoku-COL-AN02-15

=== Now, execution of the tool begins

BK_START 1621193993061

Running Version 0
[2021-05-16 19:39:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 19:39:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 19:39:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-16 19:39:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 19:39:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 476 ms
[2021-05-16 19:39:55] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2021-05-16 19:39:55] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 20 PT places and 8.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:39:55] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions in 3 ms.
[2021-05-16 19:39:55] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_5663456709630086257.dot
[2021-05-16 19:39:55] [INFO ] Initial state test concluded for 4 properties.
FORMULA Sudoku-COL-AN02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100001 steps, including 16666 resets, run finished after 148 ms. (steps per millisecond=675 ) properties (out of 21) seen :16
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 4 cols
[2021-05-16 19:39:55] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-16 19:39:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-16 19:39:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 19:39:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 19:39:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 19:39:55] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN02-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:39:55] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 19:39:55] [INFO ] Flatten gal took : 15 ms
FORMULA Sudoku-COL-AN02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:39:55] [INFO ] Flatten gal took : 1 ms
[2021-05-16 19:39:55] [INFO ] Unfolded HLPN to a Petri net with 20 places and 8 transitions in 2 ms.
[2021-05-16 19:39:55] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_14676481421836981498.dot
[2021-05-16 19:39:55] [INFO ] Initial state test concluded for 2 properties.
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:55] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:55] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:55] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:55] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 19:39:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
[2021-05-16 19:39:55] [INFO ] Flatten gal took : 3 ms
[2021-05-16 19:39:55] [INFO ] Flatten gal took : 3 ms
[2021-05-16 19:39:55] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 100000 steps, including 22186 resets, run finished after 247 ms. (steps per millisecond=404 ) properties (out of 12) seen :11
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:55] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:55] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:39:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:39:55] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:39:56] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-16 19:39:56] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-16 19:39:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:39:56] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-16 19:39:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 3 (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-01 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 16 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:56] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 8 ms
[2021-05-16 19:39:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2021-05-16 19:39:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN02-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3)), p0:(LEQ 1 (ADD s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-04 finished in 148 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:56] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:56] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 1 (ADD s4 s5 s6 s7 s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-05 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||G(p0)||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:56] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:56] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:56] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN02-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=2, aps=[p2:(AND (LEQ (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7 s8 s9 s10 s11)) (LEQ 2 (ADD s12 s13 s14 s15))), p1:(LEQ (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7 s8 s9 s10 s11)), p0:(LEQ 2 (ADD s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Product exploration explored 100000 steps with 33333 reset in 220 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (NOT p2), (NOT p1), p0]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 153 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 20 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-16 19:39:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:57] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:57] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Product exploration explored 100000 steps with 33333 reset in 172 ms.
Product exploration explored 100000 steps with 33333 reset in 184 ms.
[2021-05-16 19:39:58] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:39:58] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:39:58] [INFO ] Time to serialize gal into /tmp/LTL13198606077416153302.gal : 1 ms
[2021-05-16 19:39:58] [INFO ] Time to serialize properties into /tmp/LTL2470092098812662718.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13198606077416153302.gal, -t, CGAL, -LTL, /tmp/LTL2470092098812662718.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13198606077416153302.gal -t CGAL -LTL /tmp/LTL2470092098812662718.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((((Columns_0+Columns_1)+Columns_2)+Columns_3)>=2)")U((("((((Rows_0+Rows_1)+Rows_2)+Rows_3)<=(((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7))")||(G("((((Columns_0+Columns_1)+Columns_2)+Columns_3)>=2)")))||(X(G("(((((Rows_0+Rows_1)+Rows_2)+Rows_3)<=(((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7))&&((((Cells_0+Cells_1)+Cells_2)+Cells_3)>=2))"))))))
Formula 0 simplified : !("((((Columns_0+Columns_1)+Columns_2)+Columns_3)>=2)" U ("((((Rows_0+Rows_1)+Rows_2)+Rows_3)<=(((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7))" | G"((((Columns_0+Columns_1)+Columns_2)+Columns_3)>=2)" | XG"(((((Rows_0+Rows_1)+Rows_2)+Rows_3)<=(((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7))&&((((Cells_0+Cells_1)+Cells_2)+Cells_3)>=2))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.021621,16620,1,0,12,1047,21,9,399,994,30
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Sudoku-COL-AN02-08 finished in 1721 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-16 19:39:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:58] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN02-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 3 (ADD s4 s5 s6 s7 s8 s9 s10 s11)), p0:(LEQ 3 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 5 reset in 1 ms.
FORMULA Sudoku-COL-AN02-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-09 finished in 143 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 16 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:58] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:58] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-16 19:39:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:58] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 (ADD s16 s17 s18 s19)) (LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) (ADD s12 s13 s14 s15)))], 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 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-11 finished in 87 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 19:39:58] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:58] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) (ADD s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-16 19:39:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:59] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
[2021-05-16 19:39:59] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:39:59] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:39:59] [INFO ] Time to serialize gal into /tmp/LTL11878506867145959082.gal : 2 ms
[2021-05-16 19:39:59] [INFO ] Time to serialize properties into /tmp/LTL7435682675859816459.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11878506867145959082.gal, -t, CGAL, -LTL, /tmp/LTL7435682675859816459.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11878506867145959082.gal -t CGAL -LTL /tmp/LTL7435682675859816459.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)<=(((Cells_0+Cells_1)+Cells_2)+Cells_3))"))))
Formula 0 simplified : !XF"((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)<=(((Cells_0+Cells_1)+Cells_2)+Cells_3))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.012793,16400,1,0,8,873,20,3,356,451,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN02-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Sudoku-COL-AN02-12 finished in 1205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:59] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:59] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:59] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:39:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:39:59] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 19:39:59] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 85 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN02-14 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GT 1 (ADD s4 s5 s6 s7 s8 s9 s10 s11)), p0:(LEQ 3 (ADD s4 s5 s6 s7 s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 87 ms.
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), p1, (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 90 ms.
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 83 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 8 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-16 19:40:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-16 19:40:00] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 19:40:00] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Product exploration explored 100000 steps with 33333 reset in 136 ms.
[2021-05-16 19:40:00] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:40:00] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:40:00] [INFO ] Time to serialize gal into /tmp/LTL13125522605287613033.gal : 1 ms
[2021-05-16 19:40:00] [INFO ] Time to serialize properties into /tmp/LTL552402410626831602.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13125522605287613033.gal, -t, CGAL, -LTL, /tmp/LTL552402410626831602.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13125522605287613033.gal -t CGAL -LTL /tmp/LTL552402410626831602.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)>=3)")||(F("((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)>=1)"))))))
Formula 0 simplified : !XX("((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)>=3)" | F"((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.013172,16636,1,0,9,979,18,4,349,573,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN02-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Sudoku-COL-AN02-14 finished in 1297 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621194002984

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN02"
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 Sudoku-COL-AN02, 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 r254-tall-162106745900404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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