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.r492-smll-171636266500268.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 ltsminxred
Input is Eratosthenes-PT-500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266500268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.3K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 12 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 19:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1006K 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-500-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717239801139

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-500
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:03:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:03:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:03:24] [INFO ] Load time of PNML (sax parser for PT used): 423 ms
[2024-06-01 11:03:24] [INFO ] Transformed 499 places.
[2024-06-01 11:03:24] [INFO ] Transformed 2191 transitions.
[2024-06-01 11:03:24] [INFO ] Parsed PT model containing 499 places and 2191 transitions and 6573 arcs in 658 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 509 transitions
Reduce redundant transitions removed 509 transitions.
FORMULA Eratosthenes-PT-500-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1682/1682 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 333 transition count 1611
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 333 transition count 1611
Drop transitions (Redundant composition of simpler transitions.) removed 1278 transitions
Redundant transition composition rules discarded 1278 transitions
Iterating global reduction 0 with 1278 rules applied. Total rules applied 1420 place count 333 transition count 333
Discarding 290 places :
Symmetric choice reduction at 0 with 290 rule applications. Total rules 1710 place count 43 transition count 43
Iterating global reduction 0 with 290 rules applied. Total rules applied 2000 place count 43 transition count 43
Applied a total of 2000 rules in 128 ms. Remains 43 /404 variables (removed 361) and now considering 43/1682 (removed 1639) transitions.
// Phase 1: matrix 43 rows 43 cols
[2024-06-01 11:03:24] [INFO ] Computed 0 invariants in 4 ms
[2024-06-01 11:03:25] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 11:03:25] [INFO ] Invariant cache hit.
[2024-06-01 11:03:25] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 398 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 : 43/404 places, 43/1682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 43/404 places, 43/1682 transitions.
Support contains 42 out of 43 places after structural reductions.
[2024-06-01 11:03:25] [INFO ] Flatten gal took : 36 ms
[2024-06-01 11:03:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:03:25] [INFO ] Input system was already deterministic with 43 transitions.
Support contains 41 out of 43 places (down from 42) after GAL structural reductions.
RANDOM walk for 6511 steps (15 resets) in 214 ms. (30 steps per ms) remains 0/26 properties
Computed a total of 43 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 43
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((p0||X((X(p1)&&G(p2))))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 6 transition count 6
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 6 transition count 6
Applied a total of 74 rules in 2 ms. Remains 6 /43 variables (removed 37) and now considering 6/43 (removed 37) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 11:03:26] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:26] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 11:03:26] [INFO ] Invariant cache hit.
[2024-06-01 11:03:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 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 : 6/43 places, 6/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 6/43 places, 6/43 transitions.
Stuttering acceptance computed with spot in 531 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-00
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-00 finished in 770 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(p0))'
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2 transition count 2
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2 transition count 2
Applied a total of 82 rules in 3 ms. Remains 2 /43 variables (removed 41) and now considering 2/43 (removed 41) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 11:03:27] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:27] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 11:03:27] [INFO ] Invariant cache hit.
[2024-06-01 11:03:27] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 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 : 2/43 places, 2/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 2/43 places, 2/43 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-02
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-02 finished in 202 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 X((X(G(p1))||G(p2)))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 6 transition count 6
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 6 transition count 6
Applied a total of 74 rules in 3 ms. Remains 6 /43 variables (removed 37) and now considering 6/43 (removed 37) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 11:03:27] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 11:03:27] [INFO ] Invariant cache hit.
[2024-06-01 11:03:27] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 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/43 places, 6/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 6/43 places, 6/43 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-04
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 9 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-04 finished in 486 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(p0)&&X(X(p1))&&(G(p0)||X(!p1))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 5 transition count 5
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 5 transition count 5
Applied a total of 76 rules in 4 ms. Remains 5 /43 variables (removed 38) and now considering 5/43 (removed 38) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 11:03:27] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:27] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 11:03:27] [INFO ] Invariant cache hit.
[2024-06-01 11:03:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 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/43 places, 5/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 5/43 places, 5/43 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, true, (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-05 finished in 422 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&&X((X(p1)&&F(p2))))))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 5 transition count 5
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 5 transition count 5
Applied a total of 76 rules in 2 ms. Remains 5 /43 variables (removed 38) and now considering 5/43 (removed 38) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 11:03:28] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 11:03:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 11:03:28] [INFO ] Invariant cache hit.
[2024-06-01 11:03:28] [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/43 places, 5/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 5/43 places, 5/43 transitions.
Stuttering acceptance computed with spot in 552 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-06
Product exploration explored 100000 steps with 14092 reset in 462 ms.
Product exploration explored 100000 steps with 14053 reset in 271 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
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 (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 p0) (NOT p2) (NOT p1)), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-500-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-06 finished in 1602 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&&X(G((!p0||G(!p1))))) U X(p1)))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 5 transition count 5
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 5 transition count 5
Applied a total of 76 rules in 1 ms. Remains 5 /43 variables (removed 38) and now considering 5/43 (removed 38) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 11:03:29] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 11:03:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 11:03:29] [INFO ] Invariant cache hit.
[2024-06-01 11:03:29] [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 0ms
Starting structural reductions in LTL mode, iteration 1 : 5/43 places, 5/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 5/43 places, 5/43 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), true, p1, (AND p1 p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-08 finished in 263 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((p1||X(X(F(p2)))))||p0)))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 7 transition count 7
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 7 transition count 7
Applied a total of 72 rules in 1 ms. Remains 7 /43 variables (removed 36) and now considering 7/43 (removed 36) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-06-01 11:03:30] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 11:03:30] [INFO ] Invariant cache hit.
[2024-06-01 11:03:30] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 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/43 places, 7/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 7/43 places, 7/43 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-09
Product exploration explored 100000 steps with 26553 reset in 101 ms.
Product exploration explored 100000 steps with 26563 reset in 139 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
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 p0) (NOT p1) p2), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-500-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-09 finished in 542 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 (G(p0)||(p0&&(G(F(!p1))||(!p1 U (p2||G(!p1)))))))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Graph (complete) has 0 edges and 43 vertex of which 4 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 12 ms. Remains 4 /43 variables (removed 39) and now considering 4/43 (removed 39) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 11:03:30] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 11:03:30] [INFO ] Invariant cache hit.
[2024-06-01 11:03:30] [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.
[2024-06-01 11:03:30] [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 : 4/43 places, 4/43 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 4/43 places, 4/43 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-10
Product exploration explored 100000 steps with 22211 reset in 153 ms.
Product exploration explored 100000 steps with 22232 reset in 270 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 p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-500-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-10 finished in 801 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(G(p1))||p0)))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 5 transition count 5
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 5 transition count 5
Applied a total of 76 rules in 2 ms. Remains 5 /43 variables (removed 38) and now considering 5/43 (removed 38) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 11:03:31] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 11:03:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 11:03:31] [INFO ] Invariant cache hit.
[2024-06-01 11:03:31] [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 1ms
Starting structural reductions in LTL mode, iteration 1 : 5/43 places, 5/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 5/43 places, 5/43 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-11
Stuttering criterion allowed to conclude after 414 steps with 5 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-11 finished in 218 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(G((p0||X(G((F(p1) U !p0))))))))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 3 transition count 3
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 3 transition count 3
Applied a total of 80 rules in 1 ms. Remains 3 /43 variables (removed 40) and now considering 3/43 (removed 40) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 11:03:31] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 11:03:31] [INFO ] Invariant cache hit.
[2024-06-01 11:03:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 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/43 places, 3/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 3/43 places, 3/43 transitions.
Stuttering acceptance computed with spot in 258 ms :[false, false, false, p0, (NOT p1), p0]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-12
Product exploration explored 100000 steps with 246 reset in 89 ms.
Product exploration explored 100000 steps with 246 reset in 163 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 : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[false, false, false, p0, (NOT p1), p0]
RANDOM walk for 1624 steps (2 resets) in 7 ms. (203 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 335 ms :[false, false, false, p0, (NOT p1), p0]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 11:03:33] [INFO ] Invariant cache hit.
[2024-06-01 11:03:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 11:03:33] [INFO ] Invariant cache hit.
[2024-06-01 11:03:33] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 3/3 places, 3/3 transitions.
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 : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[false, false, false, p0, (NOT p1), p0]
RANDOM walk for 2027 steps (2 resets) in 7 ms. (253 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 322 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 305 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 315 ms :[false, false, false, p0, (NOT p1), p0]
Product exploration explored 100000 steps with 246 reset in 64 ms.
Product exploration explored 100000 steps with 246 reset in 91 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 314 ms :[false, false, false, p0, (NOT p1), p0]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Graph (complete) has 0 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
[2024-06-01 11:03:36] [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/3 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8 ms. Remains : 2/3 places, 2/3 transitions.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 11:03:36] [INFO ] Invariant cache hit.
[2024-06-01 11:03:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 11:03:36] [INFO ] Invariant cache hit.
[2024-06-01 11:03:36] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Eratosthenes-PT-500-LTLFireability-12 finished in 4640 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((p0||G(F(p1)))))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 3 transition count 3
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 3 transition count 3
Applied a total of 80 rules in 1 ms. Remains 3 /43 variables (removed 40) and now considering 3/43 (removed 40) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 11:03:36] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 11:03:36] [INFO ] Invariant cache hit.
[2024-06-01 11:03:36] [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 : 3/43 places, 3/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 3/43 places, 3/43 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-13
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-13 finished in 276 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 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Graph (complete) has 0 edges and 43 vertex of which 4 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.0 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 1 ms. Remains 4 /43 variables (removed 39) and now considering 4/43 (removed 39) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 11:03:36] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:03:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 11:03:36] [INFO ] Invariant cache hit.
[2024-06-01 11:03:36] [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.
[2024-06-01 11:03:36] [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 : 4/43 places, 4/43 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 4/43 places, 4/43 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-14
Product exploration explored 100000 steps with 26923 reset in 97 ms.
Product exploration explored 100000 steps with 26977 reset in 110 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 : [(NOT p0), (X (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 3 factoid took 39 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-500-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-14 finished in 457 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(G((p0||X(G((F(p1) U !p0))))))))'
Found a Lengthening insensitive property : Eratosthenes-PT-500-LTLFireability-12
Stuttering acceptance computed with spot in 329 ms :[false, false, false, p0, (NOT p1), p0]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 43/43 places, 43/43 transitions.
Graph (complete) has 0 edges and 43 vertex of which 2 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Discarding 41 places :
Also discarding 41 output transitions
Drop transitions (Output transitions of discarded places.) removed 41 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /43 variables (removed 41) and now considering 2/43 (removed 41) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 11:03:37] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 11:03:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 11:03:37] [INFO ] Invariant cache hit.
[2024-06-01 11:03:37] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 97 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 LI_LTL mode, iteration 1 : 2/43 places, 2/43 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 101 ms. Remains : 2/43 places, 2/43 transitions.
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 52 ms.
Product exploration explored 100000 steps with 33333 reset in 87 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 : [(AND p0 p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[p0, p0, p0, p0, (NOT p1), p0]
RANDOM walk for 30 steps (8 resets) in 7 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 431 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[p0, p0, p0, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 338 ms :[p0, p0, p0, p0, (NOT p1), p0]
[2024-06-01 11:03:39] [INFO ] Invariant cache hit.
[2024-06-01 11:03:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 11:03:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 11:03:39] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-06-01 11:03:39] [INFO ] Invariant cache hit.
[2024-06-01 11:03:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 11:03:39] [INFO ] Invariant cache hit.
[2024-06-01 11:03:39] [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
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 2/2 places, 2/2 transitions.
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 : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[p0, p0, p0, p0, (NOT p1), p0]
RANDOM walk for 14 steps (3 resets) in 4 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 250 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[p0, p0, p0, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 325 ms :[p0, p0, p0, p0, (NOT p1), p0]
[2024-06-01 11:03:40] [INFO ] Invariant cache hit.
[2024-06-01 11:03:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 11:03:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 11:03:41] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 328 ms :[p0, p0, p0, p0, (NOT p1), p0]
Product exploration explored 100000 steps with 33333 reset in 55 ms.
Product exploration explored 100000 steps with 33333 reset in 60 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 318 ms :[p0, p0, p0, p0, (NOT p1), p0]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-06-01 11:03:41] [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
Finished structural reductions in SI_LTL mode , in 1 iterations and 9 ms. Remains : 2/2 places, 2/2 transitions.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-06-01 11:03:41] [INFO ] Invariant cache hit.
[2024-06-01 11:03:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 11:03:42] [INFO ] Invariant cache hit.
[2024-06-01 11:03:42] [INFO ] Implicit Places using invariants and state equation in 27 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 0ms
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Eratosthenes-PT-500-LTLFireability-12 finished in 5111 ms.
[2024-06-01 11:03:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:03:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 11:03:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 43 places, 43 transitions and 43 arcs took 2 ms.
Total runtime 18454 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Eratosthenes-PT-500-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717239923385

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Eratosthenes-PT-500-LTLFireability-12
ltl formula formula --ltl=/tmp/1455/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 43 places, 43 transitions and 43 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1455/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1455/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1455/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1455/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 45 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 53 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~405 levels ~10000 states ~78456 transitions
pnml2lts-mc( 0/ 4): ~405 levels ~20000 states ~142008 transitions
pnml2lts-mc( 0/ 4): ~405 levels ~40000 states ~279936 transitions
pnml2lts-mc( 0/ 4): ~405 levels ~80000 states ~577856 transitions
pnml2lts-mc( 0/ 4): ~405 levels ~160000 states ~1214336 transitions
pnml2lts-mc( 0/ 4): ~405 levels ~320000 states ~2571016 transitions
pnml2lts-mc( 1/ 4): ~405 levels ~640000 states ~5172084 transitions
pnml2lts-mc( 1/ 4): ~405 levels ~1280000 states ~10946812 transitions
pnml2lts-mc( 1/ 4): ~405 levels ~2560000 states ~23135716 transitions
pnml2lts-mc( 1/ 4): ~405 levels ~5120000 states ~48794300 transitions
pnml2lts-mc( 1/ 4): ~405 levels ~10240000 states ~102683376 transitions
pnml2lts-mc( 0/ 4): ~405 levels ~20480000 states ~212418416 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33508659
pnml2lts-mc( 0/ 4): unique states count: 33510210
pnml2lts-mc( 0/ 4): unique transitions count: 368715413
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 335161002
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33510213
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1618
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33510213 states 368715545 transitions, fanout: 11.003
pnml2lts-mc( 0/ 4): Total exploration time 100.200 sec (100.150 sec minimum, 100.162 sec on average)
pnml2lts-mc( 0/ 4): States per second: 334433, Transitions per second: 3679796
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.0MB, 8.0 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 43 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.0MB (~256.0MB paged-in)

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-500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Eratosthenes-PT-500, 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 r492-smll-171636266500268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-500.tgz
mv Eratosthenes-PT-500 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;