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-162106746300684.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-PT-BN01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746300684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 14K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 4.2K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.3K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 2.2K 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-PT-BN01-00
FORMULA_NAME Sudoku-PT-BN01-01
FORMULA_NAME Sudoku-PT-BN01-02
FORMULA_NAME Sudoku-PT-BN01-03
FORMULA_NAME Sudoku-PT-BN01-04
FORMULA_NAME Sudoku-PT-BN01-05
FORMULA_NAME Sudoku-PT-BN01-06
FORMULA_NAME Sudoku-PT-BN01-07
FORMULA_NAME Sudoku-PT-BN01-08
FORMULA_NAME Sudoku-PT-BN01-09
FORMULA_NAME Sudoku-PT-BN01-10
FORMULA_NAME Sudoku-PT-BN01-11
FORMULA_NAME Sudoku-PT-BN01-12
FORMULA_NAME Sudoku-PT-BN01-13
FORMULA_NAME Sudoku-PT-BN01-14
FORMULA_NAME Sudoku-PT-BN01-15

=== Now, execution of the tool begins

BK_START 1621262015169

Running Version 0
[2021-05-17 14:33:36] [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-17 14:33:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:33:36] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 14:33:36] [INFO ] Transformed 5 places.
[2021-05-17 14:33:36] [INFO ] Transformed 1 transitions.
[2021-05-17 14:33:36] [INFO ] Found NUPN structural information;
[2021-05-17 14:33:36] [INFO ] Completing missing partition info from NUPN : creating a component with [Columns_0_0]
[2021-05-17 14:33:36] [INFO ] Parsed PT model containing 5 places and 1 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:33:36] [INFO ] Initial state test concluded for 2 properties.
FORMULA Sudoku-PT-BN01-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 1/1 transitions.
Applied a total of 0 rules in 10 ms. Remains 5 /5 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 5 cols
[2021-05-17 14:33:36] [INFO ] Computed 4 place invariants in 18 ms
[2021-05-17 14:33:36] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 1 rows 5 cols
[2021-05-17 14:33:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:33:36] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 5 cols
[2021-05-17 14:33:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:33:37] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 1/1 transitions.
[2021-05-17 14:33:37] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 14:33:37] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-PT-BN01-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:33:37] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:33:37] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 239 ms. (steps per millisecond=418 ) properties (out of 14) seen :9
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 5 cols
[2021-05-17 14:33:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 14:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:33:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned unsat
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-17 14:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-17 14:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:33:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 14:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:33:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 14:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-17 14:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:33:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 14:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:33:37] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:33:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
[2021-05-17 14:33:37] [INFO ] Initial state test concluded for 2 properties.
FORMULA Sudoku-PT-BN01-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Applied a total of 0 rules in 4 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:37] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-17 14:33:37] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:37] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-17 14:33:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:37] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN01-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-BN01-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN01-01 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 1/1 transitions.
Graph (complete) has 4 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Applied a total of 1 rules in 2 ms. Remains 1 /5 variables (removed 4) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:33:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:33:37] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:33:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:33:37] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-17 14:33:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 14:33:37] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:33:37] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN01-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN01-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN01-04 finished in 95 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3 transition count 1
Applied a total of 2 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2021-05-17 14:33:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:33:37] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 1 rows 3 cols
[2021-05-17 14:33:37] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:33:37] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 3 cols
[2021-05-17 14:33:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:33:37] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN01-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s0 0) (EQ s1 1)), p1:(OR (EQ s2 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 1
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)))), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 out of 3 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2021-05-17 14:33:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 3 cols
[2021-05-17 14:33:39] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:33:39] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/3 places, 1/1 transitions.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
[2021-05-17 14:33:39] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:33:39] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:33:39] [INFO ] Time to serialize gal into /tmp/LTL15791170869603044138.gal : 0 ms
[2021-05-17 14:33:39] [INFO ] Time to serialize properties into /tmp/LTL16593432556551224137.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/LTL15791170869603044138.gal, -t, CGAL, -LTL, /tmp/LTL16593432556551224137.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/LTL15791170869603044138.gal -t CGAL -LTL /tmp/LTL16593432556551224137.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((Board_0_0_0==0)&&(Regions_0_0==1))"))U(X("((Cells_0_0==0)||(Board_0_0_0==1))"))))
Formula 0 simplified : !(G"((Board_0_0_0==0)&&(Regions_0_0==1))" U X"((Cells_0_0==0)||(Board_0_0_0==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 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.017028,17120,1,0,6,21,23,3,59,11,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-PT-BN01-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Sudoku-PT-BN01-06 finished in 1532 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 1/1 transitions.
Graph (complete) has 4 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 1 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-17 14:33:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN01-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 1), p1:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN01-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN01-07 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0&&X(F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 1
Applied a total of 3 rules in 0 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN01-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1 0) (EQ s0 1))], 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN01-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN01-11 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 1
Applied a total of 3 rules in 1 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 2 cols
[2021-05-17 14:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:33:39] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN01-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s0 1))], 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 54 ms.
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
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 (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-PT-BN01-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-PT-BN01-12 finished in 231 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621262021438

--------------------
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-PT-BN01"
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-PT-BN01, 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-162106746300684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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