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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K 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 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 8.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 332K 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-19-LTLFireability-00
FORMULA_NAME CO4-PT-19-LTLFireability-01
FORMULA_NAME CO4-PT-19-LTLFireability-02
FORMULA_NAME CO4-PT-19-LTLFireability-03
FORMULA_NAME CO4-PT-19-LTLFireability-04
FORMULA_NAME CO4-PT-19-LTLFireability-05
FORMULA_NAME CO4-PT-19-LTLFireability-06
FORMULA_NAME CO4-PT-19-LTLFireability-07
FORMULA_NAME CO4-PT-19-LTLFireability-08
FORMULA_NAME CO4-PT-19-LTLFireability-09
FORMULA_NAME CO4-PT-19-LTLFireability-10
FORMULA_NAME CO4-PT-19-LTLFireability-11
FORMULA_NAME CO4-PT-19-LTLFireability-12
FORMULA_NAME CO4-PT-19-LTLFireability-13
FORMULA_NAME CO4-PT-19-LTLFireability-14
FORMULA_NAME CO4-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717355578145

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 19:12:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 19:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:12:59] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-02 19:12:59] [INFO ] Transformed 1174 places.
[2024-06-02 19:12:59] [INFO ] Transformed 1447 transitions.
[2024-06-02 19:12:59] [INFO ] Found NUPN structural information;
[2024-06-02 19:12:59] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 201 places in 17 ms
Reduce places removed 201 places and 274 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-19-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 194 place count 787 transition count 1002
Iterating global reduction 1 with 161 rules applied. Total rules applied 355 place count 787 transition count 1002
Discarding 132 places :
Symmetric choice reduction at 1 with 132 rule applications. Total rules 487 place count 655 transition count 866
Iterating global reduction 1 with 132 rules applied. Total rules applied 619 place count 655 transition count 866
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 626 place count 655 transition count 859
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 690 place count 591 transition count 791
Iterating global reduction 2 with 64 rules applied. Total rules applied 754 place count 591 transition count 791
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 756 place count 591 transition count 789
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 797 place count 550 transition count 748
Iterating global reduction 3 with 41 rules applied. Total rules applied 838 place count 550 transition count 748
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 844 place count 550 transition count 742
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 863 place count 531 transition count 723
Iterating global reduction 4 with 19 rules applied. Total rules applied 882 place count 531 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 884 place count 531 transition count 721
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 890 place count 525 transition count 715
Iterating global reduction 5 with 6 rules applied. Total rules applied 896 place count 525 transition count 715
Applied a total of 896 rules in 247 ms. Remains 525 /973 variables (removed 448) and now considering 715/1173 (removed 458) transitions.
// Phase 1: matrix 715 rows 525 cols
[2024-06-02 19:13:00] [INFO ] Computed 7 invariants in 24 ms
[2024-06-02 19:13:00] [INFO ] Implicit Places using invariants in 308 ms returned [6, 456]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 339 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 523/973 places, 715/1173 transitions.
Applied a total of 0 rules in 14 ms. Remains 523 /523 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 617 ms. Remains : 523/973 places, 715/1173 transitions.
Support contains 32 out of 523 places after structural reductions.
[2024-06-02 19:13:00] [INFO ] Flatten gal took : 72 ms
[2024-06-02 19:13:00] [INFO ] Flatten gal took : 36 ms
[2024-06-02 19:13:00] [INFO ] Input system was already deterministic with 715 transitions.
Support contains 31 out of 523 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (626 resets) in 1522 ms. (26 steps per ms) remains 19/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
// Phase 1: matrix 715 rows 523 cols
[2024-06-02 19:13:01] [INFO ] Computed 5 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 76/96 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 383/479 variables, 103/123 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 18/497 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 17/514 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 424/938 variables, 218/354 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 214/1152 variables, 120/474 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1152 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 69/1221 variables, 42/516 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1221 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 15/1236 variables, 10/526 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1236 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 2/1238 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1238 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (OVERLAPS) 0/1238 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1238/1238 variables, and 528 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2382 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 523/523 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 76/96 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 383/479 variables, 103/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 18/142 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 18/497 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 17/514 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 424/938 variables, 218/373 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/938 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 214/1152 variables, 120/493 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1152 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 69/1221 variables, 42/535 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1221 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 15/1236 variables, 10/545 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1236 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (OVERLAPS) 2/1238 variables, 2/547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1238 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (OVERLAPS) 0/1238 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1238/1238 variables, and 547 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3555 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 523/523 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 5983ms problems are : Problem set: 0 solved, 19 unsolved
Finished Parikh walk after 1345 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=336 )
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 )
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 19 properties in 1827 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 1017 edges and 523 vertex of which 518 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.17 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((X((p1||X(p2)))&&p0)))'
Support contains 3 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 691
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 500 transition count 688
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 495 transition count 682
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 495 transition count 682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 491 transition count 678
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 491 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 491 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 490 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 489 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 489 transition count 674
Applied a total of 73 rules in 58 ms. Remains 489 /523 variables (removed 34) and now considering 674/715 (removed 41) transitions.
// Phase 1: matrix 674 rows 489 cols
[2024-06-02 19:13:09] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:13:09] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 19:13:09] [INFO ] Invariant cache hit.
[2024-06-02 19:13:10] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 673 sub problems to find dead transitions.
[2024-06-02 19:13:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 3 (OVERLAPS) 674/1163 variables, 489/494 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 19:13:33] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 24 ms to minimize.
[2024-06-02 19:13:33] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 4 ms to minimize.
[2024-06-02 19:13:34] [INFO ] Deduced a trap composed of 188 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 497 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 673 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 19:13:49] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:13:49] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 5 (OVERLAPS) 674/1163 variables, 489/499 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 673/1172 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1172 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 5/5 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Starting structural reductions in LTL mode, iteration 1 : 489/523 places, 674/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 489/523 places, 674/715 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-19-LTLFireability-00
Product exploration explored 100000 steps with 12515 reset in 246 ms.
Product exploration explored 100000 steps with 12551 reset in 185 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 968 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/489 stabilizing places and 20/674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 139 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (574 resets) in 398 ms. (100 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (142 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (167 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (139 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (128 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (142 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (171 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
[2024-06-02 19:14:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 25/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/157 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 290/447 variables, 97/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 413/860 variables, 177/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 225/1085 variables, 127/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 56/1141 variables, 35/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 19:14:12] [INFO ] Deduced a trap composed of 188 places in 113 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1141 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1141 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 17/1158 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1158 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 5/1163 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1163 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1163 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 495 constraints, problems are : Problem set: 0 solved, 6 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 25/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/157 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 290/447 variables, 97/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 413/860 variables, 177/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 225/1085 variables, 127/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1085 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 56/1141 variables, 35/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1141 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1141 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 17/1158 variables, 9/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1158 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/1163 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1163 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1163 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 501 constraints, problems are : Problem set: 0 solved, 6 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1825ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 96 steps, including 1 resets, run visited all 6 properties in 4 ms. (steps per millisecond=24 )
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 6 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 15 factoid took 563 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-06-02 19:14:14] [INFO ] Invariant cache hit.
[2024-06-02 19:14:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 19:14:14] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-06-02 19:14:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:14:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 19:14:15] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-02 19:14:15] [INFO ] Computed and/alt/rep : 655/1178/655 causal constraints (skipped 18 transitions) in 41 ms.
[2024-06-02 19:14:20] [INFO ] Added : 594 causal constraints over 119 iterations in 5074 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 674/674 transitions.
Applied a total of 0 rules in 6 ms. Remains 489 /489 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-06-02 19:14:20] [INFO ] Invariant cache hit.
[2024-06-02 19:14:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:14:20] [INFO ] Invariant cache hit.
[2024-06-02 19:14:20] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 673 sub problems to find dead transitions.
[2024-06-02 19:14:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 3 (OVERLAPS) 674/1163 variables, 489/494 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 19:14:43] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-06-02 19:14:43] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:14:44] [INFO ] Deduced a trap composed of 188 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 497 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 673 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 673 unsolved
[2024-06-02 19:14:59] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:14:59] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 5 (OVERLAPS) 674/1163 variables, 489/499 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 673/1172 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1172 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 5/5 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in LTL mode , in 1 iterations and 60611 ms. Remains : 489/489 places, 674/674 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 968 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/489 stabilizing places and 20/674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 133 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (538 resets) in 219 ms. (181 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (141 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (131 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (114 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (140 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (111 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (161 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
[2024-06-02 19:15:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 25/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/157 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 290/447 variables, 97/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 413/860 variables, 177/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 225/1085 variables, 127/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 56/1141 variables, 35/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 19:15:22] [INFO ] Deduced a trap composed of 188 places in 114 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1141 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1141 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 17/1158 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1158 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 5/1163 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1163 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1163 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 495 constraints, problems are : Problem set: 0 solved, 6 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 25/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 117/157 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 290/447 variables, 97/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 413/860 variables, 177/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 225/1085 variables, 127/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1085 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 56/1141 variables, 35/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1141 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1141 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 17/1158 variables, 9/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1158 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/1163 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1163 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1163 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 501 constraints, problems are : Problem set: 0 solved, 6 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1778ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 80 steps, including 1 resets, run visited all 6 properties in 3 ms. (steps per millisecond=26 )
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 6 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 15 factoid took 486 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-06-02 19:15:24] [INFO ] Invariant cache hit.
[2024-06-02 19:15:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 19:15:24] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-06-02 19:15:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:15:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 19:15:25] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-06-02 19:15:25] [INFO ] Computed and/alt/rep : 655/1178/655 causal constraints (skipped 18 transitions) in 35 ms.
[2024-06-02 19:15:29] [INFO ] Added : 594 causal constraints over 119 iterations in 4802 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 12499 reset in 133 ms.
Product exploration explored 100000 steps with 12547 reset in 140 ms.
Built C files in :
/tmp/ltsmin12246097213376717858
[2024-06-02 19:15:30] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12246097213376717858
Running compilation step : cd /tmp/ltsmin12246097213376717858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1292 ms.
Running link step : cd /tmp/ltsmin12246097213376717858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12246097213376717858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5811794496885018282.hoa' '--buchi-type=spotba'
LTSmin run took 324 ms.
FORMULA CO4-PT-19-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLFireability-00 finished in 142648 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&&((p2&&F(p3))||p1)))))'
Support contains 6 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 499 transition count 690
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 499 transition count 690
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 499 transition count 687
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 493 transition count 680
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 489 transition count 675
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 489 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 489 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 487 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 487 transition count 671
Applied a total of 78 rules in 45 ms. Remains 487 /523 variables (removed 36) and now considering 671/715 (removed 44) transitions.
// Phase 1: matrix 671 rows 487 cols
[2024-06-02 19:15:32] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 19:15:32] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:15:32] [INFO ] Invariant cache hit.
[2024-06-02 19:15:32] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-02 19:15:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 19:15:46] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 4 ms to minimize.
[2024-06-02 19:15:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/494 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 19:15:56] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:15:56] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-06-02 19:15:57] [INFO ] Deduced a trap composed of 188 places in 85 ms of which 2 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 1158/1158 variables, and 497 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/497 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1158 variables, 670/1167 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1167 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 487/523 places, 671/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 487/523 places, 671/715 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : CO4-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 466 reset in 136 ms.
Entered a terminal (fully accepting) state of product in 31076 steps with 647 reset in 67 ms.
FORMULA CO4-PT-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-01 finished in 61013 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 G(p1)) U X((!p1||X(X(p2))))))'
Support contains 3 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 510 transition count 702
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 510 transition count 702
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 503 transition count 694
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 503 transition count 694
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 503 transition count 691
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 498 transition count 686
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 498 transition count 686
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 498 transition count 685
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 494 transition count 681
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 494 transition count 681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 494 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 493 transition count 678
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 493 transition count 678
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 492 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 492 transition count 677
Applied a total of 68 rules in 47 ms. Remains 492 /523 variables (removed 31) and now considering 677/715 (removed 38) transitions.
// Phase 1: matrix 677 rows 492 cols
[2024-06-02 19:16:33] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:16:33] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 19:16:33] [INFO ] Invariant cache hit.
[2024-06-02 19:16:33] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2024-06-02 19:16:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (OVERLAPS) 677/1169 variables, 492/497 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 19:16:57] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-06-02 19:16:57] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 3 ms to minimize.
[2024-06-02 19:16:58] [INFO ] Deduced a trap composed of 190 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1169/1169 variables, and 500 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1169 variables, 492/500 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1169 variables, 676/1176 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1169/1169 variables, and 1176 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 3/3 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 492/523 places, 677/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60689 ms. Remains : 492/523 places, 677/715 transitions.
Stuttering acceptance computed with spot in 693 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p2)), false, (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (NOT p2), true, (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-19-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 971 edges and 492 vertex of which 487 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 20 states, 45 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLFireability-02 finished in 61754 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)))||G(p1)))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 691
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 691
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 500 transition count 689
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 494 transition count 682
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 494 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 494 transition count 681
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 490 transition count 677
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 490 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 489 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 489 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 488 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 488 transition count 673
Applied a total of 75 rules in 41 ms. Remains 488 /523 variables (removed 35) and now considering 673/715 (removed 42) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 19:17:35] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 19:17:35] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 19:17:35] [INFO ] Invariant cache hit.
[2024-06-02 19:17:35] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 19:17:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:17:48] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:17:48] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/495 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:17:59] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-06-02 19:17:59] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:18:00] [INFO ] Deduced a trap composed of 187 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 498 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/498 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 672/1170 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:18:20] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1171 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 6/6 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Starting structural reductions in LTL mode, iteration 1 : 488/523 places, 673/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60622 ms. Remains : 488/523 places, 673/715 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 1646 reset in 118 ms.
Product exploration explored 100000 steps with 78 reset in 86 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 962 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 73 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (545 resets) in 94 ms. (421 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (140 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (112 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
[2024-06-02 19:18:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 121/141 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/157 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/173 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 264/437 variables, 116/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 375/812 variables, 151/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/812 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 244/1056 variables, 129/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1056 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 82/1138 variables, 50/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1138 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 17/1155 variables, 11/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1155 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/1160 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1160 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1161 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1161 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1161 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 493 constraints, problems are : Problem set: 0 solved, 2 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 121/141 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/157 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 16/173 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 264/437 variables, 116/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 375/812 variables, 151/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/812 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 244/1056 variables, 129/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1056 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 82/1138 variables, 50/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1138 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 17/1155 variables, 11/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1155 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 5/1160 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/1161 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1161 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1161 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 495 constraints, problems are : Problem set: 0 solved, 2 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 797ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 82 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Applied a total of 0 rules in 6 ms. Remains 488 /488 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2024-06-02 19:18:37] [INFO ] Invariant cache hit.
[2024-06-02 19:18:37] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 19:18:37] [INFO ] Invariant cache hit.
[2024-06-02 19:18:38] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 19:18:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:18:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 3 ms to minimize.
[2024-06-02 19:18:51] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/495 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:19:02] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-06-02 19:19:02] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:19:03] [INFO ] Deduced a trap composed of 187 places in 78 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 498 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/498 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 672/1170 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:19:23] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1171 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 6/6 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Finished structural reductions in LTL mode , in 1 iterations and 60535 ms. Remains : 488/488 places, 673/673 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 962 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (543 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (138 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (140 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 414202 steps, run visited all 4 properties in 1834 ms. (steps per millisecond=225 )
Probabilistic random walk after 414202 steps, saw 86235 distinct states, run finished after 1838 ms. (steps per millisecond=225 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 427 reset in 97 ms.
Product exploration explored 100000 steps with 568 reset in 97 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Graph (trivial) has 526 edges and 488 vertex of which 3 / 488 are part of one of the 1 SCC in 8 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 960 edges and 486 vertex of which 481 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 481 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 204 place count 481 transition count 664
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 204 place count 481 transition count 667
Deduced a syphon composed of 206 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 481 transition count 667
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 268 place count 422 transition count 608
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 327 place count 422 transition count 608
Performed 107 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 434 place count 422 transition count 664
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 451 place count 422 transition count 647
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 547 place count 326 transition count 546
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 96 rules applied. Total rules applied 643 place count 326 transition count 546
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 644 place count 325 transition count 545
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 645 place count 325 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 325 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 647 place count 325 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 649 place count 323 transition count 542
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 651 place count 323 transition count 542
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 652 place count 323 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 654 place count 321 transition count 539
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 656 place count 321 transition count 539
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 658 place count 319 transition count 536
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 660 place count 319 transition count 536
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 661 place count 319 transition count 535
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 662 place count 318 transition count 534
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 663 place count 318 transition count 534
Performed 62 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 62 rules applied. Total rules applied 725 place count 318 transition count 839
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 5 with 60 rules applied. Total rules applied 785 place count 318 transition count 779
Discarding 105 places :
Symmetric choice reduction at 6 with 105 rule applications. Total rules 890 place count 213 transition count 492
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 6 with 105 rules applied. Total rules applied 995 place count 213 transition count 492
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1030 place count 213 transition count 457
Discarding 66 places :
Symmetric choice reduction at 7 with 66 rule applications. Total rules 1096 place count 147 transition count 329
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 7 with 66 rules applied. Total rules applied 1162 place count 147 transition count 329
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1170 place count 147 transition count 321
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1181 place count 136 transition count 300
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 11 rules applied. Total rules applied 1192 place count 136 transition count 300
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1195 place count 136 transition count 353
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1205 place count 136 transition count 343
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1210 place count 131 transition count 321
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1215 place count 131 transition count 321
Deduced a syphon composed of 74 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 9 with 49 rules applied. Total rules applied 1264 place count 131 transition count 272
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1265 place count 130 transition count 271
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1266 place count 130 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1267 place count 130 transition count 292
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1269 place count 128 transition count 276
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1271 place count 128 transition count 276
Deduced a syphon composed of 72 places in 0 ms
Applied a total of 1271 rules in 203 ms. Remains 128 /488 variables (removed 360) and now considering 276/673 (removed 397) transitions.
[2024-06-02 19:19:41] [INFO ] Redundant transitions in 12 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 19:19:42] [INFO ] Flow matrix only has 264 transitions (discarded 12 similar events)
// Phase 1: matrix 264 rows 128 cols
[2024-06-02 19:19:42] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:19:42] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 19:19:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 19:19:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 19:19:43] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 4 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-02 19:19:43] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-02 19:19:43] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 260 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 4 (OVERLAPS) 263/391 variables, 128/138 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 44/182 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/182 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/183 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/183 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/183 constraints. Problems are: Problem set: 162 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 183 constraints, problems are : Problem set: 162 solved, 113 unsolved in 6228 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 162 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 16/71 variables, 5/5 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 5/10 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 247/318 variables, 71/81 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 44/125 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 113/238 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/238 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 73/391 variables, 57/295 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/295 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/296 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/296 constraints. Problems are: Problem set: 162 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/296 constraints. Problems are: Problem set: 162 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 296 constraints, problems are : Problem set: 162 solved, 113 unsolved in 5088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 113/275 constraints, Known Traps: 5/5 constraints]
After SMT, in 11394ms problems are : Problem set: 162 solved, 113 unsolved
Search for dead transitions found 162 dead transitions in 11399ms
Found 162 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 162 transitions
Dead transitions reduction (with SMT) removed 162 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/488 places, 114/673 transitions.
Graph (complete) has 234 edges and 128 vertex of which 56 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.1 ms
Discarding 72 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 56 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 19 ms. Remains 56 /128 variables (removed 72) and now considering 127/114 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/488 places, 127/673 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11647 ms. Remains : 56/488 places, 127/673 transitions.
Built C files in :
/tmp/ltsmin4607672887197813344
[2024-06-02 19:19:53] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4607672887197813344
Running compilation step : cd /tmp/ltsmin4607672887197813344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1126 ms.
Running link step : cd /tmp/ltsmin4607672887197813344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4607672887197813344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1278169009817390837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 673/673 transitions.
Applied a total of 0 rules in 11 ms. Remains 488 /488 variables (removed 0) and now considering 673/673 (removed 0) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 19:20:08] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 19:20:08] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:20:08] [INFO ] Invariant cache hit.
[2024-06-02 19:20:08] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 19:20:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:20:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:20:22] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/495 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:20:33] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 3 ms to minimize.
[2024-06-02 19:20:33] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-06-02 19:20:34] [INFO ] Deduced a trap composed of 187 places in 85 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 498 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/498 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 672/1170 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:20:54] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1171 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 6/6 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Finished structural reductions in LTL mode , in 1 iterations and 60583 ms. Remains : 488/488 places, 673/673 transitions.
Built C files in :
/tmp/ltsmin8207281575337368299
[2024-06-02 19:21:09] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8207281575337368299
Running compilation step : cd /tmp/ltsmin8207281575337368299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1178 ms.
Running link step : cd /tmp/ltsmin8207281575337368299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8207281575337368299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8719152174764580780.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 19:21:24] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:21:24] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:21:24] [INFO ] Time to serialize gal into /tmp/LTL14382899993425769375.gal : 6 ms
[2024-06-02 19:21:24] [INFO ] Time to serialize properties into /tmp/LTL11648388328611514951.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14382899993425769375.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13078162618444643650.hoa' '-atoms' '/tmp/LTL11648388328611514951.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11648388328611514951.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13078162618444643650.hoa
Detected timeout of ITS tools.
[2024-06-02 19:21:39] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:21:39] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:21:39] [INFO ] Time to serialize gal into /tmp/LTL9234658890090996840.gal : 5 ms
[2024-06-02 19:21:39] [INFO ] Time to serialize properties into /tmp/LTL6673365522087261420.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9234658890090996840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6673365522087261420.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(p1077==1)"))))||(G("(p848==0)"))))
Formula 0 simplified : XXG!"(p1077==1)" & F!"(p848==0)"
Detected timeout of ITS tools.
[2024-06-02 19:21:54] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:21:54] [INFO ] Applying decomposition
[2024-06-02 19:21:54] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17632260360373905288.txt' '-o' '/tmp/graph17632260360373905288.bin' '-w' '/tmp/graph17632260360373905288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17632260360373905288.bin' '-l' '-1' '-v' '-w' '/tmp/graph17632260360373905288.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:21:54] [INFO ] Decomposing Gal with order
[2024-06-02 19:21:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:21:54] [INFO ] Removed a total of 409 redundant transitions.
[2024-06-02 19:21:54] [INFO ] Flatten gal took : 73 ms
[2024-06-02 19:21:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 12 ms.
[2024-06-02 19:21:54] [INFO ] Time to serialize gal into /tmp/LTL9048456361160825914.gal : 11 ms
[2024-06-02 19:21:54] [INFO ] Time to serialize properties into /tmp/LTL9083013499990794093.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9048456361160825914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9083013499990794093.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(i19.u181.p1077==1)"))))||(G("(i16.u144.p848==0)"))))
Formula 0 simplified : XXG!"(i19.u181.p1077==1)" & F!"(i16.u144.p848==0)"
Reverse transition relation is NOT exact ! Due to transitions t26, t49, t98, t99, t145, t180, t193, t244, t280, t321, t333, t370, t385, t507, t581, t582, t...1074
Computing Next relation with stutter on 618239 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
310 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.16074,129616,1,0,222717,1884,7823,553090,371,8652,529857
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-19-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-19-LTLFireability-03 finished in 263554 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 U p1))))'
Support contains 6 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 554 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 515 transition count 490
Reduce places removed 216 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 217 rules applied. Total rules applied 435 place count 299 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 298 transition count 489
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 436 place count 298 transition count 445
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 524 place count 254 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 529 place count 249 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 534 place count 249 transition count 440
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 534 place count 249 transition count 436
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 542 place count 245 transition count 436
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 545 place count 242 transition count 431
Iterating global reduction 3 with 3 rules applied. Total rules applied 548 place count 242 transition count 431
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 3 with 2 rules applied. Total rules applied 550 place count 242 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 551 place count 241 transition count 429
Performed 91 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 733 place count 150 transition count 310
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 747 place count 150 transition count 296
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 756 place count 141 transition count 282
Iterating global reduction 6 with 9 rules applied. Total rules applied 765 place count 141 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 766 place count 141 transition count 281
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 7 with 2 rules applied. Total rules applied 768 place count 140 transition count 280
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 769 place count 139 transition count 278
Iterating global reduction 7 with 1 rules applied. Total rules applied 770 place count 139 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 771 place count 139 transition count 277
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 851 place count 99 transition count 318
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 871 place count 99 transition count 298
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 899 place count 71 transition count 186
Iterating global reduction 9 with 28 rules applied. Total rules applied 927 place count 71 transition count 186
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 944 place count 71 transition count 169
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 950 place count 65 transition count 137
Iterating global reduction 10 with 6 rules applied. Total rules applied 956 place count 65 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 961 place count 65 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 969 place count 61 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 11 with 44 rules applied. Total rules applied 1013 place count 61 transition count 133
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1014 place count 61 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1015 place count 60 transition count 132
Applied a total of 1015 rules in 71 ms. Remains 60 /523 variables (removed 463) and now considering 132/715 (removed 583) transitions.
[2024-06-02 19:21:58] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
// Phase 1: matrix 101 rows 60 cols
[2024-06-02 19:21:58] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 19:21:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 19:21:58] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
[2024-06-02 19:21:58] [INFO ] Invariant cache hit.
[2024-06-02 19:21:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:21:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-02 19:21:58] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-02 19:21:58] [INFO ] Flow matrix only has 101 transitions (discarded 31 similar events)
[2024-06-02 19:21:58] [INFO ] Invariant cache hit.
[2024-06-02 19:21:58] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 100/160 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 1/161 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 77 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2167 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 100/160 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 120/196 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 197 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2479 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 4692ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 4693ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/523 places, 132/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4872 ms. Remains : 60/523 places, 132/715 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-04 finished in 4983 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)&&(p1||F(p2)||X(F(p3))))))'
Support contains 4 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 559 edges and 523 vertex of which 3 / 523 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 515 transition count 488
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 438 place count 297 transition count 488
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 438 place count 297 transition count 444
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 526 place count 253 transition count 444
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 531 place count 248 transition count 439
Iterating global reduction 2 with 5 rules applied. Total rules applied 536 place count 248 transition count 439
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 536 place count 248 transition count 435
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 544 place count 244 transition count 435
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 547 place count 241 transition count 430
Iterating global reduction 2 with 3 rules applied. Total rules applied 550 place count 241 transition count 430
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 2 with 2 rules applied. Total rules applied 552 place count 241 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 553 place count 240 transition count 428
Performed 93 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 739 place count 147 transition count 307
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 752 place count 147 transition count 294
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 760 place count 139 transition count 282
Iterating global reduction 5 with 8 rules applied. Total rules applied 768 place count 139 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 769 place count 139 transition count 281
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 6 with 2 rules applied. Total rules applied 771 place count 138 transition count 280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 772 place count 137 transition count 278
Iterating global reduction 6 with 1 rules applied. Total rules applied 773 place count 137 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 774 place count 137 transition count 277
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 856 place count 96 transition count 325
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 876 place count 96 transition count 305
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 904 place count 68 transition count 193
Iterating global reduction 8 with 28 rules applied. Total rules applied 932 place count 68 transition count 193
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 950 place count 68 transition count 175
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 957 place count 61 transition count 137
Iterating global reduction 9 with 7 rules applied. Total rules applied 964 place count 61 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 968 place count 61 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 972 place count 59 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 10 with 31 rules applied. Total rules applied 1003 place count 59 transition count 119
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 10 with 2 rules applied. Total rules applied 1005 place count 58 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1007 place count 56 transition count 125
Applied a total of 1007 rules in 53 ms. Remains 56 /523 variables (removed 467) and now considering 125/715 (removed 590) transitions.
[2024-06-02 19:22:03] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
// Phase 1: matrix 113 rows 56 cols
[2024-06-02 19:22:03] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:22:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 19:22:03] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
[2024-06-02 19:22:03] [INFO ] Invariant cache hit.
[2024-06-02 19:22:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 19:22:03] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-02 19:22:03] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-02 19:22:03] [INFO ] Flow matrix only has 113 transitions (discarded 12 similar events)
[2024-06-02 19:22:03] [INFO ] Invariant cache hit.
[2024-06-02 19:22:03] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 112/168 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/169 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 65 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 112/168 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 104/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 169 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1870 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3433ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3434ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/523 places, 125/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3593 ms. Remains : 56/523 places, 125/715 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CO4-PT-19-LTLFireability-05
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-05 finished in 3749 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 (G(p0)||(p0&&G(p1)))))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Graph (trivial) has 559 edges and 523 vertex of which 3 / 523 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 1015 edges and 521 vertex of which 516 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 515 transition count 485
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 444 place count 294 transition count 485
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 444 place count 294 transition count 441
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 532 place count 250 transition count 441
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 537 place count 245 transition count 436
Iterating global reduction 2 with 5 rules applied. Total rules applied 542 place count 245 transition count 436
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 542 place count 245 transition count 432
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 550 place count 241 transition count 432
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 553 place count 238 transition count 427
Iterating global reduction 2 with 3 rules applied. Total rules applied 556 place count 238 transition count 427
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 2 with 2 rules applied. Total rules applied 558 place count 238 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 237 transition count 425
Performed 92 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 743 place count 145 transition count 308
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 758 place count 145 transition count 293
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 767 place count 136 transition count 279
Iterating global reduction 5 with 9 rules applied. Total rules applied 776 place count 136 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 777 place count 136 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 779 place count 135 transition count 277
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 780 place count 134 transition count 275
Iterating global reduction 6 with 1 rules applied. Total rules applied 781 place count 134 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 782 place count 134 transition count 274
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 864 place count 93 transition count 320
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 885 place count 93 transition count 299
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 913 place count 65 transition count 187
Iterating global reduction 8 with 28 rules applied. Total rules applied 941 place count 65 transition count 187
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 960 place count 65 transition count 168
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 967 place count 58 transition count 130
Iterating global reduction 9 with 7 rules applied. Total rules applied 974 place count 58 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 979 place count 58 transition count 125
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 987 place count 54 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 1027 place count 54 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1029 place count 52 transition count 124
Applied a total of 1029 rules in 58 ms. Remains 52 /523 variables (removed 471) and now considering 124/715 (removed 591) transitions.
[2024-06-02 19:22:07] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
// Phase 1: matrix 101 rows 52 cols
[2024-06-02 19:22:07] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:22:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 19:22:07] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 19:22:07] [INFO ] Invariant cache hit.
[2024-06-02 19:22:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 19:22:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-02 19:22:07] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-02 19:22:07] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 19:22:07] [INFO ] Invariant cache hit.
[2024-06-02 19:22:07] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 100/152 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/153 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 62 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 100/152 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 104/165 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 1/153 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 166 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1786 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3220ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/523 places, 124/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3372 ms. Remains : 52/523 places, 124/715 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-07
Product exploration explored 100000 steps with 73 reset in 98 ms.
Product exploration explored 100000 steps with 11 reset in 83 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 131 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3268 resets) in 220 ms. (180 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (282 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2024-06-02 19:22:11] [INFO ] Flow matrix only has 101 transitions (discarded 23 similar events)
[2024-06-02 19:22:11] [INFO ] Invariant cache hit.
[2024-06-02 19:22:11] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/36 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/116 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/118 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/128 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/152 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/153 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/153 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/36 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 80/116 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/118 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/128 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 24/152 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/153 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/153 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/153 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 156 steps, including 12 resets, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 13 factoid took 154 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLFireability-07 finished in 4341 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)))'
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 500 transition count 692
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 500 transition count 692
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 500 transition count 689
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 494 transition count 682
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 494 transition count 682
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 494 transition count 681
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 490 transition count 677
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 490 transition count 677
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 489 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 489 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 673
Applied a total of 76 rules in 43 ms. Remains 488 /523 variables (removed 35) and now considering 673/715 (removed 42) transitions.
// Phase 1: matrix 673 rows 488 cols
[2024-06-02 19:22:11] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 19:22:11] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:22:11] [INFO ] Invariant cache hit.
[2024-06-02 19:22:12] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 19:22:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:22:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:22:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/495 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:22:36] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:22:36] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:22:36] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-06-02 19:22:37] [INFO ] Deduced a trap composed of 187 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 499 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1161 variables, 488/499 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 672/1171 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1172 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 7/7 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 488/523 places, 673/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60615 ms. Remains : 488/523 places, 673/715 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-10 finished in 60733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 1 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 508 transition count 700
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 508 transition count 700
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 499 transition count 690
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 499 transition count 690
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 499 transition count 687
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 493 transition count 680
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 489 transition count 675
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 489 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 489 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 488 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 488 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 487 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 487 transition count 671
Applied a total of 78 rules in 46 ms. Remains 487 /523 variables (removed 36) and now considering 671/715 (removed 44) transitions.
// Phase 1: matrix 671 rows 487 cols
[2024-06-02 19:23:12] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 19:23:12] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:23:12] [INFO ] Invariant cache hit.
[2024-06-02 19:23:12] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-02 19:23:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 19:23:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2024-06-02 19:23:26] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/494 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 19:23:37] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-06-02 19:23:37] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:23:38] [INFO ] Deduced a trap composed of 188 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 497 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/497 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1158 variables, 670/1167 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1167 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 487/523 places, 671/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60650 ms. Remains : 487/523 places, 671/715 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-11 finished in 60783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 509 transition count 701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 509 transition count 701
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 502 transition count 693
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 502 transition count 693
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 502 transition count 690
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 498 transition count 685
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 498 transition count 685
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 498 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 496 transition count 682
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 496 transition count 682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 496 transition count 680
Applied a total of 60 rules in 33 ms. Remains 496 /523 variables (removed 27) and now considering 680/715 (removed 35) transitions.
// Phase 1: matrix 680 rows 496 cols
[2024-06-02 19:24:13] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:24:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 19:24:13] [INFO ] Invariant cache hit.
[2024-06-02 19:24:13] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2024-06-02 19:24:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (OVERLAPS) 680/1176 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-02 19:24:36] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 5 ms to minimize.
[2024-06-02 19:24:37] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-06-02 19:24:38] [INFO ] Deduced a trap composed of 193 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1176/1176 variables, and 504 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 680/1176 variables, 496/504 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1176 variables, 679/1183 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-02 19:24:58] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1176/1176 variables, and 1184 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 4/4 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 679 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 496/523 places, 680/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60660 ms. Remains : 496/523 places, 680/715 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-19-LTLFireability-14
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA CO4-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLFireability-14 finished in 60915 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||F(p1)))))'
Support contains 4 out of 523 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 715/715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 509 transition count 701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 509 transition count 701
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 501 transition count 692
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 501 transition count 692
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 501 transition count 690
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 496 transition count 684
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 496 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 496 transition count 683
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 493 transition count 680
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 493 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 493 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 492 transition count 678
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 492 transition count 678
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 491 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 491 transition count 677
Applied a total of 68 rules in 45 ms. Remains 491 /523 variables (removed 32) and now considering 677/715 (removed 38) transitions.
// Phase 1: matrix 677 rows 491 cols
[2024-06-02 19:25:14] [INFO ] Computed 5 invariants in 11 ms
[2024-06-02 19:25:14] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 19:25:14] [INFO ] Invariant cache hit.
[2024-06-02 19:25:14] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2024-06-02 19:25:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 19:25:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:25:28] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/498 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 19:25:39] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-06-02 19:25:39] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:25:40] [INFO ] Deduced a trap composed of 187 places in 85 ms of which 1 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 1168/1168 variables, and 501 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 676/1177 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1168/1168 variables, and 1177 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in LTL mode, iteration 1 : 491/523 places, 677/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60629 ms. Remains : 491/523 places, 677/715 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 3021 reset in 151 ms.
Product exploration explored 100000 steps with 3023 reset in 169 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 966 edges and 491 vertex of which 486 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 92 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-06-02 19:26:15] [INFO ] Invariant cache hit.
[2024-06-02 19:26:16] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 19:26:16] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-06-02 19:26:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:26:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 19:26:16] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-06-02 19:26:16] [INFO ] Computed and/alt/rep : 657/1165/657 causal constraints (skipped 19 transitions) in 34 ms.
[2024-06-02 19:26:21] [INFO ] Added : 592 causal constraints over 119 iterations in 5046 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 491 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 677/677 transitions.
Applied a total of 0 rules in 9 ms. Remains 491 /491 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2024-06-02 19:26:21] [INFO ] Invariant cache hit.
[2024-06-02 19:26:21] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 19:26:21] [INFO ] Invariant cache hit.
[2024-06-02 19:26:22] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2024-06-02 19:26:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 19:26:35] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-02 19:26:35] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/498 constraints. Problems are: Problem set: 0 solved, 676 unsolved
[2024-06-02 19:26:46] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:26:46] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-06-02 19:26:47] [INFO ] Deduced a trap composed of 187 places in 71 ms of which 2 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 1168/1168 variables, and 501 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 677/1168 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 676/1177 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1168/1168 variables, and 1177 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 5/5 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in LTL mode , in 1 iterations and 60581 ms. Remains : 491/491 places, 677/677 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 966 edges and 491 vertex of which 486 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 119 steps (0 resets) in 4 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-06-02 19:27:23] [INFO ] Invariant cache hit.
[2024-06-02 19:27:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 19:27:23] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-06-02 19:27:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:27:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-06-02 19:27:23] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-06-02 19:27:23] [INFO ] Computed and/alt/rep : 657/1165/657 causal constraints (skipped 19 transitions) in 32 ms.
[2024-06-02 19:27:29] [INFO ] Added : 592 causal constraints over 119 iterations in 5261 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3052 reset in 160 ms.
Product exploration explored 100000 steps with 3025 reset in 165 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 491/491 places, 677/677 transitions.
Graph (trivial) has 526 edges and 491 vertex of which 3 / 491 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 964 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 204 rules applied. Total rules applied 206 place count 484 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 207 place count 484 transition count 668
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 207 place count 484 transition count 672
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 484 transition count 672
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 274 place count 423 transition count 611
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 335 place count 423 transition count 611
Performed 105 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 440 place count 423 transition count 667
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 457 place count 423 transition count 650
Discarding 94 places :
Symmetric choice reduction at 3 with 94 rule applications. Total rules 551 place count 329 transition count 551
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 3 with 94 rules applied. Total rules applied 645 place count 329 transition count 551
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 646 place count 328 transition count 550
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 328 transition count 550
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 648 place count 328 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 649 place count 328 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 651 place count 326 transition count 547
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 653 place count 326 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 326 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 656 place count 324 transition count 544
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 658 place count 324 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 660 place count 322 transition count 541
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 662 place count 322 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 322 transition count 540
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 664 place count 321 transition count 539
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 665 place count 321 transition count 539
Performed 63 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 63 rules applied. Total rules applied 728 place count 321 transition count 848
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 5 with 61 rules applied. Total rules applied 789 place count 321 transition count 787
Discarding 107 places :
Symmetric choice reduction at 6 with 107 rule applications. Total rules 896 place count 214 transition count 494
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 6 with 107 rules applied. Total rules applied 1003 place count 214 transition count 494
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1038 place count 214 transition count 459
Discarding 66 places :
Symmetric choice reduction at 7 with 66 rule applications. Total rules 1104 place count 148 transition count 331
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 7 with 66 rules applied. Total rules applied 1170 place count 148 transition count 331
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1175 place count 148 transition count 326
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1186 place count 137 transition count 305
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 11 rules applied. Total rules applied 1197 place count 137 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1200 place count 137 transition count 358
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1210 place count 137 transition count 348
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1215 place count 132 transition count 326
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1220 place count 132 transition count 326
Deduced a syphon composed of 75 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 1256 place count 132 transition count 290
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1257 place count 131 transition count 289
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1258 place count 131 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1259 place count 131 transition count 313
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1261 place count 129 transition count 295
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1263 place count 129 transition count 295
Deduced a syphon composed of 73 places in 1 ms
Applied a total of 1263 rules in 95 ms. Remains 129 /491 variables (removed 362) and now considering 295/677 (removed 382) transitions.
[2024-06-02 19:27:29] [INFO ] Redundant transitions in 2 ms returned []
Running 294 sub problems to find dead transitions.
[2024-06-02 19:27:29] [INFO ] Flow matrix only has 286 transitions (discarded 9 similar events)
// Phase 1: matrix 286 rows 129 cols
[2024-06-02 19:27:29] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:27:29] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 19:27:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 19:27:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 19:27:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-02 19:27:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-02 19:27:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 279 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 4 (OVERLAPS) 285/414 variables, 129/139 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 49/188 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/188 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 1/415 variables, 1/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/189 constraints. Problems are: Problem set: 173 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 189 constraints, problems are : Problem set: 173 solved, 121 unsolved in 6630 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 129/129 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 173 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 16/71 variables, 5/5 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 5/10 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 269/340 variables, 71/81 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 49/130 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 121/251 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/251 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 74/414 variables, 58/309 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/309 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 1/415 variables, 1/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 0/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/415 variables, 0/310 constraints. Problems are: Problem set: 173 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 310 constraints, problems are : Problem set: 173 solved, 121 unsolved in 5815 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 129/129 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 121/294 constraints, Known Traps: 5/5 constraints]
After SMT, in 12545ms problems are : Problem set: 173 solved, 121 unsolved
Search for dead transitions found 173 dead transitions in 12548ms
Found 173 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 173 transitions
Dead transitions reduction (with SMT) removed 173 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 129/491 places, 122/677 transitions.
Graph (complete) has 233 edges and 129 vertex of which 56 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 56 transition count 162
Deduced a syphon composed of 2 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 20 place count 56 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 20 rules in 9 ms. Remains 56 /129 variables (removed 73) and now considering 145/122 (removed -23) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/491 places, 145/677 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12662 ms. Remains : 56/491 places, 145/677 transitions.
Built C files in :
/tmp/ltsmin9566625310019553442
[2024-06-02 19:27:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9566625310019553442
Running compilation step : cd /tmp/ltsmin9566625310019553442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1122 ms.
Running link step : cd /tmp/ltsmin9566625310019553442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9566625310019553442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9916943383810721348.hoa' '--buchi-type=spotba'
LTSmin run took 589 ms.
FORMULA CO4-PT-19-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLFireability-15 finished in 150177 ms.
All properties solved by simple procedures.
Total runtime 885001 ms.

BK_STOP 1717356464364

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-19, 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 r550-tall-171734898700148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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