About the Execution of ITS-Tools for Eratosthenes-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 366.796 | 7666.00 | 14614.00 | 223.30 | FTTTFTFTTTTFTFFF | normal |
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-162048875700716.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-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875700716
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K 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.3K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.4K Mar 22 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 311K 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-200-00
FORMULA_NAME Eratosthenes-PT-200-01
FORMULA_NAME Eratosthenes-PT-200-02
FORMULA_NAME Eratosthenes-PT-200-03
FORMULA_NAME Eratosthenes-PT-200-04
FORMULA_NAME Eratosthenes-PT-200-05
FORMULA_NAME Eratosthenes-PT-200-06
FORMULA_NAME Eratosthenes-PT-200-07
FORMULA_NAME Eratosthenes-PT-200-08
FORMULA_NAME Eratosthenes-PT-200-09
FORMULA_NAME Eratosthenes-PT-200-10
FORMULA_NAME Eratosthenes-PT-200-11
FORMULA_NAME Eratosthenes-PT-200-12
FORMULA_NAME Eratosthenes-PT-200-13
FORMULA_NAME Eratosthenes-PT-200-14
FORMULA_NAME Eratosthenes-PT-200-15
=== Now, execution of the tool begins
BK_START 1620659330593
Running Version 0
[2021-05-10 15:08:52] [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:08:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:08:52] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-10 15:08:52] [INFO ] Transformed 199 places.
[2021-05-10 15:08:52] [INFO ] Transformed 699 transitions.
[2021-05-10 15:08:52] [INFO ] Parsed PT model containing 199 places and 699 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:08:52] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA Eratosthenes-PT-200-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 529/529 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 135 transition count 511
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 135 transition count 511
Drop transitions removed 376 transitions
Redundant transition composition rules discarded 376 transitions
Iterating global reduction 0 with 376 rules applied. Total rules applied 412 place count 135 transition count 135
Discarding 102 places :
Symmetric choice reduction at 0 with 102 rule applications. Total rules 514 place count 33 transition count 33
Iterating global reduction 0 with 102 rules applied. Total rules applied 616 place count 33 transition count 33
Applied a total of 616 rules in 26 ms. Remains 33 /153 variables (removed 120) and now considering 33/529 (removed 496) transitions.
// Phase 1: matrix 33 rows 33 cols
[2021-05-10 15:08:52] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-10 15:08:52] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 33 rows 33 cols
[2021-05-10 15:08:52] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:52] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 33 cols
[2021-05-10 15:08:52] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:52] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/153 places, 33/529 transitions.
[2021-05-10 15:08:52] [INFO ] Flatten gal took : 18 ms
[2021-05-10 15:08:52] [INFO ] Flatten gal took : 4 ms
[2021-05-10 15:08:52] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 100104 steps, including 645 resets, run finished after 130 ms. (steps per millisecond=770 ) properties (out of 23) seen :17
Running SMT prover for 6 properties.
// Phase 1: matrix 33 rows 33 cols
[2021-05-10 15:08:52] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:08:52] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2021-05-10 15:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:08:52] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-10 15:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:08:53] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2021-05-10 15:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:08:53] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-10 15:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:08:53] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-10 15:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:08:53] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2021-05-10 15:08:53] [INFO ] Initial state test concluded for 2 properties.
FORMULA Eratosthenes-PT-200-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2 transition count 2
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 1 transition count 1
Applied a total of 61 rules in 5 ms. Remains 1 /33 variables (removed 32) and now considering 1/33 (removed 32) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-10 15:08:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/33 places, 1/33 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-00 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 1 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 2 ms.
FORMULA Eratosthenes-PT-200-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-00 finished in 199 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2 transition count 2
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2 transition count 2
Applied a total of 62 rules in 1 ms. Remains 2 /33 variables (removed 31) and now considering 2/33 (removed 31) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/33 places, 2/33 transitions.
Stuttering acceptance computed with spot in 47 ms :[p0, false]
Running random walk in product with property : Eratosthenes-PT-200-02 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(LEQ 1 s1)], 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-02 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-200-02 finished in 82 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3 transition count 3
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 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 59 place count 2 transition count 2
Applied a total of 59 rules in 9 ms. Remains 2 /33 variables (removed 31) and now considering 2/33 (removed 31) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-10 15:08:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/33 places, 2/33 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-03 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:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Product exploration explored 100000 steps with 33333 reset in 125 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-200-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-200-03 finished in 449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 4 transition count 4
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 4 transition count 4
Applied a total of 58 rules in 2 ms. Remains 4 /33 variables (removed 29) and now considering 4/33 (removed 29) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:53] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/33 places, 4/33 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-200-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s2 s1), p0:(AND (LEQ 1 s3) (LEQ s2 s1))], 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 155 steps with 1 reset in 1 ms.
FORMULA Eratosthenes-PT-200-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-04 finished in 120 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2 transition count 2
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 1 transition count 1
Applied a total of 61 rules in 1 ms. Remains 1 /33 variables (removed 32) and now considering 1/33 (removed 32) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:53] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-10 15:08:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/33 places, 1/33 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], 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 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1 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 Eratosthenes-PT-200-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-200-05 finished in 388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p1||X(G(p2)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 6 transition count 6
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 6 transition count 6
Applied a total of 54 rules in 2 ms. Remains 6 /33 variables (removed 27) and now considering 6/33 (removed 27) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [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.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/33 places, 6/33 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-200-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GT 1 s3) (GT 1 s2)), p1:(LEQ s1 s5), p2:(GT 1 s4)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-06 finished in 134 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 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3 transition count 3
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 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 59 place count 2 transition count 2
Applied a total of 59 rules in 1 ms. Remains 2 /33 variables (removed 31) and now considering 2/33 (removed 31) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-10 15:08:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/33 places, 2/33 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-07 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 65 ms.
Product exploration explored 100000 steps with 33333 reset in 175 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-200-07 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-200-07 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 5 transition count 5
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 5 transition count 5
Applied a total of 56 rules in 1 ms. Remains 5 /33 variables (removed 28) and now considering 5/33 (removed 28) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:54] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/33 places, 5/33 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LEQ 1 s4) (LEQ 1 s1)), p0:(LEQ s2 s3)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 (NOT p1))), (F (G p0)), p1, p0]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 5 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-10 15:08:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:56] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 5/5 transitions.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 217 ms.
[2021-05-10 15:08:56] [INFO ] Flatten gal took : 1 ms
[2021-05-10 15:08:56] [INFO ] Flatten gal took : 1 ms
[2021-05-10 15:08:56] [INFO ] Time to serialize gal into /tmp/LTL7070318973653923773.gal : 1 ms
[2021-05-10 15:08:56] [INFO ] Time to serialize properties into /tmp/LTL5381394898286304138.ltl : 2 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/LTL7070318973653923773.gal, -t, CGAL, -LTL, /tmp/LTL5381394898286304138.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/LTL7070318973653923773.gal -t CGAL -LTL /tmp/LTL5381394898286304138.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(p10<=p136)"))U("((p123>=1)||(p84>=1))"))))
Formula 0 simplified : !X(F"(p10<=p136)" U "((p123>=1)||(p84>=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
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.032842,16468,1,0,8,622,21,3,231,615,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-200-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Eratosthenes-PT-200-12 finished in 1910 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3 transition count 3
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3 transition count 3
Applied a total of 60 rules in 1 ms. Remains 3 /33 variables (removed 30) and now considering 3/33 (removed 30) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:56] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:56] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:56] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/33 places, 3/33 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-200-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 1 s2), p0:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-13 finished in 115 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 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3 transition count 3
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 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 59 place count 2 transition count 2
Applied a total of 59 rules in 2 ms. Remains 2 /33 variables (removed 31) and now considering 2/33 (removed 31) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:56] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-10 15:08:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:56] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/33 places, 2/33 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 s1)], 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 2 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-200-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-14 finished in 97 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620659338259
--------------------
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-200"
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-200, 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-162048875700716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-200.tgz
mv Eratosthenes-PT-200 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 '
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 ;