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.r468-smll-171620167100163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutoFlight-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 266K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717190311618

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:18:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:18:33] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-31 21:18:33] [INFO ] Transformed 1126 places.
[2024-05-31 21:18:33] [INFO ] Transformed 1124 transitions.
[2024-05-31 21:18:33] [INFO ] Found NUPN structural information;
[2024-05-31 21:18:33] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-12b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 153 places :
Symmetric choice reduction at 0 with 153 rule applications. Total rules 153 place count 973 transition count 971
Iterating global reduction 0 with 153 rules applied. Total rules applied 306 place count 973 transition count 971
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 330 place count 973 transition count 947
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 396 place count 907 transition count 881
Iterating global reduction 1 with 66 rules applied. Total rules applied 462 place count 907 transition count 881
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 474 place count 895 transition count 869
Iterating global reduction 1 with 12 rules applied. Total rules applied 486 place count 895 transition count 869
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 497 place count 884 transition count 858
Iterating global reduction 1 with 11 rules applied. Total rules applied 508 place count 884 transition count 858
Applied a total of 508 rules in 615 ms. Remains 884 /1126 variables (removed 242) and now considering 858/1124 (removed 266) transitions.
// Phase 1: matrix 858 rows 884 cols
[2024-05-31 21:18:34] [INFO ] Computed 76 invariants in 38 ms
[2024-05-31 21:18:35] [INFO ] Implicit Places using invariants in 779 ms returned []
[2024-05-31 21:18:35] [INFO ] Invariant cache hit.
[2024-05-31 21:18:36] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
Running 857 sub problems to find dead transitions.
[2024-05-31 21:18:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/883 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (OVERLAPS) 1/884 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 857 unsolved
[2024-05-31 21:19:06] [INFO ] Deduced a trap composed of 35 places in 664 ms of which 96 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/1742 variables, and 77 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/884 constraints, PredecessorRefiner: 857/857 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/883 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (OVERLAPS) 1/884 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/884 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 857 unsolved
[2024-05-31 21:19:23] [INFO ] Deduced a trap composed of 100 places in 504 ms of which 9 ms to minimize.
[2024-05-31 21:19:23] [INFO ] Deduced a trap composed of 114 places in 609 ms of which 8 ms to minimize.
[2024-05-31 21:19:24] [INFO ] Deduced a trap composed of 109 places in 629 ms of which 8 ms to minimize.
[2024-05-31 21:19:25] [INFO ] Deduced a trap composed of 101 places in 588 ms of which 8 ms to minimize.
[2024-05-31 21:19:25] [INFO ] Deduced a trap composed of 20 places in 524 ms of which 8 ms to minimize.
[2024-05-31 21:19:26] [INFO ] Deduced a trap composed of 16 places in 592 ms of which 8 ms to minimize.
[2024-05-31 21:19:26] [INFO ] Deduced a trap composed of 107 places in 486 ms of which 8 ms to minimize.
[2024-05-31 21:19:27] [INFO ] Deduced a trap composed of 129 places in 580 ms of which 8 ms to minimize.
[2024-05-31 21:19:28] [INFO ] Deduced a trap composed of 133 places in 568 ms of which 8 ms to minimize.
[2024-05-31 21:19:28] [INFO ] Deduced a trap composed of 113 places in 569 ms of which 7 ms to minimize.
[2024-05-31 21:19:29] [INFO ] Deduced a trap composed of 107 places in 574 ms of which 8 ms to minimize.
[2024-05-31 21:19:29] [INFO ] Deduced a trap composed of 115 places in 500 ms of which 6 ms to minimize.
[2024-05-31 21:19:30] [INFO ] Deduced a trap composed of 110 places in 490 ms of which 7 ms to minimize.
[2024-05-31 21:19:30] [INFO ] Deduced a trap composed of 18 places in 480 ms of which 7 ms to minimize.
[2024-05-31 21:19:31] [INFO ] Deduced a trap composed of 113 places in 488 ms of which 7 ms to minimize.
[2024-05-31 21:19:31] [INFO ] Deduced a trap composed of 107 places in 480 ms of which 7 ms to minimize.
[2024-05-31 21:19:32] [INFO ] Deduced a trap composed of 111 places in 481 ms of which 6 ms to minimize.
[2024-05-31 21:19:32] [INFO ] Deduced a trap composed of 107 places in 478 ms of which 9 ms to minimize.
[2024-05-31 21:19:33] [INFO ] Deduced a trap composed of 125 places in 497 ms of which 6 ms to minimize.
[2024-05-31 21:19:33] [INFO ] Deduced a trap composed of 109 places in 487 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/884 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 857 unsolved
[2024-05-31 21:19:35] [INFO ] Deduced a trap composed of 120 places in 486 ms of which 6 ms to minimize.
[2024-05-31 21:19:36] [INFO ] Deduced a trap composed of 107 places in 464 ms of which 7 ms to minimize.
[2024-05-31 21:19:36] [INFO ] Deduced a trap composed of 21 places in 425 ms of which 7 ms to minimize.
[2024-05-31 21:19:37] [INFO ] Deduced a trap composed of 103 places in 500 ms of which 7 ms to minimize.
SMT process timed out in 60582ms, After SMT, problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 60627ms
Starting structural reductions in LTL mode, iteration 1 : 884/1126 places, 858/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63314 ms. Remains : 884/1126 places, 858/1124 transitions.
Support contains 26 out of 884 places after structural reductions.
[2024-05-31 21:19:37] [INFO ] Flatten gal took : 164 ms
[2024-05-31 21:19:38] [INFO ] Flatten gal took : 108 ms
[2024-05-31 21:19:38] [INFO ] Input system was already deterministic with 858 transitions.
RANDOM walk for 40000 steps (72 resets) in 2699 ms. (14 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
[2024-05-31 21:19:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 347/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 463/824 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 60/884 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 858/1742 variables, 884/960 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1742 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1742 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1742/1742 variables, and 960 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 884/884 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 347/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 463/824 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:19:42] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-05-31 21:19:42] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-31 21:19:42] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-05-31 21:19:42] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 60/884 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:19:43] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 3 ms to minimize.
[2024-05-31 21:19:43] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 4 ms to minimize.
[2024-05-31 21:19:43] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2024-05-31 21:19:43] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-31 21:19:43] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 4 ms to minimize.
[2024-05-31 21:19:43] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 8 ms to minimize.
[2024-05-31 21:19:44] [INFO ] Deduced a trap composed of 67 places in 362 ms of which 6 ms to minimize.
[2024-05-31 21:19:44] [INFO ] Deduced a trap composed of 137 places in 304 ms of which 5 ms to minimize.
[2024-05-31 21:19:44] [INFO ] Deduced a trap composed of 138 places in 296 ms of which 5 ms to minimize.
[2024-05-31 21:19:45] [INFO ] Deduced a trap composed of 132 places in 303 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:19:45] [INFO ] Deduced a trap composed of 107 places in 187 ms of which 4 ms to minimize.
[2024-05-31 21:19:45] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/884 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 858/1742 variables, 884/976 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1742 variables, 8/984 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1742/1742 variables, and 984 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 884/884 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 16/16 constraints]
After SMT, in 6874ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 884/884 places, 858/858 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 303 rules applied. Total rules applied 303 place count 884 transition count 555
Reduce places removed 303 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 336 rules applied. Total rules applied 639 place count 581 transition count 522
Reduce places removed 22 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 27 rules applied. Total rules applied 666 place count 559 transition count 517
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 673 place count 554 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 674 place count 553 transition count 515
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 106 Pre rules applied. Total rules applied 674 place count 553 transition count 409
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 5 with 212 rules applied. Total rules applied 886 place count 447 transition count 409
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 888 place count 445 transition count 407
Iterating global reduction 5 with 2 rules applied. Total rules applied 890 place count 445 transition count 407
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 890 place count 445 transition count 406
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 892 place count 444 transition count 406
Performed 166 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 166 places in 1 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 5 with 332 rules applied. Total rules applied 1224 place count 278 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1225 place count 278 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1226 place count 278 transition count 216
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 1228 place count 277 transition count 215
Free-agglomeration rule applied 48 times.
Iterating global reduction 6 with 48 rules applied. Total rules applied 1276 place count 277 transition count 167
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1324 place count 229 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1325 place count 228 transition count 166
Reduce places removed 54 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 7 with 139 rules applied. Total rules applied 1464 place count 174 transition count 81
Reduce places removed 85 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 8 with 88 rules applied. Total rules applied 1552 place count 89 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1555 place count 86 transition count 78
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 18 Pre rules applied. Total rules applied 1555 place count 86 transition count 60
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1591 place count 68 transition count 60
Applied a total of 1591 rules in 226 ms. Remains 68 /884 variables (removed 816) and now considering 60/858 (removed 798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 68/884 places, 60/858 transitions.
RANDOM walk for 627 steps (0 resets) in 29 ms. (20 steps per ms) remains 0/8 properties
Computed a total of 218 stabilizing places and 218 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(!p1)||(!p1&&F(!p2)))))))'
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 874 transition count 848
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 97 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-31 21:19:47] [INFO ] Computed 76 invariants in 12 ms
[2024-05-31 21:19:47] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-31 21:19:47] [INFO ] Invariant cache hit.
[2024-05-31 21:19:48] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-31 21:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-31 21:20:17] [INFO ] Deduced a trap composed of 103 places in 571 ms of which 8 ms to minimize.
[2024-05-31 21:20:18] [INFO ] Deduced a trap composed of 17 places in 622 ms of which 8 ms to minimize.
[2024-05-31 21:20:19] [INFO ] Deduced a trap composed of 136 places in 625 ms of which 8 ms to minimize.
SMT process timed out in 30262ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30274ms
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31865 ms. Remains : 874/884 places, 848/858 transitions.
Stuttering acceptance computed with spot in 450 ms :[true, p2, (AND (NOT p0) p1), (AND p2 p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-02 finished in 32403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 874 transition count 848
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 98 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-31 21:20:19] [INFO ] Computed 76 invariants in 6 ms
[2024-05-31 21:20:20] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-31 21:20:20] [INFO ] Invariant cache hit.
[2024-05-31 21:20:21] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-31 21:20:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-31 21:20:50] [INFO ] Deduced a trap composed of 98 places in 670 ms of which 9 ms to minimize.
[2024-05-31 21:20:51] [INFO ] Deduced a trap composed of 15 places in 799 ms of which 8 ms to minimize.
[2024-05-31 21:20:51] [INFO ] Deduced a trap composed of 18 places in 784 ms of which 8 ms to minimize.
SMT process timed out in 30335ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30347ms
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32166 ms. Remains : 874/884 places, 848/858 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 405 ms.
Product exploration explored 100000 steps with 50000 reset in 395 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLCardinality-03 finished in 33117 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||G(p1)))))'
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 878 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 878 transition count 852
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 876 transition count 850
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 876 transition count 850
Applied a total of 16 rules in 87 ms. Remains 876 /884 variables (removed 8) and now considering 850/858 (removed 8) transitions.
// Phase 1: matrix 850 rows 876 cols
[2024-05-31 21:20:52] [INFO ] Computed 76 invariants in 8 ms
[2024-05-31 21:20:53] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-31 21:20:53] [INFO ] Invariant cache hit.
[2024-05-31 21:20:54] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-05-31 21:20:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/875 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/876 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/876 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-05-31 21:21:23] [INFO ] Deduced a trap composed of 35 places in 599 ms of which 9 ms to minimize.
[2024-05-31 21:21:23] [INFO ] Deduced a trap composed of 102 places in 580 ms of which 9 ms to minimize.
[2024-05-31 21:21:24] [INFO ] Deduced a trap composed of 16 places in 593 ms of which 8 ms to minimize.
[2024-05-31 21:21:25] [INFO ] Deduced a trap composed of 106 places in 586 ms of which 9 ms to minimize.
SMT process timed out in 30713ms, After SMT, problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 30723ms
Starting structural reductions in LTL mode, iteration 1 : 876/884 places, 850/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32301 ms. Remains : 876/884 places, 850/858 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-05 finished in 32450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1))))'
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 876 transition count 850
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 876 transition count 850
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 872 transition count 846
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 872 transition count 846
Applied a total of 24 rules in 103 ms. Remains 872 /884 variables (removed 12) and now considering 846/858 (removed 12) transitions.
// Phase 1: matrix 846 rows 872 cols
[2024-05-31 21:21:25] [INFO ] Computed 76 invariants in 7 ms
[2024-05-31 21:21:25] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-31 21:21:25] [INFO ] Invariant cache hit.
[2024-05-31 21:21:26] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1529 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2024-05-31 21:21:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (OVERLAPS) 1/872 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-05-31 21:21:56] [INFO ] Deduced a trap composed of 35 places in 713 ms of which 13 ms to minimize.
[2024-05-31 21:21:56] [INFO ] Deduced a trap composed of 100 places in 471 ms of which 7 ms to minimize.
[2024-05-31 21:21:57] [INFO ] Deduced a trap composed of 26 places in 470 ms of which 7 ms to minimize.
SMT process timed out in 30365ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30375ms
Starting structural reductions in LTL mode, iteration 1 : 872/884 places, 846/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32011 ms. Remains : 872/884 places, 846/858 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08
Product exploration explored 100000 steps with 597 reset in 373 ms.
Product exploration explored 100000 steps with 517 reset in 499 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 326 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (72 resets) in 431 ms. (92 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
[2024-05-31 21:21:59] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 250/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 556/809 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/872 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1718 variables, 872/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 948 constraints, problems are : Problem set: 0 solved, 1 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 872/872 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 250/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:21:59] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:22:00] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 556/809 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:22:00] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/872 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:22:00] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 5 ms to minimize.
[2024-05-31 21:22:00] [INFO ] Deduced a trap composed of 25 places in 350 ms of which 5 ms to minimize.
[2024-05-31 21:22:01] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 5 ms to minimize.
[2024-05-31 21:22:01] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 5 ms to minimize.
[2024-05-31 21:22:02] [INFO ] Deduced a trap composed of 35 places in 336 ms of which 6 ms to minimize.
[2024-05-31 21:22:02] [INFO ] Deduced a trap composed of 37 places in 342 ms of which 6 ms to minimize.
[2024-05-31 21:22:02] [INFO ] Deduced a trap composed of 35 places in 346 ms of which 6 ms to minimize.
[2024-05-31 21:22:03] [INFO ] Deduced a trap composed of 57 places in 316 ms of which 6 ms to minimize.
[2024-05-31 21:22:03] [INFO ] Deduced a trap composed of 77 places in 299 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/872 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 846/1718 variables, 872/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1718 variables, 1/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1718 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1718 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 961 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4125 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 4842ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 248 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=124 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 341 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 32 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-05-31 21:22:04] [INFO ] Invariant cache hit.
[2024-05-31 21:22:04] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-31 21:22:04] [INFO ] Invariant cache hit.
[2024-05-31 21:22:06] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2024-05-31 21:22:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (OVERLAPS) 1/872 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-05-31 21:22:35] [INFO ] Deduced a trap composed of 35 places in 560 ms of which 8 ms to minimize.
[2024-05-31 21:22:35] [INFO ] Deduced a trap composed of 100 places in 453 ms of which 6 ms to minimize.
[2024-05-31 21:22:36] [INFO ] Deduced a trap composed of 26 places in 468 ms of which 6 ms to minimize.
SMT process timed out in 30285ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30294ms
Finished structural reductions in LTL mode , in 1 iterations and 31948 ms. Remains : 872/872 places, 846/846 transitions.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 224 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (71 resets) in 240 ms. (165 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-05-31 21:22:36] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 250/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 556/809 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/872 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1718 variables, 872/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 948 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 872/872 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 250/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:22:37] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-31 21:22:37] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 556/809 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:22:38] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/872 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:22:38] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 6 ms to minimize.
[2024-05-31 21:22:38] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 5 ms to minimize.
[2024-05-31 21:22:39] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 5 ms to minimize.
[2024-05-31 21:22:39] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 6 ms to minimize.
[2024-05-31 21:22:39] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 5 ms to minimize.
[2024-05-31 21:22:40] [INFO ] Deduced a trap composed of 37 places in 309 ms of which 6 ms to minimize.
[2024-05-31 21:22:40] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 5 ms to minimize.
[2024-05-31 21:22:40] [INFO ] Deduced a trap composed of 57 places in 311 ms of which 5 ms to minimize.
[2024-05-31 21:22:41] [INFO ] Deduced a trap composed of 77 places in 308 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/872 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 846/1718 variables, 872/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1718 variables, 1/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1718 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1718 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 961 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3978 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 4649ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 250 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 387 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 590 reset in 254 ms.
Product exploration explored 100000 steps with 550 reset in 385 ms.
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 52 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-05-31 21:22:43] [INFO ] Invariant cache hit.
[2024-05-31 21:22:43] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-31 21:22:43] [INFO ] Invariant cache hit.
[2024-05-31 21:22:45] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2024-05-31 21:22:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (OVERLAPS) 1/872 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-05-31 21:23:13] [INFO ] Deduced a trap composed of 35 places in 570 ms of which 8 ms to minimize.
[2024-05-31 21:23:14] [INFO ] Deduced a trap composed of 100 places in 471 ms of which 7 ms to minimize.
[2024-05-31 21:23:14] [INFO ] Deduced a trap composed of 26 places in 469 ms of which 7 ms to minimize.
[2024-05-31 21:23:14] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 6 ms to minimize.
[2024-05-31 21:23:15] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 5 ms to minimize.
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30174ms
Finished structural reductions in LTL mode , in 1 iterations and 31845 ms. Remains : 872/872 places, 846/846 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 110187 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((p1||X(p2)))&&p0)))'
Support contains 5 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 878 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 878 transition count 852
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 874 transition count 848
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 182 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-31 21:23:15] [INFO ] Computed 76 invariants in 6 ms
[2024-05-31 21:23:16] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-05-31 21:23:16] [INFO ] Invariant cache hit.
[2024-05-31 21:23:17] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-31 21:23:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-31 21:23:45] [INFO ] Deduced a trap composed of 118 places in 616 ms of which 8 ms to minimize.
[2024-05-31 21:23:46] [INFO ] Deduced a trap composed of 115 places in 614 ms of which 8 ms to minimize.
[2024-05-31 21:23:47] [INFO ] Deduced a trap composed of 16 places in 599 ms of which 8 ms to minimize.
[2024-05-31 21:23:47] [INFO ] Deduced a trap composed of 105 places in 599 ms of which 9 ms to minimize.
SMT process timed out in 30443ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30452ms
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32333 ms. Remains : 874/884 places, 848/858 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-09 finished in 32555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 883 transition count 542
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 351 rules applied. Total rules applied 666 place count 568 transition count 506
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 690 place count 544 transition count 506
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 690 place count 544 transition count 402
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 898 place count 440 transition count 402
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 903 place count 435 transition count 397
Iterating global reduction 3 with 5 rules applied. Total rules applied 908 place count 435 transition count 397
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 908 place count 435 transition count 395
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 912 place count 433 transition count 395
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 1254 place count 262 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1255 place count 261 transition count 199
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 253 transition count 196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1269 place count 250 transition count 196
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1269 place count 250 transition count 191
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1279 place count 245 transition count 191
Applied a total of 1279 rules in 98 ms. Remains 245 /884 variables (removed 639) and now considering 191/858 (removed 667) transitions.
// Phase 1: matrix 191 rows 245 cols
[2024-05-31 21:23:48] [INFO ] Computed 68 invariants in 1 ms
[2024-05-31 21:23:48] [INFO ] Implicit Places using invariants in 251 ms returned [103, 141, 179, 185, 191, 197, 203, 209, 215, 221, 226, 231, 235, 239, 244]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 254 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/884 places, 191/858 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 178
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 216 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 216 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 215 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 215 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 214 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 214 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 213 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 213 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 212 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 212 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 211 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 211 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 210 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 210 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 209 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 209 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 208 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 208 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 207 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 207 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 206 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 206 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 205 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 205 transition count 166
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 0 with 2 rules applied. Total rules applied 52 place count 204 transition count 165
Applied a total of 52 rules in 65 ms. Remains 204 /230 variables (removed 26) and now considering 165/191 (removed 26) transitions.
// Phase 1: matrix 165 rows 204 cols
[2024-05-31 21:23:48] [INFO ] Computed 53 invariants in 0 ms
[2024-05-31 21:23:48] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-31 21:23:48] [INFO ] Invariant cache hit.
[2024-05-31 21:23:48] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-31 21:23:49] [INFO ] Implicit Places using invariants and state equation in 452 ms returned [85, 87, 89, 91, 93, 95, 97]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 636 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 197/884 places, 165/858 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 197 transition count 158
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 190 transition count 158
Applied a total of 14 rules in 11 ms. Remains 190 /197 variables (removed 7) and now considering 158/165 (removed 7) transitions.
// Phase 1: matrix 158 rows 190 cols
[2024-05-31 21:23:49] [INFO ] Computed 46 invariants in 1 ms
[2024-05-31 21:23:49] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-31 21:23:49] [INFO ] Invariant cache hit.
[2024-05-31 21:23:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 21:23:49] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 190/884 places, 158/858 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1759 ms. Remains : 190/884 places, 158/858 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-10
Product exploration explored 100000 steps with 33714 reset in 616 ms.
Product exploration explored 100000 steps with 33742 reset in 592 ms.
Computed a total of 12 stabilizing places and 3 stable transitions
Computed a total of 12 stabilizing places and 3 stable transitions
Detected a total of 12/190 stabilizing places and 3/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-31 21:23:51] [INFO ] Invariant cache hit.
[2024-05-31 21:23:51] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-05-31 21:23:51] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-05-31 21:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:51] [INFO ] [Nat]Absence check using 46 positive place invariants in 17 ms returned sat
[2024-05-31 21:23:52] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-05-31 21:23:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 21:23:52] [INFO ] [Nat]Added 45 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:23:52] [INFO ] Computed and/alt/rep : 143/358/143 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 21:23:52] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 158/158 transitions.
Applied a total of 0 rules in 9 ms. Remains 190 /190 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2024-05-31 21:23:52] [INFO ] Invariant cache hit.
[2024-05-31 21:23:52] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-31 21:23:52] [INFO ] Invariant cache hit.
[2024-05-31 21:23:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 21:23:52] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-31 21:23:52] [INFO ] Redundant transitions in 5 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-31 21:23:52] [INFO ] Invariant cache hit.
[2024-05-31 21:23:52] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 2/190 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-31 21:23:54] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 158/348 variables, 190/237 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 45/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 282 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9371 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 190/190 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 2/190 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 158/348 variables, 190/237 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 45/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 143/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 425 constraints, problems are : Problem set: 0 solved, 143 unsolved in 10983 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 190/190 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
After SMT, in 20392ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 20394ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21051 ms. Remains : 190/190 places, 158/158 transitions.
Computed a total of 12 stabilizing places and 3 stable transitions
Computed a total of 12 stabilizing places and 3 stable transitions
Detected a total of 12/190 stabilizing places and 3/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-31 21:24:13] [INFO ] Invariant cache hit.
[2024-05-31 21:24:13] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-05-31 21:24:14] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-05-31 21:24:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:14] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-05-31 21:24:14] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-05-31 21:24:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 21:24:14] [INFO ] [Nat]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:24:14] [INFO ] Computed and/alt/rep : 143/358/143 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-31 21:24:14] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33704 reset in 473 ms.
Product exploration explored 100000 steps with 33678 reset in 491 ms.
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 158/158 transitions.
Applied a total of 0 rules in 7 ms. Remains 190 /190 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2024-05-31 21:24:15] [INFO ] Invariant cache hit.
[2024-05-31 21:24:15] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-31 21:24:15] [INFO ] Invariant cache hit.
[2024-05-31 21:24:15] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 21:24:16] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-31 21:24:16] [INFO ] Redundant transitions in 5 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-31 21:24:16] [INFO ] Invariant cache hit.
[2024-05-31 21:24:16] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 2/190 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-31 21:24:18] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 158/348 variables, 190/237 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 45/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 282 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9730 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 190/190 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 2/190 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 158/348 variables, 190/237 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 45/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 143/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 425 constraints, problems are : Problem set: 0 solved, 143 unsolved in 10961 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 190/190 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
After SMT, in 20727ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 20729ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21405 ms. Remains : 190/190 places, 158/158 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-10 finished in 49105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(F(p0))))))))'
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 876 transition count 850
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 876 transition count 850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 873 transition count 847
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 873 transition count 847
Applied a total of 22 rules in 89 ms. Remains 873 /884 variables (removed 11) and now considering 847/858 (removed 11) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-31 21:24:37] [INFO ] Computed 76 invariants in 18 ms
[2024-05-31 21:24:37] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-31 21:24:37] [INFO ] Invariant cache hit.
[2024-05-31 21:24:38] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-31 21:24:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-31 21:25:09] [INFO ] Deduced a trap composed of 88 places in 594 ms of which 8 ms to minimize.
SMT process timed out in 30321ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30332ms
Starting structural reductions in LTL mode, iteration 1 : 873/884 places, 847/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32007 ms. Remains : 873/884 places, 847/858 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-11
Product exploration explored 100000 steps with 14285 reset in 147 ms.
Product exploration explored 100000 steps with 14285 reset in 161 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (72 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 351631 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 351631 steps, saw 87227 distinct states, run finished after 3007 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-31 21:25:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 739/810 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 1 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 739/810 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:25:14] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
[2024-05-31 21:25:14] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/873 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 847/1720 variables, 873/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1720 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1720 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1732ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 192 ms.
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 847/847 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 873 transition count 533
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 664 place count 559 transition count 497
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 688 place count 535 transition count 497
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 688 place count 535 transition count 394
Deduced a syphon composed of 103 places in 0 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 894 place count 432 transition count 394
Performed 172 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 1238 place count 260 transition count 198
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 48 times.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1286 place count 260 transition count 150
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1334 place count 212 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1335 place count 211 transition count 149
Reduce places removed 59 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 4 with 159 rules applied. Total rules applied 1494 place count 152 transition count 49
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 1594 place count 52 transition count 49
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1594 place count 52 transition count 33
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1626 place count 36 transition count 33
Applied a total of 1626 rules in 80 ms. Remains 36 /873 variables (removed 837) and now considering 33/847 (removed 814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 36/873 places, 33/847 transitions.
RANDOM walk for 208 steps (0 resets) in 4 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 225 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 32 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-31 21:25:15] [INFO ] Invariant cache hit.
[2024-05-31 21:25:16] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-31 21:25:16] [INFO ] Invariant cache hit.
[2024-05-31 21:25:17] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-31 21:25:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-31 21:25:46] [INFO ] Deduced a trap composed of 88 places in 576 ms of which 9 ms to minimize.
[2024-05-31 21:25:47] [INFO ] Deduced a trap composed of 15 places in 569 ms of which 8 ms to minimize.
[2024-05-31 21:25:48] [INFO ] Deduced a trap composed of 35 places in 567 ms of which 8 ms to minimize.
SMT process timed out in 30500ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30511ms
Finished structural reductions in LTL mode , in 1 iterations and 32136 ms. Remains : 873/873 places, 847/847 transitions.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (72 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 378952 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 378952 steps, saw 91117 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2024-05-31 21:25:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 739/810 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 739/810 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:25:52] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 3 ms to minimize.
[2024-05-31 21:25:52] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/873 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 847/1720 variables, 873/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1720 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1720 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 148 ms.
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 847/847 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 873 transition count 533
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 664 place count 559 transition count 497
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 688 place count 535 transition count 497
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 688 place count 535 transition count 394
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 894 place count 432 transition count 394
Performed 172 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 1238 place count 260 transition count 198
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 48 times.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1286 place count 260 transition count 150
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1334 place count 212 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1335 place count 211 transition count 149
Reduce places removed 59 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 4 with 159 rules applied. Total rules applied 1494 place count 152 transition count 49
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 1594 place count 52 transition count 49
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1594 place count 52 transition count 33
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1626 place count 36 transition count 33
Applied a total of 1626 rules in 86 ms. Remains 36 /873 variables (removed 837) and now considering 33/847 (removed 814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 36/873 places, 33/847 transitions.
RANDOM walk for 82 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 237 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 511 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 143 ms.
Product exploration explored 100000 steps with 14285 reset in 155 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 873 transition count 847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 302 place count 873 transition count 835
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 302 place count 873 transition count 835
Deduced a syphon composed of 404 places in 1 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 416 place count 873 transition count 835
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 655 place count 634 transition count 596
Deduced a syphon composed of 165 places in 2 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 894 place count 634 transition count 596
Performed 209 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 374 places in 1 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1103 place count 634 transition count 572
Renaming transitions due to excessive name length > 1024 char.
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 1237 place count 500 transition count 438
Deduced a syphon composed of 240 places in 0 ms
Iterating global reduction 2 with 134 rules applied. Total rules applied 1371 place count 500 transition count 438
Deduced a syphon composed of 240 places in 0 ms
Applied a total of 1371 rules in 272 ms. Remains 500 /873 variables (removed 373) and now considering 438/847 (removed 409) transitions.
[2024-05-31 21:25:55] [INFO ] Redundant transitions in 28 ms returned []
Running 437 sub problems to find dead transitions.
// Phase 1: matrix 438 rows 500 cols
[2024-05-31 21:25:55] [INFO ] Computed 76 invariants in 6 ms
[2024-05-31 21:25:55] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-31 21:26:09] [INFO ] Deduced a trap composed of 2 places in 262 ms of which 4 ms to minimize.
[2024-05-31 21:26:09] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 5 ms to minimize.
[2024-05-31 21:26:09] [INFO ] Deduced a trap composed of 2 places in 233 ms of which 4 ms to minimize.
[2024-05-31 21:26:10] [INFO ] Deduced a trap composed of 2 places in 225 ms of which 3 ms to minimize.
[2024-05-31 21:26:10] [INFO ] Deduced a trap composed of 2 places in 230 ms of which 4 ms to minimize.
[2024-05-31 21:26:10] [INFO ] Deduced a trap composed of 2 places in 225 ms of which 3 ms to minimize.
[2024-05-31 21:26:10] [INFO ] Deduced a trap composed of 2 places in 240 ms of which 4 ms to minimize.
[2024-05-31 21:26:11] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 4 ms to minimize.
[2024-05-31 21:26:11] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 4 ms to minimize.
[2024-05-31 21:26:11] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 3 ms to minimize.
[2024-05-31 21:26:11] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 4 ms to minimize.
[2024-05-31 21:26:12] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 4 ms to minimize.
[2024-05-31 21:26:12] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 4 ms to minimize.
[2024-05-31 21:26:12] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:26:12] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 21:26:12] [INFO ] Deduced a trap composed of 2 places in 134 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-31 21:26:12] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 134 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/96 constraints. Problems are: Problem set: 92 solved, 345 unsolved
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 5 ms to minimize.
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-31 21:26:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-31 21:26:14] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 20/116 constraints. Problems are: Problem set: 129 solved, 308 unsolved
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-31 21:26:15] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-31 21:26:16] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-31 21:26:17] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-31 21:26:17] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 20/136 constraints. Problems are: Problem set: 168 solved, 269 unsolved
[2024-05-31 21:26:20] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-31 21:26:20] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-31 21:26:20] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-31 21:26:21] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 16/152 constraints. Problems are: Problem set: 240 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/152 constraints. Problems are: Problem set: 240 solved, 197 unsolved
SMT process timed out in 30363ms, After SMT, problems are : Problem set: 240 solved, 197 unsolved
Search for dead transitions found 240 dead transitions in 30372ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 500/873 places, 198/847 transitions.
Graph (complete) has 679 edges and 500 vertex of which 260 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.2 ms
Discarding 240 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 260 /500 variables (removed 240) and now considering 198/198 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 260/873 places, 198/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30727 ms. Remains : 260/873 places, 198/847 transitions.
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 28 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-31 21:26:26] [INFO ] Computed 76 invariants in 4 ms
[2024-05-31 21:26:26] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-31 21:26:26] [INFO ] Invariant cache hit.
[2024-05-31 21:26:27] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-31 21:26:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-31 21:26:58] [INFO ] Deduced a trap composed of 88 places in 564 ms of which 19 ms to minimize.
SMT process timed out in 30388ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30396ms
Finished structural reductions in LTL mode , in 1 iterations and 32242 ms. Remains : 873/873 places, 847/847 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-11 finished in 141214 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(X(G(F((!(p0 U p1)||X(p2))))))||G(X(p0))))'
Support contains 6 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 873 transition count 847
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 873 transition count 847
Applied a total of 22 rules in 94 ms. Remains 873 /884 variables (removed 11) and now considering 847/858 (removed 11) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-31 21:26:58] [INFO ] Computed 76 invariants in 3 ms
[2024-05-31 21:26:59] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-31 21:26:59] [INFO ] Invariant cache hit.
[2024-05-31 21:27:00] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-31 21:27:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 873/1720 variables, and 76 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 846 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-31 21:27:45] [INFO ] Deduced a trap composed of 25 places in 567 ms of which 8 ms to minimize.
[2024-05-31 21:27:46] [INFO ] Deduced a trap composed of 19 places in 584 ms of which 8 ms to minimize.
[2024-05-31 21:27:46] [INFO ] Deduced a trap composed of 35 places in 586 ms of which 8 ms to minimize.
[2024-05-31 21:27:47] [INFO ] Deduced a trap composed of 127 places in 564 ms of which 8 ms to minimize.
[2024-05-31 21:27:48] [INFO ] Deduced a trap composed of 17 places in 655 ms of which 8 ms to minimize.
[2024-05-31 21:27:48] [INFO ] Deduced a trap composed of 108 places in 543 ms of which 8 ms to minimize.
[2024-05-31 21:27:49] [INFO ] Deduced a trap composed of 18 places in 545 ms of which 8 ms to minimize.
[2024-05-31 21:27:49] [INFO ] Deduced a trap composed of 110 places in 544 ms of which 8 ms to minimize.
[2024-05-31 21:27:50] [INFO ] Deduced a trap composed of 99 places in 528 ms of which 8 ms to minimize.
[2024-05-31 21:27:50] [INFO ] Deduced a trap composed of 19 places in 556 ms of which 7 ms to minimize.
[2024-05-31 21:27:51] [INFO ] Deduced a trap composed of 106 places in 539 ms of which 8 ms to minimize.
[2024-05-31 21:27:52] [INFO ] Deduced a trap composed of 105 places in 537 ms of which 7 ms to minimize.
[2024-05-31 21:27:52] [INFO ] Deduced a trap composed of 21 places in 525 ms of which 7 ms to minimize.
[2024-05-31 21:27:53] [INFO ] Deduced a trap composed of 119 places in 534 ms of which 7 ms to minimize.
[2024-05-31 21:27:53] [INFO ] Deduced a trap composed of 112 places in 532 ms of which 8 ms to minimize.
[2024-05-31 21:27:54] [INFO ] Deduced a trap composed of 138 places in 438 ms of which 6 ms to minimize.
[2024-05-31 21:27:54] [INFO ] Deduced a trap composed of 109 places in 427 ms of which 6 ms to minimize.
[2024-05-31 21:27:55] [INFO ] Deduced a trap composed of 109 places in 427 ms of which 6 ms to minimize.
[2024-05-31 21:27:55] [INFO ] Deduced a trap composed of 22 places in 420 ms of which 6 ms to minimize.
[2024-05-31 21:27:56] [INFO ] Deduced a trap composed of 103 places in 408 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/873 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-31 21:27:57] [INFO ] Deduced a trap composed of 25 places in 495 ms of which 7 ms to minimize.
[2024-05-31 21:27:58] [INFO ] Deduced a trap composed of 23 places in 493 ms of which 7 ms to minimize.
[2024-05-31 21:27:58] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 7 ms to minimize.
[2024-05-31 21:27:59] [INFO ] Deduced a trap composed of 29 places in 511 ms of which 7 ms to minimize.
[2024-05-31 21:27:59] [INFO ] Deduced a trap composed of 29 places in 496 ms of which 7 ms to minimize.
[2024-05-31 21:28:00] [INFO ] Deduced a trap composed of 129 places in 487 ms of which 7 ms to minimize.
SMT process timed out in 60274ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 873/884 places, 847/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62124 ms. Remains : 873/884 places, 847/858 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-15
Product exploration explored 100000 steps with 182 reset in 471 ms.
Product exploration explored 100000 steps with 181 reset in 327 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 221 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (72 resets) in 303 ms. (131 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
[2024-05-31 21:28:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 267/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 539/812 variables, 70/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/812 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 4 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 267/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:28:03] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 539/812 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:28:03] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 3 ms to minimize.
[2024-05-31 21:28:03] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-31 21:28:03] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/812 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 61/873 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:28:04] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 5 ms to minimize.
[2024-05-31 21:28:04] [INFO ] Deduced a trap composed of 115 places in 308 ms of which 5 ms to minimize.
[2024-05-31 21:28:05] [INFO ] Deduced a trap composed of 119 places in 306 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/873 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/873 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 847/1720 variables, 873/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 4/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1720 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1720 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 960 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2816 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 3772ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 5033 steps, including 9 resets, run visited all 4 properties in 99 ms. (steps per millisecond=50 )
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 4 properties in 101 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 358 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 872 transition count 539
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 343 rules applied. Total rules applied 650 place count 565 transition count 503
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 676 place count 541 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 539 transition count 501
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 678 place count 539 transition count 397
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 886 place count 435 transition count 397
Performed 171 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1228 place count 264 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1229 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1230 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 34 rules applied. Total rules applied 1264 place count 240 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1275 place count 229 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1275 place count 229 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1299 place count 217 transition count 178
Applied a total of 1299 rules in 84 ms. Remains 217 /873 variables (removed 656) and now considering 178/847 (removed 669) transitions.
// Phase 1: matrix 178 rows 217 cols
[2024-05-31 21:28:06] [INFO ] Computed 53 invariants in 1 ms
[2024-05-31 21:28:07] [INFO ] Implicit Places using invariants in 362 ms returned [88, 126, 164, 174, 178, 182, 186, 190, 194, 198, 203, 207, 211, 216]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 365 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/873 places, 178/847 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 191 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 177 transition count 152
Applied a total of 52 rules in 40 ms. Remains 177 /203 variables (removed 26) and now considering 152/178 (removed 26) transitions.
// Phase 1: matrix 152 rows 177 cols
[2024-05-31 21:28:07] [INFO ] Computed 39 invariants in 1 ms
[2024-05-31 21:28:07] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-31 21:28:07] [INFO ] Invariant cache hit.
[2024-05-31 21:28:07] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/873 places, 152/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 905 ms. Remains : 177/873 places, 152/847 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 9 factoid took 477 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 22829 steps (492 resets) in 405 ms. (56 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 544 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering criterion allowed to conclude after 15409 steps with 334 reset in 53 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-15 finished in 71248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1))))'
Found a Shortening insensitive property : AutoFlight-PT-12b-LTLCardinality-08
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 883 transition count 550
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 343 rules applied. Total rules applied 650 place count 576 transition count 514
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 676 place count 552 transition count 512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 550 transition count 512
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 678 place count 550 transition count 405
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 892 place count 443 transition count 405
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 897 place count 438 transition count 400
Iterating global reduction 4 with 5 rules applied. Total rules applied 902 place count 438 transition count 400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 902 place count 438 transition count 398
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 906 place count 436 transition count 398
Performed 169 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1244 place count 267 transition count 205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1245 place count 266 transition count 204
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1277 place count 244 transition count 194
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1287 place count 234 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1287 place count 234 transition count 182
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1311 place count 222 transition count 182
Applied a total of 1311 rules in 66 ms. Remains 222 /884 variables (removed 662) and now considering 182/858 (removed 676) transitions.
// Phase 1: matrix 182 rows 222 cols
[2024-05-31 21:28:09] [INFO ] Computed 54 invariants in 2 ms
[2024-05-31 21:28:10] [INFO ] Implicit Places using invariants in 275 ms returned [90, 128, 166, 170, 174, 184, 188, 192, 196, 201, 206, 216, 221]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 276 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 209/884 places, 182/858 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 198 transition count 171
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 198 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 197 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 197 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 196 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 196 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 195 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 195 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 194 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 194 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 193 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 193 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 192 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 192 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 191 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 191 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 190 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 190 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 189 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 189 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 188 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 188 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 187 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 187 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 186 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 186 transition count 159
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 183 transition count 156
Applied a total of 52 rules in 34 ms. Remains 183 /209 variables (removed 26) and now considering 156/182 (removed 26) transitions.
// Phase 1: matrix 156 rows 183 cols
[2024-05-31 21:28:10] [INFO ] Computed 41 invariants in 2 ms
[2024-05-31 21:28:10] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-31 21:28:10] [INFO ] Invariant cache hit.
[2024-05-31 21:28:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:28:10] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 183/884 places, 156/858 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 966 ms. Remains : 183/884 places, 156/858 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08
Product exploration explored 100000 steps with 4301 reset in 386 ms.
Product exploration explored 100000 steps with 4365 reset in 482 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/183 stabilizing places and 6/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 458 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 706 steps (12 resets) in 8 ms. (78 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 566 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 183 /183 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-31 21:28:13] [INFO ] Invariant cache hit.
[2024-05-31 21:28:13] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-31 21:28:13] [INFO ] Invariant cache hit.
[2024-05-31 21:28:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:28:13] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-31 21:28:13] [INFO ] Invariant cache hit.
[2024-05-31 21:28:13] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-31 21:28:14] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/183 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 156/339 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 227 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3974 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 183/183 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/183 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 156/339 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 95/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/339 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6244 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 183/183 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
After SMT, in 10255ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 10256ms
Finished structural reductions in LTL mode , in 1 iterations and 10699 ms. Remains : 183/183 places, 156/156 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/183 stabilizing places and 6/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 613 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 555 steps (9 resets) in 7 ms. (69 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 553 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4199 reset in 331 ms.
Product exploration explored 100000 steps with 4206 reset in 394 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 183 /183 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-31 21:28:26] [INFO ] Invariant cache hit.
[2024-05-31 21:28:26] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-31 21:28:26] [INFO ] Invariant cache hit.
[2024-05-31 21:28:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:28:26] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-31 21:28:26] [INFO ] Invariant cache hit.
[2024-05-31 21:28:26] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-31 21:28:27] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/183 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 156/339 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 227 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3921 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 183/183 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/183 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 156/339 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 95/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/339 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6420 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 183/183 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
After SMT, in 10361ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 10362ms
Finished structural reductions in LTL mode , in 1 iterations and 10830 ms. Remains : 183/183 places, 156/156 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 27640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(F(p0))))))))'
Found a Shortening insensitive property : AutoFlight-PT-12b-LTLCardinality-11
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 883 transition count 543
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 664 place count 569 transition count 507
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 689 place count 545 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 544 transition count 506
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 690 place count 544 transition count 401
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 900 place count 439 transition count 401
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 904 place count 435 transition count 397
Iterating global reduction 4 with 4 rules applied. Total rules applied 908 place count 435 transition count 397
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 908 place count 435 transition count 395
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 912 place count 433 transition count 395
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1254 place count 262 transition count 200
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1255 place count 261 transition count 199
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1287 place count 239 transition count 189
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1297 place count 229 transition count 189
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1297 place count 229 transition count 177
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1321 place count 217 transition count 177
Applied a total of 1321 rules in 85 ms. Remains 217 /884 variables (removed 667) and now considering 177/858 (removed 681) transitions.
// Phase 1: matrix 177 rows 217 cols
[2024-05-31 21:28:37] [INFO ] Computed 54 invariants in 1 ms
[2024-05-31 21:28:38] [INFO ] Implicit Places using invariants in 296 ms returned [89, 127, 165, 169, 173, 177, 181, 185, 189, 193, 198, 203, 207, 211, 216]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 297 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 202/884 places, 177/858 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 189 transition count 164
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 189 transition count 164
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 0 with 2 rules applied. Total rules applied 28 place count 188 transition count 163
Applied a total of 28 rules in 8 ms. Remains 188 /202 variables (removed 14) and now considering 163/177 (removed 14) transitions.
// Phase 1: matrix 163 rows 188 cols
[2024-05-31 21:28:38] [INFO ] Computed 39 invariants in 1 ms
[2024-05-31 21:28:38] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-31 21:28:38] [INFO ] Invariant cache hit.
[2024-05-31 21:28:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:28:38] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 188/884 places, 163/858 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1018 ms. Remains : 188/884 places, 163/858 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-11
Product exploration explored 100000 steps with 14285 reset in 631 ms.
Product exploration explored 100000 steps with 14285 reset in 526 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (933 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (36 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1181549 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :0 out of 1
Probabilistic random walk after 1181549 steps, saw 137954 distinct states, run finished after 3001 ms. (steps per millisecond=393 ) properties seen :0
[2024-05-31 21:28:43] [INFO ] Invariant cache hit.
[2024-05-31 21:28:43] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/48 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/141 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:28:43] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/225 variables, 96/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 126/351 variables, 82/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 36/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/351 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/48 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 93/141 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/225 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 126/351 variables, 82/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 36/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/351 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/351 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-31 21:28:44] [INFO ] Invariant cache hit.
[2024-05-31 21:28:44] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-31 21:28:44] [INFO ] Invariant cache hit.
[2024-05-31 21:28:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:28:45] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-31 21:28:45] [INFO ] Invariant cache hit.
[2024-05-31 21:28:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-31 21:28:46] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-31 21:28:46] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 163/351 variables, 188/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-31 21:28:50] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/351 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 232 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9587 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 163/351 variables, 188/230 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 101/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 333 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7321 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 16924ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 16926ms
Finished structural reductions in LTL mode , in 1 iterations and 17585 ms. Remains : 188/188 places, 163/163 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (918 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (36 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1253658 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 1
Probabilistic random walk after 1253658 steps, saw 146142 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
[2024-05-31 21:29:05] [INFO ] Invariant cache hit.
[2024-05-31 21:29:05] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/48 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/141 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:29:05] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/225 variables, 96/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 126/351 variables, 82/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 36/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/351 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/48 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 93/141 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/225 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 126/351 variables, 82/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 36/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/351 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/351 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 390ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 346 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 692 ms.
Product exploration explored 100000 steps with 14285 reset in 547 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 163/163 transitions.
Applied a total of 0 rules in 6 ms. Remains 188 /188 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-31 21:29:08] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-31 21:29:08] [INFO ] Invariant cache hit.
[2024-05-31 21:29:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-31 21:29:10] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-31 21:29:10] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 163/351 variables, 188/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-31 21:29:14] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/351 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 232 constraints, problems are : Problem set: 0 solved, 101 unsolved in 10362 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 163/351 variables, 188/230 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 101/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 333 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8357 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 18739ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 18742ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18758 ms. Remains : 188/188 places, 163/163 transitions.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-31 21:29:27] [INFO ] Invariant cache hit.
[2024-05-31 21:29:27] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-31 21:29:27] [INFO ] Invariant cache hit.
[2024-05-31 21:29:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:29:28] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-31 21:29:28] [INFO ] Invariant cache hit.
[2024-05-31 21:29:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-31 21:29:30] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-05-31 21:29:30] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 163/351 variables, 188/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-31 21:29:34] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/351 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 232 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9835 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 163/351 variables, 188/230 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 101/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 333 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6984 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 16839ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 16841ms
Finished structural reductions in LTL mode , in 1 iterations and 17568 ms. Remains : 188/188 places, 163/163 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-11 finished in 67787 ms.
[2024-05-31 21:29:45] [INFO ] Flatten gal took : 73 ms
[2024-05-31 21:29:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-31 21:29:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 884 places, 858 transitions and 2086 arcs took 20 ms.
Total runtime 671946 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : AutoFlight-PT-12b-LTLCardinality-08
FORMULA AutoFlight-PT-12b-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-12b-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717193316552

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-12b-LTLCardinality-08
ltl formula formula --ltl=/tmp/2935/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 884 places, 858 transitions and 2086 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.060 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2935/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2935/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2935/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2935/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 885 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 885, there are 888 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~570 levels ~10000 states ~54904 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~20000 states ~108856 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~40000 states ~218252 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~80000 states ~439652 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~160000 states ~941852 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~320000 states ~1961996 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~640000 states ~4225224 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~1280000 states ~8753032 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~2560000 states ~18157456 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~5120000 states ~38860948 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~10240000 states ~80050628 transitions
pnml2lts-mc( 0/ 4): ~573 levels ~20480000 states ~168281400 transitions
ltl formula name AutoFlight-PT-12b-LTLCardinality-10
ltl formula formula --ltl=/tmp/2935/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 884 places, 858 transitions and 2086 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.030 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2935/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2935/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2935/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2935/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 886 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 885, there are 860 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~227 levels ~10000 states ~22040 transitions
pnml2lts-mc( 0/ 4): ~227 levels ~20000 states ~45364 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~40000 states ~79556 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~80000 states ~175000 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~160000 states ~366612 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~320000 states ~808748 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~640000 states ~1694556 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~1280000 states ~3702264 transitions
pnml2lts-mc( 0/ 4): ~227 levels ~2560000 states ~8159740 transitions
pnml2lts-mc( 0/ 4): ~227 levels ~5120000 states ~17294516 transitions
pnml2lts-mc( 0/ 4): ~227 levels ~10240000 states ~35472692 transitions
pnml2lts-mc( 3/ 4): ~227 levels ~20480000 states ~71578148 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33548530
pnml2lts-mc( 0/ 4): unique states count: 33549256
pnml2lts-mc( 0/ 4): unique transitions count: 124223723
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 90669297
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33549272
pnml2lts-mc( 0/ 4): - cum. max stack depth: 897
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33549272 states 124223752 transitions, fanout: 3.703
pnml2lts-mc( 0/ 4): Total exploration time 1139.850 sec (1139.830 sec minimum, 1139.837 sec on average)
pnml2lts-mc( 0/ 4): States per second: 29433, Transitions per second: 108983
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 266.1MB, 8.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/15.0%
pnml2lts-mc( 0/ 4): Stored 870 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 266.1MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-12b-LTLCardinality-11
ltl formula formula --ltl=/tmp/2935/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 884 places, 858 transitions and 2086 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2935/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2935/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2935/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2935/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 886 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 885, there are 866 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 18
pnml2lts-mc( 0/ 4): unique states count: 18
pnml2lts-mc( 0/ 4): unique transitions count: 22
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 42
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 42 states 68 transitions, fanout: 1.619
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 100.9 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 870 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-12b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167100163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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