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.r553-tall-171734901000164.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 CO4-PT-21, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901000164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 344K Jun 2 16:33 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 CO4-PT-21-LTLFireability-00
FORMULA_NAME CO4-PT-21-LTLFireability-01
FORMULA_NAME CO4-PT-21-LTLFireability-02
FORMULA_NAME CO4-PT-21-LTLFireability-03
FORMULA_NAME CO4-PT-21-LTLFireability-04
FORMULA_NAME CO4-PT-21-LTLFireability-05
FORMULA_NAME CO4-PT-21-LTLFireability-06
FORMULA_NAME CO4-PT-21-LTLFireability-07
FORMULA_NAME CO4-PT-21-LTLFireability-08
FORMULA_NAME CO4-PT-21-LTLFireability-09
FORMULA_NAME CO4-PT-21-LTLFireability-10
FORMULA_NAME CO4-PT-21-LTLFireability-11
FORMULA_NAME CO4-PT-21-LTLFireability-12
FORMULA_NAME CO4-PT-21-LTLFireability-13
FORMULA_NAME CO4-PT-21-LTLFireability-14
FORMULA_NAME CO4-PT-21-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717353130200

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:32:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:32:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:32:11] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-02 18:32:11] [INFO ] Transformed 1400 places.
[2024-06-02 18:32:11] [INFO ] Transformed 1583 transitions.
[2024-06-02 18:32:11] [INFO ] Found NUPN structural information;
[2024-06-02 18:32:11] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 307 places in 14 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1070 transition count 1231
Discarding 165 places :
Symmetric choice reduction at 1 with 165 rule applications. Total rules 193 place count 905 transition count 1066
Iterating global reduction 1 with 165 rules applied. Total rules applied 358 place count 905 transition count 1066
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 501 place count 762 transition count 922
Iterating global reduction 1 with 143 rules applied. Total rules applied 644 place count 762 transition count 922
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 646 place count 762 transition count 920
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 714 place count 694 transition count 852
Iterating global reduction 2 with 68 rules applied. Total rules applied 782 place count 694 transition count 852
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 831 place count 645 transition count 803
Iterating global reduction 2 with 49 rules applied. Total rules applied 880 place count 645 transition count 803
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 882 place count 645 transition count 801
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 905 place count 622 transition count 778
Iterating global reduction 3 with 23 rules applied. Total rules applied 928 place count 622 transition count 778
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 930 place count 622 transition count 776
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 937 place count 615 transition count 769
Iterating global reduction 4 with 7 rules applied. Total rules applied 944 place count 615 transition count 769
Applied a total of 944 rules in 391 ms. Remains 615 /1093 variables (removed 478) and now considering 769/1236 (removed 467) transitions.
// Phase 1: matrix 769 rows 615 cols
[2024-06-02 18:32:12] [INFO ] Computed 5 invariants in 23 ms
[2024-06-02 18:32:12] [INFO ] Implicit Places using invariants in 316 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 614/1093 places, 769/1236 transitions.
Applied a total of 0 rules in 13 ms. Remains 614 /614 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 765 ms. Remains : 614/1093 places, 769/1236 transitions.
Support contains 24 out of 614 places after structural reductions.
[2024-06-02 18:32:13] [INFO ] Flatten gal took : 68 ms
[2024-06-02 18:32:13] [INFO ] Flatten gal took : 34 ms
[2024-06-02 18:32:13] [INFO ] Input system was already deterministic with 769 transitions.
RANDOM walk for 40000 steps (62 resets) in 1564 ms. (25 steps per ms) remains 17/21 properties
BEST_FIRST walk for 4002 steps (15 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (15 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (14 resets) in 43 ms. (90 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (18 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (15 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (16 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
// Phase 1: matrix 769 rows 614 cols
[2024-06-02 18:32:13] [INFO ] Computed 4 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 72/90 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 305/395 variables, 96/114 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 509/904 variables, 227/341 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 18/922 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/922 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 319/1241 variables, 183/530 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1241 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 99/1340 variables, 59/589 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1340 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 33/1373 variables, 22/611 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1373 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 9/1382 variables, 6/617 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/1383 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1383 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 0/1383 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1383/1383 variables, and 618 constraints, problems are : Problem set: 0 solved, 17 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 72/90 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 305/395 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 15/131 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 509/904 variables, 227/358 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/904 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 18/922 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/922 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 319/1241 variables, 183/547 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1241 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 99/1340 variables, 59/606 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1340 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 33/1373 variables, 22/628 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1373 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 9/1382 variables, 6/634 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1382 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 1/1383 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1383 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/1383 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1383/1383 variables, and 635 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3573 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 7844ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Finished Parikh walk after 1654 steps, including 15 resets, run visited all 1 properties in 4 ms. (steps per millisecond=413 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 2538 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 963 edges and 614 vertex of which 608 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.14 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||G((F((p1&&X(p2))) U p3)))))'
Support contains 5 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 602 transition count 757
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 602 transition count 757
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 595 transition count 750
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 595 transition count 750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 595 transition count 749
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 591 transition count 745
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 591 transition count 745
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 589 transition count 743
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 589 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 589 transition count 742
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 588 transition count 741
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 588 transition count 741
Applied a total of 54 rules in 55 ms. Remains 588 /614 variables (removed 26) and now considering 741/769 (removed 28) transitions.
// Phase 1: matrix 741 rows 588 cols
[2024-06-02 18:32:24] [INFO ] Computed 4 invariants in 10 ms
[2024-06-02 18:32:24] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 18:32:24] [INFO ] Invariant cache hit.
[2024-06-02 18:32:25] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 740 sub problems to find dead transitions.
[2024-06-02 18:32:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 3 (OVERLAPS) 741/1329 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-02 18:32:55] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 31 ms to minimize.
SMT process timed out in 30301ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 30315ms
Starting structural reductions in LTL mode, iteration 1 : 588/614 places, 741/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30805 ms. Remains : 588/614 places, 741/769 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : CO4-PT-21-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 229 ms.
Stuttering criterion allowed to conclude after 72 steps with 1 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-00 finished in 31443 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||G(p1)))))'
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Graph (trivial) has 664 edges and 614 vertex of which 3 / 614 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 961 edges and 612 vertex of which 606 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 605 transition count 488
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 272 rules applied. Total rules applied 545 place count 335 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 546 place count 334 transition count 486
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 546 place count 334 transition count 422
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 674 place count 270 transition count 422
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 677 place count 267 transition count 419
Iterating global reduction 3 with 3 rules applied. Total rules applied 680 place count 267 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 680 place count 267 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 684 place count 265 transition count 417
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 686 place count 263 transition count 415
Iterating global reduction 3 with 2 rules applied. Total rules applied 688 place count 263 transition count 415
Performed 105 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 898 place count 158 transition count 282
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 905 place count 158 transition count 275
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 914 place count 149 transition count 266
Iterating global reduction 4 with 9 rules applied. Total rules applied 923 place count 149 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 924 place count 149 transition count 265
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 930 place count 146 transition count 262
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1020 place count 101 transition count 265
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1049 place count 101 transition count 236
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1087 place count 63 transition count 160
Iterating global reduction 6 with 38 rules applied. Total rules applied 1125 place count 63 transition count 160
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1150 place count 63 transition count 135
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1160 place count 53 transition count 106
Iterating global reduction 7 with 10 rules applied. Total rules applied 1170 place count 53 transition count 106
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1177 place count 53 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1179 place count 52 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1193 place count 52 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1195 place count 50 transition count 93
Applied a total of 1195 rules in 114 ms. Remains 50 /614 variables (removed 564) and now considering 93/769 (removed 676) transitions.
[2024-06-02 18:32:56] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
// Phase 1: matrix 84 rows 50 cols
[2024-06-02 18:32:56] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:32:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:32:56] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
[2024-06-02 18:32:56] [INFO ] Invariant cache hit.
[2024-06-02 18:32:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:32:56] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-06-02 18:32:56] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-02 18:32:56] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
[2024-06-02 18:32:56] [INFO ] Invariant cache hit.
[2024-06-02 18:32:56] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 83/133 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 1/134 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 56 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 83/133 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 80/135 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 2448ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/614 places, 93/769 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2693 ms. Remains : 50/614 places, 93/769 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-21-LTLFireability-01
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-01 finished in 2789 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(p1))))'
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Graph (trivial) has 661 edges and 614 vertex of which 3 / 614 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 961 edges and 612 vertex of which 606 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 605 transition count 490
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 270 rules applied. Total rules applied 541 place count 337 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 336 transition count 488
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 542 place count 336 transition count 424
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 670 place count 272 transition count 424
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 673 place count 269 transition count 421
Iterating global reduction 3 with 3 rules applied. Total rules applied 676 place count 269 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 676 place count 269 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 680 place count 267 transition count 419
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 682 place count 265 transition count 417
Iterating global reduction 3 with 2 rules applied. Total rules applied 684 place count 265 transition count 417
Performed 104 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 892 place count 161 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 899 place count 161 transition count 278
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 908 place count 152 transition count 269
Iterating global reduction 4 with 9 rules applied. Total rules applied 917 place count 152 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 918 place count 152 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 924 place count 149 transition count 265
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1014 place count 104 transition count 268
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 1042 place count 104 transition count 240
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1080 place count 66 transition count 164
Iterating global reduction 6 with 38 rules applied. Total rules applied 1118 place count 66 transition count 164
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1143 place count 66 transition count 139
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1152 place count 57 transition count 113
Iterating global reduction 7 with 9 rules applied. Total rules applied 1161 place count 57 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1167 place count 57 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1169 place count 56 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1183 place count 56 transition count 103
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1184 place count 56 transition count 103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1186 place count 54 transition count 101
Applied a total of 1186 rules in 78 ms. Remains 54 /614 variables (removed 560) and now considering 101/769 (removed 668) transitions.
[2024-06-02 18:32:59] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
// Phase 1: matrix 91 rows 54 cols
[2024-06-02 18:32:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:32:59] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:32:59] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
[2024-06-02 18:32:59] [INFO ] Invariant cache hit.
[2024-06-02 18:32:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:32:59] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 18:32:59] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-02 18:32:59] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
[2024-06-02 18:32:59] [INFO ] Invariant cache hit.
[2024-06-02 18:32:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 90/144 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 1/145 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 60 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 90/144 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 88/147 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/145 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 148 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 54/54 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 3421ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/614 places, 101/769 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3754 ms. Remains : 54/614 places, 101/769 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-21-LTLFireability-02
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-02 finished in 3906 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 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Graph (trivial) has 665 edges and 614 vertex of which 3 / 614 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 961 edges and 612 vertex of which 606 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 605 transition count 488
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 272 rules applied. Total rules applied 545 place count 335 transition count 486
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 547 place count 334 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 548 place count 333 transition count 485
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 548 place count 333 transition count 421
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 676 place count 269 transition count 421
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 679 place count 266 transition count 418
Iterating global reduction 4 with 3 rules applied. Total rules applied 682 place count 266 transition count 418
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 682 place count 266 transition count 416
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 686 place count 264 transition count 416
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 688 place count 262 transition count 414
Iterating global reduction 4 with 2 rules applied. Total rules applied 690 place count 262 transition count 414
Performed 105 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 900 place count 157 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 907 place count 157 transition count 274
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 916 place count 148 transition count 265
Iterating global reduction 5 with 9 rules applied. Total rules applied 925 place count 148 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 926 place count 148 transition count 264
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 932 place count 145 transition count 261
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 1022 place count 100 transition count 264
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 1052 place count 100 transition count 234
Discarding 40 places :
Symmetric choice reduction at 7 with 40 rule applications. Total rules 1092 place count 60 transition count 154
Iterating global reduction 7 with 40 rules applied. Total rules applied 1132 place count 60 transition count 154
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 1159 place count 60 transition count 127
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1168 place count 51 transition count 101
Iterating global reduction 8 with 9 rules applied. Total rules applied 1177 place count 51 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1184 place count 51 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1186 place count 50 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 1198 place count 50 transition count 90
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1199 place count 50 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1201 place count 48 transition count 88
Applied a total of 1201 rules in 60 ms. Remains 48 /614 variables (removed 566) and now considering 88/769 (removed 681) transitions.
[2024-06-02 18:33:02] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
// Phase 1: matrix 79 rows 48 cols
[2024-06-02 18:33:02] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:33:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:33:02] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-06-02 18:33:02] [INFO ] Invariant cache hit.
[2024-06-02 18:33:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:33:03] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-02 18:33:03] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2024-06-02 18:33:03] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-06-02 18:33:03] [INFO ] Invariant cache hit.
[2024-06-02 18:33:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 78/126 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/127 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 54 constraints, problems are : Problem set: 0 solved, 75 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 78/126 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 75/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 129 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 2277ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2278ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/614 places, 88/769 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2448 ms. Remains : 48/614 places, 88/769 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-03 finished in 2513 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((G(p0)&&((p0 U (p1&&X(p0)))||G(p2)))))'
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 600 transition count 755
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 600 transition count 755
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 592 transition count 747
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 592 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 592 transition count 746
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 588 transition count 742
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 588 transition count 742
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 586 transition count 740
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 586 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 586 transition count 739
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 585 transition count 738
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 585 transition count 738
Applied a total of 60 rules in 50 ms. Remains 585 /614 variables (removed 29) and now considering 738/769 (removed 31) transitions.
// Phase 1: matrix 738 rows 585 cols
[2024-06-02 18:33:05] [INFO ] Computed 4 invariants in 12 ms
[2024-06-02 18:33:05] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 18:33:05] [INFO ] Invariant cache hit.
[2024-06-02 18:33:05] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 737 sub problems to find dead transitions.
[2024-06-02 18:33:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
[2024-06-02 18:33:36] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 4 ms to minimize.
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 737 unsolved
Search for dead transitions found 0 dead transitions in 30303ms
Starting structural reductions in LTL mode, iteration 1 : 585/614 places, 738/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30803 ms. Remains : 585/614 places, 738/769 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-04 finished in 31028 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 U (p1||G(p2)))||F(p0))))'
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 601 transition count 756
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 601 transition count 756
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 593 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 593 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 593 transition count 747
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 590 transition count 744
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 590 transition count 744
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 588 transition count 742
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 588 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 588 transition count 741
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 587 transition count 740
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 587 transition count 740
Applied a total of 56 rules in 48 ms. Remains 587 /614 variables (removed 27) and now considering 740/769 (removed 29) transitions.
// Phase 1: matrix 740 rows 587 cols
[2024-06-02 18:33:36] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 18:33:36] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 18:33:36] [INFO ] Invariant cache hit.
[2024-06-02 18:33:36] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 739 sub problems to find dead transitions.
[2024-06-02 18:33:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (OVERLAPS) 740/1327 variables, 587/591 constraints. Problems are: Problem set: 0 solved, 739 unsolved
[2024-06-02 18:34:06] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 5 ms to minimize.
[2024-06-02 18:34:06] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 593 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 739 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/587 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 4 (OVERLAPS) 740/1327 variables, 587/593 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1327 variables, 739/1332 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1327/1327 variables, and 1332 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 2/2 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 739 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 587/614 places, 740/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 587/614 places, 740/769 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CO4-PT-21-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 931 edges and 587 vertex of which 582 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-21-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-21-LTLFireability-07 finished in 61380 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)&&F(G(p1))))))'
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 599 transition count 754
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 599 transition count 754
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 590 transition count 745
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 590 transition count 745
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 590 transition count 744
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 586 transition count 740
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 586 transition count 740
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 584 transition count 738
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 584 transition count 738
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 584 transition count 737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 583 transition count 736
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 583 transition count 736
Applied a total of 64 rules in 51 ms. Remains 583 /614 variables (removed 31) and now considering 736/769 (removed 33) transitions.
// Phase 1: matrix 736 rows 583 cols
[2024-06-02 18:34:37] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 18:34:37] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 18:34:37] [INFO ] Invariant cache hit.
[2024-06-02 18:34:38] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-06-02 18:34:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-02 18:35:07] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-02 18:35:08] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 589 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (OVERLAPS) 736/1319 variables, 583/589 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1319 variables, 735/1324 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1324 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 2/2 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LTL mode, iteration 1 : 583/614 places, 736/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60667 ms. Remains : 583/614 places, 736/769 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-21-LTLFireability-11
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-11 finished in 60896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 600 transition count 755
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 600 transition count 755
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 592 transition count 747
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 592 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 592 transition count 746
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 589 transition count 743
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 589 transition count 743
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 588 transition count 742
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 588 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 588 transition count 741
Applied a total of 54 rules in 42 ms. Remains 588 /614 variables (removed 26) and now considering 741/769 (removed 28) transitions.
// Phase 1: matrix 741 rows 588 cols
[2024-06-02 18:35:38] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 18:35:38] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 18:35:38] [INFO ] Invariant cache hit.
[2024-06-02 18:35:39] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 740 sub problems to find dead transitions.
[2024-06-02 18:35:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 3 (OVERLAPS) 741/1329 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-02 18:36:09] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-06-02 18:36:09] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 4 ms to minimize.
SMT process timed out in 30276ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 30283ms
Starting structural reductions in LTL mode, iteration 1 : 588/614 places, 741/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30730 ms. Remains : 588/614 places, 741/769 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-12
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-12 finished in 30884 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) U (p1 U (p2||G(p1))))))'
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 602 transition count 757
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 602 transition count 757
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 594 transition count 749
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 594 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 591 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 591 transition count 746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 590 transition count 745
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 590 transition count 745
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 589 transition count 744
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 589 transition count 744
Applied a total of 50 rules in 48 ms. Remains 589 /614 variables (removed 25) and now considering 744/769 (removed 25) transitions.
// Phase 1: matrix 744 rows 589 cols
[2024-06-02 18:36:09] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 18:36:09] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 18:36:09] [INFO ] Invariant cache hit.
[2024-06-02 18:36:10] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 743 sub problems to find dead transitions.
[2024-06-02 18:36:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 744/1333 variables, 589/593 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1333/1333 variables, and 593 constraints, problems are : Problem set: 0 solved, 743 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 744/1333 variables, 589/593 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1333 variables, 743/1336 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-06-02 18:36:57] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1333/1333 variables, and 1337 constraints, problems are : Problem set: 0 solved, 743 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 1/1 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 589/614 places, 744/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 589/614 places, 744/769 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 935 edges and 589 vertex of which 584 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-21-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-21-LTLFireability-13 finished in 61447 ms.
All properties solved by simple procedures.
Total runtime 299498 ms.
ITS solved all properties within timeout

BK_STOP 1717353431024

--------------------
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

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="CO4-PT-21"
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 CO4-PT-21, 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 r553-tall-171734901000164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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