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 |
430.703 | 11599.00 | 20150.00 | 243.80 | FTTFTFTFTTTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266500260.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Eratosthenes-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266500260
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 19:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Apr 12 19:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 19:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 311K May 18 16:42 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-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716580706989
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 19:58:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 19:58:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:58:29] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-05-24 19:58:29] [INFO ] Transformed 199 places.
[2024-05-24 19:58:29] [INFO ] Transformed 699 transitions.
[2024-05-24 19:58:29] [INFO ] Parsed PT model containing 199 places and 699 transitions and 2097 arcs in 546 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 95 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA Eratosthenes-PT-200-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 529/529 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 128 transition count 504
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 128 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 376 transitions
Redundant transition composition rules discarded 376 transitions
Iterating global reduction 0 with 376 rules applied. Total rules applied 426 place count 128 transition count 128
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 513 place count 41 transition count 41
Iterating global reduction 0 with 87 rules applied. Total rules applied 600 place count 41 transition count 41
Applied a total of 600 rules in 80 ms. Remains 41 /153 variables (removed 112) and now considering 41/529 (removed 488) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-24 19:58:30] [INFO ] Computed 0 invariants in 6 ms
[2024-05-24 19:58:30] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-24 19:58:30] [INFO ] Invariant cache hit.
[2024-05-24 19:58:30] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Starting structural reductions in LTL mode, iteration 1 : 41/153 places, 41/529 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 723 ms. Remains : 41/153 places, 41/529 transitions.
Support contains 40 out of 41 places after structural reductions.
[2024-05-24 19:58:31] [INFO ] Flatten gal took : 33 ms
[2024-05-24 19:58:31] [INFO ] Flatten gal took : 13 ms
[2024-05-24 19:58:31] [INFO ] Input system was already deterministic with 41 transitions.
RANDOM walk for 1107 steps (5 resets) in 88 ms. (12 steps per ms) remains 0/28 properties
FORMULA Eratosthenes-PT-200-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Graph (complete) has 0 edges and 41 vertex of which 2 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Applied a total of 1 rules in 15 ms. Remains 2 /41 variables (removed 39) and now considering 2/41 (removed 39) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 19:58:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:58:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 19:58:31] [INFO ] Invariant cache hit.
[2024-05-24 19:58:31] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 19:58:32] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/41 places, 2/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 2/41 places, 2/41 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-00 finished in 510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 4 transition count 4
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 4 transition count 4
Applied a total of 74 rules in 2 ms. Remains 4 /41 variables (removed 37) and now considering 4/41 (removed 37) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 19:58:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:58:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 19:58:32] [INFO ] Invariant cache hit.
[2024-05-24 19:58:32] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 4/41 places, 4/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 4/41 places, 4/41 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-01
Product exploration explored 100000 steps with 30007 reset in 377 ms.
Product exploration explored 100000 steps with 29933 reset in 274 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p1) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-01 finished in 986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(F(!p0))&&p1))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Graph (complete) has 0 edges and 41 vertex of which 3 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 38 output transitions
Drop transitions (Output transitions of discarded places.) removed 38 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /41 variables (removed 38) and now considering 3/41 (removed 38) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 19:58:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:58:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 19:58:33] [INFO ] Invariant cache hit.
[2024-05-24 19:58:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-24 19:58:33] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/41 places, 3/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 3/41 places, 3/41 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-02
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-02 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-02 finished in 135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 4 transition count 4
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 4 transition count 4
Applied a total of 74 rules in 4 ms. Remains 4 /41 variables (removed 37) and now considering 4/41 (removed 37) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 19:58:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:58:33] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 19:58:33] [INFO ] Invariant cache hit.
[2024-05-24 19:58:33] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 4/41 places, 4/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 4/41 places, 4/41 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-03
Stuttering criterion allowed to conclude after 155 steps with 1 reset in 7 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-03 finished in 153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U (p1||G(p0))))||X(G(p2))))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 5 transition count 5
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 5 transition count 5
Applied a total of 72 rules in 3 ms. Remains 5 /41 variables (removed 36) and now considering 5/41 (removed 36) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 19:58:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:58:33] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 19:58:33] [INFO ] Invariant cache hit.
[2024-05-24 19:58:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 5/41 places, 5/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 5/41 places, 5/41 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-05
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-05 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Graph (complete) has 0 edges and 41 vertex of which 2 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /41 variables (removed 39) and now considering 2/41 (removed 39) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 19:58:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:58:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 19:58:33] [INFO ] Invariant cache hit.
[2024-05-24 19:58:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 19:58:33] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/41 places, 2/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 2/41 places, 2/41 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-06
Product exploration explored 100000 steps with 40009 reset in 174 ms.
Product exploration explored 100000 steps with 39970 reset in 126 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
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 (and all enablings converge to false).
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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-06 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)&&G(!p0)) U (!p2||X((G(p3) U (!p2&&G(p3)))))))'
Support contains 8 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 9 transition count 9
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 9 transition count 9
Applied a total of 64 rules in 1 ms. Remains 9 /41 variables (removed 32) and now considering 9/41 (removed 32) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-24 19:58:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:58:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 19:58:34] [INFO ] Invariant cache hit.
[2024-05-24 19:58:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 9/41 places, 9/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 9/41 places, 9/41 transitions.
Stuttering acceptance computed with spot in 294 ms :[p2, (OR (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), true, (NOT p3), p0, (AND (NOT p3) p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-07 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||X(X(p1))) U !p1))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 4 transition count 4
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 4 transition count 4
Applied a total of 74 rules in 1 ms. Remains 4 /41 variables (removed 37) and now considering 4/41 (removed 37) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 19:58:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:58:34] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 19:58:34] [INFO ] Invariant cache hit.
[2024-05-24 19:58:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 4/41 places, 4/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 4/41 places, 4/41 transitions.
Stuttering acceptance computed with spot in 296 ms :[p1, false, p1, false]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-08
Product exploration explored 100000 steps with 1330 reset in 97 ms.
Product exploration explored 100000 steps with 1339 reset in 123 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND p1 p0), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-08 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(((X(X(X(p0))) U p1)||G(X(p2)))))))'
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 6 transition count 6
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 6 transition count 6
Applied a total of 70 rules in 1 ms. Remains 6 /41 variables (removed 35) and now considering 6/41 (removed 35) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-24 19:58:35] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:58:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 19:58:35] [INFO ] Invariant cache hit.
[2024-05-24 19:58:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 6/41 places, 6/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 6/41 places, 6/41 transitions.
Stuttering acceptance computed with spot in 458 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-09
Product exploration explored 100000 steps with 775 reset in 113 ms.
Product exploration explored 100000 steps with 757 reset in 347 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
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 (and all enablings converge to false).
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 : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p2))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-09 finished in 1085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&X(((p2 U !p1)&&G(!p0)))))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 5 transition count 5
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 5 transition count 5
Applied a total of 72 rules in 1 ms. Remains 5 /41 variables (removed 36) and now considering 5/41 (removed 36) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 19:58:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:58:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 19:58:36] [INFO ] Invariant cache hit.
[2024-05-24 19:58:36] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 5/41 places, 5/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 5/41 places, 5/41 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) p0), p0, true, true, true, true, (OR p0 p1)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-11 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 3 transition count 3
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 3 transition count 3
Applied a total of 76 rules in 1 ms. Remains 3 /41 variables (removed 38) and now considering 3/41 (removed 38) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 19:58:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:58:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 19:58:36] [INFO ] Invariant cache hit.
[2024-05-24 19:58:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 3/41 places, 3/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 3/41 places, 3/41 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-12
Product exploration explored 100000 steps with 31607 reset in 299 ms.
Product exploration explored 100000 steps with 31579 reset in 227 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
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 (and all enablings converge to false).
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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 25 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLFireability-12 finished in 838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X(G(p1)))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 4 transition count 4
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 4 transition count 4
Applied a total of 74 rules in 0 ms. Remains 4 /41 variables (removed 37) and now considering 4/41 (removed 37) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 19:58:37] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 19:58:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 19:58:37] [INFO ] Invariant cache hit.
[2024-05-24 19:58:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 4/41 places, 4/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 4/41 places, 4/41 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-13 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)))))'
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 7 transition count 7
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 7 transition count 7
Applied a total of 68 rules in 1 ms. Remains 7 /41 variables (removed 34) and now considering 7/41 (removed 34) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-24 19:58:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 19:58:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 19:58:37] [INFO ] Invariant cache hit.
[2024-05-24 19:58:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 7/41 places, 7/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 7/41 places, 7/41 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-200-LTLFireability-15
Entered a terminal (fully accepting) state of product in 159 steps with 2 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLFireability-15 finished in 266 ms.
All properties solved by simple procedures.
Total runtime 9058 ms.
BK_STOP 1716580718588
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Eratosthenes-PT-200"
export BK_EXAMINATION="LTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is Eratosthenes-PT-200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266500260"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;