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.r180-tall-171640603800619.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 GPUForwardProgress-PT-40b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603800619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 199K 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 GPUForwardProgress-PT-40b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-40b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716515485219

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 01:51:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 01:51:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:51:26] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-24 01:51:26] [INFO ] Transformed 796 places.
[2024-05-24 01:51:26] [INFO ] Transformed 837 transitions.
[2024-05-24 01:51:26] [INFO ] Found NUPN structural information;
[2024-05-24 01:51:26] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 837/837 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 837
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 86 place count 710 transition count 752
Iterating global reduction 1 with 85 rules applied. Total rules applied 171 place count 710 transition count 752
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 212 place count 669 transition count 711
Iterating global reduction 1 with 41 rules applied. Total rules applied 253 place count 669 transition count 711
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 292 place count 669 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 293 place count 668 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 668 transition count 671
Applied a total of 294 rules in 185 ms. Remains 668 /796 variables (removed 128) and now considering 671/837 (removed 166) transitions.
// Phase 1: matrix 671 rows 668 cols
[2024-05-24 01:51:27] [INFO ] Computed 41 invariants in 25 ms
[2024-05-24 01:51:27] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-24 01:51:27] [INFO ] Invariant cache hit.
[2024-05-24 01:51:27] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-05-24 01:51:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/667 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/667 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (OVERLAPS) 671/1338 variables, 667/708 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1338 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 670 unsolved
SMT process timed out in 30307ms, After SMT, problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 30327ms
Starting structural reductions in LTL mode, iteration 1 : 668/796 places, 671/837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31399 ms. Remains : 668/796 places, 671/837 transitions.
Support contains 18 out of 668 places after structural reductions.
[2024-05-24 01:51:58] [INFO ] Flatten gal took : 80 ms
[2024-05-24 01:51:58] [INFO ] Flatten gal took : 38 ms
[2024-05-24 01:51:58] [INFO ] Input system was already deterministic with 671 transitions.
RANDOM walk for 40000 steps (117 resets) in 903 ms. (44 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 143 ms. (277 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
[2024-05-24 01:51:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 541/550 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 117/667 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/667 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 671/1338 variables, 667/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1338 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/1339 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1339 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1339 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1339/1339 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 869 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 668/668 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 541/550 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 117/667 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/667 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 671/1338 variables, 667/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1338 variables, 4/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1339 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1339 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1339 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1339/1339 variables, and 713 constraints, problems are : Problem set: 0 solved, 4 unsolved in 970 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 668/668 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1870ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 305 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=43 )
Parikh walk visited 4 properties in 16 ms.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1040 edges and 668 vertex of which 624 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.25 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||X(X(F(p1))))))'
Support contains 3 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 671/671 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 665 transition count 668
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 665 transition count 668
Applied a total of 6 rules in 77 ms. Remains 665 /668 variables (removed 3) and now considering 668/671 (removed 3) transitions.
// Phase 1: matrix 668 rows 665 cols
[2024-05-24 01:52:01] [INFO ] Computed 41 invariants in 10 ms
[2024-05-24 01:52:01] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-24 01:52:01] [INFO ] Invariant cache hit.
[2024-05-24 01:52:01] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 667 sub problems to find dead transitions.
[2024-05-24 01:52:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 668/1332 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1332 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 667 unsolved
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 0 solved, 667 unsolved
Search for dead transitions found 0 dead transitions in 30234ms
Starting structural reductions in LTL mode, iteration 1 : 665/668 places, 668/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30905 ms. Remains : 665/668 places, 668/671 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-01
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 8 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-01 finished in 31202 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(!p0)))))'
Support contains 1 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 671/671 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 665 transition count 668
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 665 transition count 668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 664 transition count 667
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 664 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 664 transition count 666
Applied a total of 9 rules in 121 ms. Remains 664 /668 variables (removed 4) and now considering 666/671 (removed 5) transitions.
// Phase 1: matrix 666 rows 664 cols
[2024-05-24 01:52:32] [INFO ] Computed 41 invariants in 3 ms
[2024-05-24 01:52:32] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-24 01:52:32] [INFO ] Invariant cache hit.
[2024-05-24 01:52:33] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2024-05-24 01:52:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1329 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
SMT process timed out in 30208ms, After SMT, problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 30214ms
Starting structural reductions in LTL mode, iteration 1 : 664/668 places, 666/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30943 ms. Remains : 664/668 places, 666/671 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0, p0]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 90623 steps with 269 reset in 208 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-03 finished in 31291 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(X(G(p0)))))'
Support contains 2 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 671/671 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 666 transition count 669
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 666 transition count 669
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 665 transition count 668
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 665 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 665 transition count 667
Applied a total of 7 rules in 48 ms. Remains 665 /668 variables (removed 3) and now considering 667/671 (removed 4) transitions.
// Phase 1: matrix 667 rows 665 cols
[2024-05-24 01:53:03] [INFO ] Computed 41 invariants in 6 ms
[2024-05-24 01:53:04] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-24 01:53:04] [INFO ] Invariant cache hit.
[2024-05-24 01:53:04] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2024-05-24 01:53:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (OVERLAPS) 667/1331 variables, 664/705 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1331 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 666 unsolved
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Starting structural reductions in LTL mode, iteration 1 : 665/668 places, 667/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30817 ms. Remains : 665/668 places, 667/671 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-04 finished in 30995 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)))'
Support contains 1 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 671/671 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 665 transition count 668
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 665 transition count 668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 664 transition count 667
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 664 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 664 transition count 666
Applied a total of 9 rules in 46 ms. Remains 664 /668 variables (removed 4) and now considering 666/671 (removed 5) transitions.
// Phase 1: matrix 666 rows 664 cols
[2024-05-24 01:53:34] [INFO ] Computed 41 invariants in 9 ms
[2024-05-24 01:53:35] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-24 01:53:35] [INFO ] Invariant cache hit.
[2024-05-24 01:53:35] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2024-05-24 01:53:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1329 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Starting structural reductions in LTL mode, iteration 1 : 664/668 places, 666/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30813 ms. Remains : 664/668 places, 666/671 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-06 finished in 30937 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)&&F(G(p1)))))'
Support contains 4 out of 668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 668/668 places, 671/671 transitions.
Graph (trivial) has 542 edges and 668 vertex of which 6 / 668 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1034 edges and 663 vertex of which 619 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 321 place count 618 transition count 342
Reduce places removed 319 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 321 rules applied. Total rules applied 642 place count 299 transition count 340
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 644 place count 297 transition count 340
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 644 place count 297 transition count 258
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 808 place count 215 transition count 258
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 846 place count 177 transition count 220
Iterating global reduction 3 with 38 rules applied. Total rules applied 884 place count 177 transition count 220
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1124 place count 57 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1125 place count 57 transition count 99
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1162 place count 20 transition count 26
Iterating global reduction 4 with 37 rules applied. Total rules applied 1199 place count 20 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1205 place count 17 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1206 place count 16 transition count 24
Applied a total of 1206 rules in 88 ms. Remains 16 /668 variables (removed 652) and now considering 24/671 (removed 647) transitions.
[2024-05-24 01:54:05] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 16 cols
[2024-05-24 01:54:05] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 01:54:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 01:54:05] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2024-05-24 01:54:05] [INFO ] Invariant cache hit.
[2024-05-24 01:54:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 01:54:05] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 01:54:05] [INFO ] Redundant transitions in 11 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-24 01:54:05] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2024-05-24 01:54:05] [INFO ] Invariant cache hit.
[2024-05-24 01:54:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 21/36 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 18 constraints, problems are : Problem set: 0 solved, 22 unsolved in 204 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 21/36 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 22 unsolved in 225 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 436ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/668 places, 24/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 595 ms. Remains : 16/668 places, 24/671 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-07 finished in 757 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 1 out of 668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 668/668 places, 671/671 transitions.
Graph (trivial) has 546 edges and 668 vertex of which 6 / 668 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1034 edges and 663 vertex of which 619 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 324 place count 618 transition count 339
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 324 rules applied. Total rules applied 648 place count 296 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 649 place count 295 transition count 337
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 649 place count 295 transition count 253
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 817 place count 211 transition count 253
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 856 place count 172 transition count 214
Iterating global reduction 3 with 39 rules applied. Total rules applied 895 place count 172 transition count 214
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 1141 place count 49 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1142 place count 49 transition count 90
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1181 place count 10 transition count 13
Iterating global reduction 4 with 39 rules applied. Total rules applied 1220 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1222 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1223 place count 8 transition count 11
Applied a total of 1223 rules in 49 ms. Remains 8 /668 variables (removed 660) and now considering 11/671 (removed 660) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 01:54:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:54:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 01:54:06] [INFO ] Invariant cache hit.
[2024-05-24 01:54:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:54:06] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 01:54:06] [INFO ] Redundant transitions in 9 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-24 01:54:06] [INFO ] Invariant cache hit.
[2024-05-24 01:54:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 54 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 57 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/668 places, 11/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 8/668 places, 11/671 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-09 finished in 304 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 4 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 671/671 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 665 transition count 668
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 665 transition count 668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 664 transition count 667
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 664 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 664 transition count 666
Applied a total of 9 rules in 91 ms. Remains 664 /668 variables (removed 4) and now considering 666/671 (removed 5) transitions.
// Phase 1: matrix 666 rows 664 cols
[2024-05-24 01:54:06] [INFO ] Computed 41 invariants in 7 ms
[2024-05-24 01:54:07] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-24 01:54:07] [INFO ] Invariant cache hit.
[2024-05-24 01:54:07] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2024-05-24 01:54:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 666/1329 variables, 663/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1329 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 665 unsolved
SMT process timed out in 30179ms, After SMT, problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 30190ms
Starting structural reductions in LTL mode, iteration 1 : 664/668 places, 666/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30886 ms. Remains : 664/668 places, 666/671 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-13
Stuttering criterion allowed to conclude after 329 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-13 finished in 30982 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)))'
Support contains 2 out of 668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 668/668 places, 671/671 transitions.
Graph (trivial) has 545 edges and 668 vertex of which 6 / 668 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1034 edges and 663 vertex of which 619 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 324 place count 618 transition count 339
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 324 rules applied. Total rules applied 648 place count 296 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 649 place count 295 transition count 337
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 649 place count 295 transition count 253
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 817 place count 211 transition count 253
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 856 place count 172 transition count 214
Iterating global reduction 3 with 39 rules applied. Total rules applied 895 place count 172 transition count 214
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 1139 place count 50 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1140 place count 50 transition count 91
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1179 place count 11 transition count 14
Iterating global reduction 4 with 39 rules applied. Total rules applied 1218 place count 11 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1220 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1221 place count 9 transition count 12
Applied a total of 1221 rules in 32 ms. Remains 9 /668 variables (removed 659) and now considering 12/671 (removed 659) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-24 01:54:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:54:37] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 01:54:37] [INFO ] Invariant cache hit.
[2024-05-24 01:54:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:54:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-24 01:54:37] [INFO ] Redundant transitions in 10 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-24 01:54:37] [INFO ] Invariant cache hit.
[2024-05-24 01:54:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 8 unsolved in 59 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 59 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/668 places, 12/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 9/668 places, 12/671 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLCardinality-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLCardinality-14 finished in 285 ms.
All properties solved by simple procedures.
Total runtime 191647 ms.

BK_STOP 1716515678077

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="GPUForwardProgress-PT-40b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-40b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603800619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-40b.tgz
mv GPUForwardProgress-PT-40b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;