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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 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.1K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 18:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 18:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 126K May 5 16:51 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 Eratosthenes-PT-100-00
FORMULA_NAME Eratosthenes-PT-100-01
FORMULA_NAME Eratosthenes-PT-100-02
FORMULA_NAME Eratosthenes-PT-100-03
FORMULA_NAME Eratosthenes-PT-100-04
FORMULA_NAME Eratosthenes-PT-100-05
FORMULA_NAME Eratosthenes-PT-100-06
FORMULA_NAME Eratosthenes-PT-100-07
FORMULA_NAME Eratosthenes-PT-100-08
FORMULA_NAME Eratosthenes-PT-100-09
FORMULA_NAME Eratosthenes-PT-100-10
FORMULA_NAME Eratosthenes-PT-100-11
FORMULA_NAME Eratosthenes-PT-100-12
FORMULA_NAME Eratosthenes-PT-100-13
FORMULA_NAME Eratosthenes-PT-100-14
FORMULA_NAME Eratosthenes-PT-100-15

=== Now, execution of the tool begins

BK_START 1620659275290

Running Version 0
[2021-05-10 15:07:56] [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-10 15:07:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:07:57] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-10 15:07:57] [INFO ] Transformed 99 places.
[2021-05-10 15:07:57] [INFO ] Transformed 283 transitions.
[2021-05-10 15:07:57] [INFO ] Parsed PT model containing 99 places and 283 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:07:57] [INFO ] Initial state test concluded for 4 properties.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA Eratosthenes-PT-100-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 63 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 63 transition count 200
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 159 place count 63 transition count 63
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 198 place count 24 transition count 24
Iterating global reduction 0 with 39 rules applied. Total rules applied 237 place count 24 transition count 24
Applied a total of 237 rules in 19 ms. Remains 24 /74 variables (removed 50) and now considering 24/211 (removed 187) transitions.
// Phase 1: matrix 24 rows 24 cols
[2021-05-10 15:07:57] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-10 15:07:57] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-10 15:07:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:57] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 24 rows 24 cols
[2021-05-10 15:07:57] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-10 15:07:57] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/74 places, 24/211 transitions.
[2021-05-10 15:07:57] [INFO ] Flatten gal took : 17 ms
FORMULA Eratosthenes-PT-100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:07:57] [INFO ] Flatten gal took : 3 ms
[2021-05-10 15:07:57] [INFO ] Input system was already deterministic with 24 transitions.
Incomplete random walk after 100010 steps, including 1315 resets, run finished after 141 ms. (steps per millisecond=709 ) properties (out of 15) seen :9
Running SMT prover for 6 properties.
// Phase 1: matrix 24 rows 24 cols
[2021-05-10 15:07:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:07:57] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-10 15:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:07:57] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-10 15:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:07:57] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-10 15:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:07:57] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2021-05-10 15:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:07:57] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-10 15:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:07:57] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
[2021-05-10 15:07:57] [INFO ] Initial state test concluded for 4 properties.
FORMULA Eratosthenes-PT-100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 24/24 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3 transition count 3
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 2 transition count 2
Applied a total of 41 rules in 5 ms. Remains 2 /24 variables (removed 22) and now considering 2/24 (removed 22) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:57] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:57] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-10 15:07:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:57] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/24 places, 2/24 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-02 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 s1 s0)], 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 1 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-02 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((X(p1)||p0)&&(p2||X(!p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 6 transition count 6
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 6 transition count 6
Applied a total of 36 rules in 1 ms. Remains 6 /24 variables (removed 18) and now considering 6/24 (removed 18) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:07:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:58] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:07:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:58] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:07:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:58] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/24 places, 6/24 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2)))]
Running random walk in product with property : Eratosthenes-PT-100-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (LEQ s2 s3) (GT s4 s1)), p2:(GT s4 s1), p1:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23597 reset in 187 ms.
Product exploration explored 100000 steps with 23498 reset in 187 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
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)), (F (G (NOT p2))), (F (G (NOT p1))), p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 23431 reset in 89 ms.
Product exploration explored 100000 steps with 23498 reset in 191 ms.
[2021-05-10 15:07:59] [INFO ] Flatten gal took : 1 ms
[2021-05-10 15:07:59] [INFO ] Flatten gal took : 1 ms
[2021-05-10 15:07:59] [INFO ] Time to serialize gal into /tmp/LTL2629343297487460104.gal : 1 ms
[2021-05-10 15:07:59] [INFO ] Time to serialize properties into /tmp/LTL2340142474567935499.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/LTL2629343297487460104.gal, -t, CGAL, -LTL, /tmp/LTL2340142474567935499.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/LTL2629343297487460104.gal -t CGAL -LTL /tmp/LTL2340142474567935499.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("((p94<=p32)||(p56>p85))")||(X("(p76>=1)")))&&(("(p56>p85)")||(X("(p76<1)"))))))
Formula 0 simplified : !F(("((p94<=p32)||(p56>p85))" | X"(p76>=1)") & ("(p56>p85)" | X"(p76<1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
360 unique states visited
0 strongly connected components in search stack
433 transitions explored
76 items max in DFS search stack
9 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.10169,18528,1,0,1011,5654,35,936,182,8970,3393
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-100-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Eratosthenes-PT-100-05 finished in 1829 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(F(!p0)&&X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 3 transition count 3
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 3 transition count 3
Applied a total of 42 rules in 1 ms. Remains 3 /24 variables (removed 21) and now considering 3/24 (removed 21) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:07:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:59] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:07:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:59] [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 3 rows 3 cols
[2021-05-10 15:07:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:59] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/24 places, 3/24 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s2)], 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 37510 reset in 85 ms.
Product exploration explored 100000 steps with 37535 reset in 129 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-100-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-100-09 finished in 345 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 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 24/24 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 3 transition count 3
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 3 transition count 3
Applied a total of 42 rules in 0 ms. Remains 3 /24 variables (removed 21) and now considering 3/24 (removed 21) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:00] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:00] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:00] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/24 places, 3/24 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s2)], 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 37525 reset in 67 ms.
Product exploration explored 100000 steps with 37360 reset in 52 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-100-10 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-100-10 finished in 251 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 24/24 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3 transition count 3
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 2 transition count 2
Applied a total of 41 rules in 5 ms. Remains 2 /24 variables (removed 22) and now considering 2/24 (removed 22) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:00] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:00] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:00] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-10 15:08:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:00] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/24 places, 2/24 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-100-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-100-14 finished in 315 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620659281989

--------------------
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="Eratosthenes-PT-100"
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 Eratosthenes-PT-100, 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 r083-tall-162048875700708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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