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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 1.6M 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 AutonomousCar-PT-10b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716362484276

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 07:21:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 07:21:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:21:27] [INFO ] Load time of PNML (sax parser for PT used): 663 ms
[2024-05-22 07:21:27] [INFO ] Transformed 425 places.
[2024-05-22 07:21:27] [INFO ] Transformed 2252 transitions.
[2024-05-22 07:21:27] [INFO ] Found NUPN structural information;
[2024-05-22 07:21:27] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 966 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-10b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 364 transition count 2191
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 364 transition count 2191
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 522 place count 364 transition count 1791
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 533 place count 353 transition count 1780
Iterating global reduction 1 with 11 rules applied. Total rules applied 544 place count 353 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 545 place count 352 transition count 1779
Iterating global reduction 1 with 1 rules applied. Total rules applied 546 place count 352 transition count 1779
Applied a total of 546 rules in 259 ms. Remains 352 /425 variables (removed 73) and now considering 1779/2252 (removed 473) transitions.
// Phase 1: matrix 1779 rows 352 cols
[2024-05-22 07:21:28] [INFO ] Computed 15 invariants in 77 ms
[2024-05-22 07:21:29] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-22 07:21:29] [INFO ] Invariant cache hit.
[2024-05-22 07:21:30] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
Running 1778 sub problems to find dead transitions.
[2024-05-22 07:21:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1778 unsolved
SMT process timed out in 57997ms, After SMT, problems are : Problem set: 0 solved, 1778 unsolved
Search for dead transitions found 0 dead transitions in 58104ms
Starting structural reductions in LTL mode, iteration 1 : 352/425 places, 1779/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60295 ms. Remains : 352/425 places, 1779/2252 transitions.
Support contains 45 out of 352 places after structural reductions.
[2024-05-22 07:22:29] [INFO ] Flatten gal took : 521 ms
[2024-05-22 07:22:29] [INFO ] Flatten gal took : 320 ms
[2024-05-22 07:22:30] [INFO ] Input system was already deterministic with 1779 transitions.
Support contains 44 out of 352 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (308 resets) in 3333 ms. (11 steps per ms) remains 29/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
[2024-05-22 07:22:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 283/320 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 32/352 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1779/2131 variables, 352/367 constraints. Problems are: Problem set: 2 solved, 27 unsolved
[2024-05-22 07:22:36] [INFO ] Deduced a trap composed of 21 places in 693 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2131 variables, 1/368 constraints. Problems are: Problem set: 2 solved, 27 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 Real declared 2131/2131 variables, and 368 constraints, problems are : Problem set: 2 solved, 27 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 29/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 285/320 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 32/352 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/16 constraints. Problems are: Problem set: 2 solved, 27 unsolved
[2024-05-22 07:22:41] [INFO ] Deduced a trap composed of 50 places in 1045 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 27 unsolved
SMT process timed out in 10722ms, After SMT, problems are : Problem set: 2 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 283 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1867 edges and 350 vertex of which 348 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.59 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 348 transition count 1647
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 222 transition count 1588
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 187 transition count 1588
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 350 place count 187 transition count 1581
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 364 place count 180 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 365 place count 179 transition count 1580
Iterating global reduction 3 with 1 rules applied. Total rules applied 366 place count 179 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 367 place count 178 transition count 1570
Iterating global reduction 3 with 1 rules applied. Total rules applied 368 place count 178 transition count 1570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 370 place count 178 transition count 1568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 371 place count 177 transition count 1568
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 481 place count 122 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 482 place count 122 transition count 1512
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 489 place count 115 transition count 1451
Iterating global reduction 6 with 7 rules applied. Total rules applied 496 place count 115 transition count 1451
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 502 place count 115 transition count 1445
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 504 place count 114 transition count 1444
Free-agglomeration rule applied 23 times.
Iterating global reduction 7 with 23 rules applied. Total rules applied 527 place count 114 transition count 1421
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 550 place count 91 transition count 1421
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 560 place count 91 transition count 1411
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 568 place count 91 transition count 1411
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 569 place count 90 transition count 1410
Applied a total of 569 rules in 1153 ms. Remains 90 /352 variables (removed 262) and now considering 1410/1779 (removed 369) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1154 ms. Remains : 90/352 places, 1410/1779 transitions.
RANDOM walk for 40000 steps (273 resets) in 1782 ms. (22 steps per ms) remains 16/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 9/9 properties
// Phase 1: matrix 1410 rows 90 cols
[2024-05-22 07:22:44] [INFO ] Computed 15 invariants in 16 ms
[2024-05-22 07:22:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 57/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1407/1492 variables, 85/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1492 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 8/1500 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1500 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1500 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1500 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/1500 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1500/1500 variables, and 106 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2655 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 57/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1407/1492 variables, 85/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1492 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 8/1500 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1500 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1500 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1500 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/1500 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1500/1500 variables, and 106 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2322 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5252ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 6455 ms.
Support contains 28 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1410/1410 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 87 transition count 1407
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 87 transition count 1406
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 86 transition count 1396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 85 transition count 1395
Applied a total of 19 rules in 237 ms. Remains 85 /90 variables (removed 5) and now considering 1395/1410 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 85/90 places, 1395/1410 transitions.
RANDOM walk for 40000 steps (183 resets) in 1417 ms. (28 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (20 resets) in 137 ms. (289 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (57 resets) in 133 ms. (298 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (128 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (65 resets) in 116 ms. (341 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (66 resets) in 115 ms. (344 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
// Phase 1: matrix 1395 rows 85 cols
[2024-05-22 07:22:57] [INFO ] Computed 15 invariants in 12 ms
[2024-05-22 07:22:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/80 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1392/1472 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1472 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/1480 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1480 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1480 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1480/1480 variables, and 101 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1285 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/80 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1392/1472 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1472 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/1480 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1480 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1480 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1480/1480 variables, and 101 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1222 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2606ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1968 ms.
Support contains 16 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1395/1395 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 79 transition count 1379
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 79 transition count 1379
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 75 transition count 1375
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 75 transition count 1374
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 32 place count 74 transition count 1364
Applied a total of 32 rules in 239 ms. Remains 74 /85 variables (removed 11) and now considering 1364/1395 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 74/85 places, 1364/1395 transitions.
RANDOM walk for 40000 steps (96 resets) in 1409 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (133 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (152 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 268257 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 3
Probabilistic random walk after 268257 steps, saw 41404 distinct states, run finished after 3010 ms. (steps per millisecond=89 ) properties seen :0
// Phase 1: matrix 1364 rows 74 cols
[2024-05-22 07:23:05] [INFO ] Computed 15 invariants in 9 ms
[2024-05-22 07:23:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/69 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1361/1430 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/1438 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1438 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1438 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1438 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1438 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1438/1438 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/69 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1361/1430 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/1438 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1438 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1438 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1438 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1438 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1438/1438 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2138ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2188 ms.
Support contains 16 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1364/1364 transitions.
Applied a total of 0 rules in 88 ms. Remains 74 /74 variables (removed 0) and now considering 1364/1364 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 74/74 places, 1364/1364 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1364/1364 transitions.
Applied a total of 0 rules in 74 ms. Remains 74 /74 variables (removed 0) and now considering 1364/1364 (removed 0) transitions.
[2024-05-22 07:23:10] [INFO ] Invariant cache hit.
[2024-05-22 07:23:10] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-22 07:23:10] [INFO ] Invariant cache hit.
[2024-05-22 07:23:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:23:11] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned [69, 73]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1636 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/74 places, 1363/1364 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 1362
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 71 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 70 transition count 1361
Applied a total of 4 rules in 260 ms. Remains 70 /72 variables (removed 2) and now considering 1361/1363 (removed 2) transitions.
// Phase 1: matrix 1361 rows 70 cols
[2024-05-22 07:23:12] [INFO ] Computed 13 invariants in 15 ms
[2024-05-22 07:23:12] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-22 07:23:12] [INFO ] Invariant cache hit.
[2024-05-22 07:23:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:23:13] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 70/74 places, 1361/1364 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3315 ms. Remains : 70/74 places, 1361/1364 transitions.
RANDOM walk for 40000 steps (36 resets) in 2082 ms. (19 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (152 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 411811 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 3
Probabilistic random walk after 411811 steps, saw 58139 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2024-05-22 07:23:17] [INFO ] Invariant cache hit.
[2024-05-22 07:23:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1361/1429 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1429 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1429 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1431 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1431 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1431 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1431/1431 variables, and 85 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1361/1429 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1429 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1429 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1431 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1431 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1431 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1431/1431 variables, and 85 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2314ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1826 ms.
Support contains 16 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1361/1361 transitions.
Applied a total of 0 rules in 84 ms. Remains 70 /70 variables (removed 0) and now considering 1361/1361 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 70/70 places, 1361/1361 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1361/1361 transitions.
Applied a total of 0 rules in 72 ms. Remains 70 /70 variables (removed 0) and now considering 1361/1361 (removed 0) transitions.
[2024-05-22 07:23:21] [INFO ] Invariant cache hit.
[2024-05-22 07:23:22] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-22 07:23:22] [INFO ] Invariant cache hit.
[2024-05-22 07:23:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:23:23] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1720 ms to find 0 implicit places.
[2024-05-22 07:23:23] [INFO ] Redundant transitions in 249 ms returned []
Running 1353 sub problems to find dead transitions.
[2024-05-22 07:23:23] [INFO ] Invariant cache hit.
[2024-05-22 07:23:23] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
At refinement iteration 2 (OVERLAPS) 8/70 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
[2024-05-22 07:24:08] [INFO ] Deduced a trap composed of 6 places in 1024 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 70/1431 variables, and 14 constraints, problems are : Problem set: 0 solved, 1353 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/70 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1353/36 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
At refinement iteration 2 (OVERLAPS) 8/70 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
Problem TDEAD1360 is UNSAT
At refinement iteration 5 (OVERLAPS) 1361/1431 variables, 70/84 constraints. Problems are: Problem set: 1 solved, 1352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1431 variables, 2/86 constraints. Problems are: Problem set: 1 solved, 1352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1431 variables, 36/122 constraints. Problems are: Problem set: 1 solved, 1352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/1431 variables, and 122 constraints, problems are : Problem set: 1 solved, 1352 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1353/36 constraints, Known Traps: 1/1 constraints]
After SMT, in 85342ms problems are : Problem set: 1 solved, 1352 unsolved
Search for dead transitions found 1 dead transitions in 85371ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/70 places, 1360/1361 transitions.
Applied a total of 0 rules in 77 ms. Remains 70 /70 variables (removed 0) and now considering 1360/1360 (removed 0) transitions.
[2024-05-22 07:24:49] [INFO ] Redundant transitions in 101 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87623 ms. Remains : 70/70 places, 1360/1361 transitions.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 53 stabilizing places and 54 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(G((X(G(p1))&&p0))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 39 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 07:24:49] [INFO ] Computed 15 invariants in 15 ms
[2024-05-22 07:24:50] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2024-05-22 07:24:50] [INFO ] Invariant cache hit.
[2024-05-22 07:24:53] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 3083 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 07:24:53] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 56388ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 56430ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59566 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 431 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-00 finished in 60104 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((p0&&(p1||G(p0))))||X(F(p2))))'
Support contains 6 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 58 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
[2024-05-22 07:25:50] [INFO ] Invariant cache hit.
[2024-05-22 07:25:50] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-22 07:25:50] [INFO ] Invariant cache hit.
[2024-05-22 07:25:52] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 07:25:52] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 56758ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 56783ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59167 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01
Product exploration explored 100000 steps with 767 reset in 1094 ms.
Product exploration explored 100000 steps with 770 reset in 599 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
RANDOM walk for 40000 steps (305 resets) in 753 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 660 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (43 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (44 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 193540 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 6
Probabilistic random walk after 193540 steps, saw 37062 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-22 07:26:55] [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, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 105/111 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 236/347 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1774/2121 variables, 347/362 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2121/2121 variables, and 362 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 105/111 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 236/347 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 07:26:58] [INFO ] Deduced a trap composed of 31 places in 1550 ms of which 5 ms to minimize.
[2024-05-22 07:27:00] [INFO ] Deduced a trap composed of 31 places in 1879 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/2121 variables, and 364 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 6324ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1642
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 182 transition count 1577
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 362 place count 176 transition count 1577
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 522 place count 96 transition count 1497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 96 transition count 1496
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 542 place count 77 transition count 1305
Iterating global reduction 4 with 19 rules applied. Total rules applied 561 place count 77 transition count 1305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 569 place count 77 transition count 1297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 571 place count 76 transition count 1296
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 583 place count 76 transition count 1284
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 595 place count 64 transition count 1284
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 64 transition count 1284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 597 place count 63 transition count 1283
Applied a total of 597 rules in 722 ms. Remains 63 /347 variables (removed 284) and now considering 1283/1774 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 63/347 places, 1283/1774 transitions.
RANDOM walk for 40000 steps (424 resets) in 1806 ms. (22 steps per ms) remains 2/5 properties
BEST_FIRST walk for 7493 steps (3 resets) in 54 ms. (136 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 10 factoid took 473 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 392 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 416 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 6 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 344 transition count 1646
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 342 place count 185 transition count 1584
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 352 place count 180 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 353 place count 179 transition count 1583
Iterating global reduction 3 with 1 rules applied. Total rules applied 354 place count 179 transition count 1583
Performed 69 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 492 place count 110 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 110 transition count 1512
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 506 place count 97 transition count 1387
Iterating global reduction 4 with 13 rules applied. Total rules applied 519 place count 97 transition count 1387
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 527 place count 97 transition count 1379
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 531 place count 95 transition count 1377
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 533 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 535 place count 93 transition count 1375
Applied a total of 535 rules in 919 ms. Remains 93 /347 variables (removed 254) and now considering 1375/1774 (removed 399) transitions.
// Phase 1: matrix 1375 rows 93 cols
[2024-05-22 07:27:05] [INFO ] Computed 14 invariants in 10 ms
[2024-05-22 07:27:05] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-22 07:27:05] [INFO ] Invariant cache hit.
[2024-05-22 07:27:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:27:06] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1465 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/347 places, 1375/1774 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 1374
Applied a total of 2 rules in 161 ms. Remains 90 /91 variables (removed 1) and now considering 1374/1375 (removed 1) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2024-05-22 07:27:06] [INFO ] Computed 12 invariants in 15 ms
[2024-05-22 07:27:07] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-22 07:27:07] [INFO ] Invariant cache hit.
[2024-05-22 07:27:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:27:08] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/347 places, 1374/1774 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4451 ms. Remains : 90/347 places, 1374/1774 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 236 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), false, false]
RANDOM walk for 40000 steps (1439 resets) in 3255 ms. (12 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (112 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (107 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (113 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (112 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (114 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 273915 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 6
Probabilistic random walk after 273915 steps, saw 45543 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-22 07:27:14] [INFO ] Invariant cache hit.
[2024-05-22 07:27:14] [INFO ] State equation strengthened by 1 read => feed constraints.
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, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1323/1355 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/1462 variables, 57/93 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 8/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1462 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1463 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1463 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/1464 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1464 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1464 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1464/1464 variables, and 103 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1323/1355 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/1462 variables, 57/93 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 8/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 07:27:17] [INFO ] Deduced a trap composed of 7 places in 1588 ms of which 2 ms to minimize.
[2024-05-22 07:27:19] [INFO ] Deduced a trap composed of 7 places in 1487 ms of which 3 ms to minimize.
[2024-05-22 07:27:20] [INFO ] Deduced a trap composed of 7 places in 1312 ms of which 2 ms to minimize.
SMT process timed out in 6748ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 468 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 59/90 places, 1283/1374 transitions.
RANDOM walk for 40000 steps (510 resets) in 2358 ms. (16 steps per ms) remains 2/5 properties
BEST_FIRST walk for 6918 steps (2 resets) in 28 ms. (238 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 14 factoid took 500 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 381 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 477 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 375 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 412 reset in 523 ms.
Product exploration explored 100000 steps with 2905 reset in 1342 ms.
Built C files in :
/tmp/ltsmin10185780026450996057
[2024-05-22 07:27:25] [INFO ] Computing symmetric may disable matrix : 1374 transitions.
[2024-05-22 07:27:26] [INFO ] Computation of Complete disable matrix. took 463 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:27:26] [INFO ] Computing symmetric may enable matrix : 1374 transitions.
[2024-05-22 07:27:26] [INFO ] Computation of Complete enable matrix. took 126 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:27:26] [INFO ] Computing Do-Not-Accords matrix : 1374 transitions.
[2024-05-22 07:27:26] [INFO ] Computation of Completed DNA matrix. took 132 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:27:27] [INFO ] Built C files in 1360ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10185780026450996057
Running compilation step : cd /tmp/ltsmin10185780026450996057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10185780026450996057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10185780026450996057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 90 transition count 1373
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 2 place count 89 transition count 1373
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 83 transition count 1367
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 77 transition count 1301
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 77 transition count 1301
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 73 transition count 1297
Applied a total of 34 rules in 283 ms. Remains 73 /90 variables (removed 17) and now considering 1297/1374 (removed 77) transitions.
// Phase 1: matrix 1297 rows 73 cols
[2024-05-22 07:27:30] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 07:27:31] [INFO ] Implicit Places using invariants in 943 ms returned []
[2024-05-22 07:27:31] [INFO ] Invariant cache hit.
[2024-05-22 07:27:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:27:33] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2790 ms to find 0 implicit places.
[2024-05-22 07:27:33] [INFO ] Redundant transitions in 641 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1293 sub problems to find dead transitions.
// Phase 1: matrix 1296 rows 73 cols
[2024-05-22 07:27:33] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 07:27:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
SMT process timed out in 52816ms, After SMT, problems are : Problem set: 0 solved, 1293 unsolved
Search for dead transitions found 0 dead transitions in 52833ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/90 places, 1296/1374 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 1294
Applied a total of 2 rules in 169 ms. Remains 71 /73 variables (removed 2) and now considering 1294/1296 (removed 2) transitions.
// Phase 1: matrix 1294 rows 71 cols
[2024-05-22 07:28:26] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 07:28:27] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-22 07:28:27] [INFO ] Invariant cache hit.
[2024-05-22 07:28:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:28:28] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/90 places, 1294/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58634 ms. Remains : 71/90 places, 1294/1374 transitions.
Built C files in :
/tmp/ltsmin9519566636166164832
[2024-05-22 07:28:28] [INFO ] Computing symmetric may disable matrix : 1294 transitions.
[2024-05-22 07:28:29] [INFO ] Computation of Complete disable matrix. took 426 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:28:29] [INFO ] Computing symmetric may enable matrix : 1294 transitions.
[2024-05-22 07:28:29] [INFO ] Computation of Complete enable matrix. took 120 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:28:29] [INFO ] Computing Do-Not-Accords matrix : 1294 transitions.
[2024-05-22 07:28:29] [INFO ] Computation of Completed DNA matrix. took 108 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:28:30] [INFO ] Built C files in 1256ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9519566636166164832
Running compilation step : cd /tmp/ltsmin9519566636166164832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9519566636166164832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9519566636166164832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 07:28:33] [INFO ] Flatten gal took : 184 ms
[2024-05-22 07:28:33] [INFO ] Flatten gal took : 214 ms
[2024-05-22 07:28:33] [INFO ] Time to serialize gal into /tmp/LTL17722642614782044698.gal : 147 ms
[2024-05-22 07:28:33] [INFO ] Time to serialize properties into /tmp/LTL7079986785092399363.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17722642614782044698.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17223516922505931151.hoa' '-atoms' '/tmp/LTL7079986785092399363.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7079986785092399363.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17223516922505931151.hoa
Detected timeout of ITS tools.
[2024-05-22 07:28:49] [INFO ] Flatten gal took : 254 ms
[2024-05-22 07:28:49] [INFO ] Flatten gal took : 226 ms
[2024-05-22 07:28:49] [INFO ] Time to serialize gal into /tmp/LTL3744412901037065457.gal : 42 ms
[2024-05-22 07:28:49] [INFO ] Time to serialize properties into /tmp/LTL8071899605007222600.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3744412901037065457.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8071899605007222600.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(("(((p6==0)||(p20==0))||((p218==0)||(p382==0)))")&&(("(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&...336
Formula 0 simplified : F(!"(((p6==0)||(p20==0))||((p218==0)||(p382==0)))" | (!"(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&(...324
Detected timeout of ITS tools.
[2024-05-22 07:29:05] [INFO ] Flatten gal took : 223 ms
[2024-05-22 07:29:05] [INFO ] Applying decomposition
[2024-05-22 07:29:05] [INFO ] Flatten gal took : 207 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6872897885506154224.txt' '-o' '/tmp/graph6872897885506154224.bin' '-w' '/tmp/graph6872897885506154224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6872897885506154224.bin' '-l' '-1' '-v' '-w' '/tmp/graph6872897885506154224.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:29:05] [INFO ] Decomposing Gal with order
[2024-05-22 07:29:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:29:06] [INFO ] Removed a total of 12066 redundant transitions.
[2024-05-22 07:29:06] [INFO ] Flatten gal took : 754 ms
[2024-05-22 07:29:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 100 ms.
[2024-05-22 07:29:07] [INFO ] Time to serialize gal into /tmp/LTL2705803152852843647.gal : 7 ms
[2024-05-22 07:29:07] [INFO ] Time to serialize properties into /tmp/LTL846734191622061089.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2705803152852843647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL846734191622061089.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((G(("(((u0.p6==0)||(u0.p20==0))||((u12.p218==0)||(u0.p382==0)))")&&(("(((((i3.u1.p68==1)&&(i3.u3.p99==1))&&((i3.u6.p136==1)&&(i3.u7...446
Formula 0 simplified : F(!"(((u0.p6==0)||(u0.p20==0))||((u12.p218==0)||(u0.p382==0)))" | (!"(((((i3.u1.p68==1)&&(i3.u3.p99==1))&&((i3.u6.p136==1)&&(i3.u7.p...434
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-01 finished in 212162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(p1)&&F(p2)))))'
Support contains 19 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 298 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 349 transition count 1649
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 181 rules applied. Total rules applied 309 place count 222 transition count 1595
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 341 place count 190 transition count 1595
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 341 place count 190 transition count 1587
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 357 place count 182 transition count 1587
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 360 place count 179 transition count 1584
Iterating global reduction 3 with 3 rules applied. Total rules applied 363 place count 179 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 178 transition count 1574
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 178 transition count 1574
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 367 place count 178 transition count 1572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 368 place count 177 transition count 1572
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 492 place count 115 transition count 1509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 493 place count 115 transition count 1508
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 504 place count 104 transition count 1406
Iterating global reduction 6 with 11 rules applied. Total rules applied 515 place count 104 transition count 1406
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 524 place count 104 transition count 1397
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 7 with 4 rules applied. Total rules applied 528 place count 102 transition count 1395
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 530 place count 100 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 531 place count 99 transition count 1393
Applied a total of 531 rules in 438 ms. Remains 99 /352 variables (removed 253) and now considering 1393/1779 (removed 386) transitions.
// Phase 1: matrix 1393 rows 99 cols
[2024-05-22 07:29:22] [INFO ] Computed 13 invariants in 13 ms
[2024-05-22 07:29:22] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-22 07:29:22] [INFO ] Invariant cache hit.
[2024-05-22 07:29:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:29:23] [INFO ] Implicit Places using invariants and state equation in 634 ms returned [94, 98]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 898 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/352 places, 1393/1779 transitions.
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 2 place count 96 transition count 1392
Applied a total of 2 rules in 84 ms. Remains 96 /97 variables (removed 1) and now considering 1392/1393 (removed 1) transitions.
// Phase 1: matrix 1392 rows 96 cols
[2024-05-22 07:29:23] [INFO ] Computed 11 invariants in 8 ms
[2024-05-22 07:29:23] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 07:29:23] [INFO ] Invariant cache hit.
[2024-05-22 07:29:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:29:24] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/352 places, 1392/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2462 ms. Remains : 96/352 places, 1392/1779 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-03
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-03 finished in 2620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 350 transition count 1777
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 350 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 349 transition count 1776
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 349 transition count 1776
Applied a total of 6 rules in 43 ms. Remains 349 /352 variables (removed 3) and now considering 1776/1779 (removed 3) transitions.
// Phase 1: matrix 1776 rows 349 cols
[2024-05-22 07:29:24] [INFO ] Computed 15 invariants in 15 ms
[2024-05-22 07:29:25] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-05-22 07:29:25] [INFO ] Invariant cache hit.
[2024-05-22 07:29:28] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 3575 ms to find 0 implicit places.
Running 1775 sub problems to find dead transitions.
[2024-05-22 07:29:28] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1775 unsolved
SMT process timed out in 57181ms, After SMT, problems are : Problem set: 0 solved, 1775 unsolved
Search for dead transitions found 0 dead transitions in 57215ms
Starting structural reductions in LTL mode, iteration 1 : 349/352 places, 1776/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60839 ms. Remains : 349/352 places, 1776/1779 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-04 finished in 61051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G((F(p0)||G(!p1)))||((F(p0)||G(!p1))&&(G(!p1)||(!p1&&F(p2))))))))'
Support contains 20 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 349 transition count 1776
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 348 transition count 1775
Applied a total of 8 rules in 48 ms. Remains 348 /352 variables (removed 4) and now considering 1775/1779 (removed 4) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2024-05-22 07:30:25] [INFO ] Computed 15 invariants in 18 ms
[2024-05-22 07:30:26] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-22 07:30:26] [INFO ] Invariant cache hit.
[2024-05-22 07:30:27] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
Running 1774 sub problems to find dead transitions.
[2024-05-22 07:30:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
SMT process timed out in 56700ms, After SMT, problems are : Problem set: 0 solved, 1774 unsolved
Search for dead transitions found 0 dead transitions in 56734ms
Starting structural reductions in LTL mode, iteration 1 : 348/352 places, 1775/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58579 ms. Remains : 348/352 places, 1775/1779 transitions.
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-05
Product exploration explored 100000 steps with 772 reset in 683 ms.
Product exploration explored 100000 steps with 82 reset in 243 ms.
Computed a total of 52 stabilizing places and 53 stable transitions
Computed a total of 52 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 159 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (304 resets) in 587 ms. (68 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (53 resets) in 344 ms. (115 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (54 resets) in 278 ms. (143 steps per ms) remains 1/2 properties
[2024-05-22 07:31:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 297/2123 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, State Equation: 0/348 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p2 p0))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 23 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-05 finished in 60916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 332 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 349 transition count 1648
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 185 rules applied. Total rules applied 314 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 348 place count 187 transition count 1591
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 348 place count 187 transition count 1584
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 77 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 527 place count 98 transition count 1491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 528 place count 98 transition count 1490
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 547 place count 79 transition count 1300
Iterating global reduction 6 with 19 rules applied. Total rules applied 566 place count 79 transition count 1300
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 575 place count 79 transition count 1291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 579 place count 77 transition count 1289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 580 place count 76 transition count 1288
Applied a total of 580 rules in 460 ms. Remains 76 /352 variables (removed 276) and now considering 1288/1779 (removed 491) transitions.
// Phase 1: matrix 1288 rows 76 cols
[2024-05-22 07:31:27] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 07:31:27] [INFO ] Implicit Places using invariants in 833 ms returned []
[2024-05-22 07:31:27] [INFO ] Invariant cache hit.
[2024-05-22 07:31:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:31:29] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned [71, 75]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2452 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/352 places, 1288/1779 transitions.
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 2 place count 73 transition count 1287
Applied a total of 2 rules in 181 ms. Remains 73 /74 variables (removed 1) and now considering 1287/1288 (removed 1) transitions.
// Phase 1: matrix 1287 rows 73 cols
[2024-05-22 07:31:29] [INFO ] Computed 12 invariants in 25 ms
[2024-05-22 07:31:30] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2024-05-22 07:31:30] [INFO ] Invariant cache hit.
[2024-05-22 07:31:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:31:32] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2803 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/352 places, 1287/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5897 ms. Remains : 73/352 places, 1287/1779 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-06
Product exploration explored 100000 steps with 554 reset in 459 ms.
Product exploration explored 100000 steps with 305 reset in 292 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 1188 steps (53 resets) in 25 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 1287/1287 transitions.
Applied a total of 0 rules in 100 ms. Remains 73 /73 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
[2024-05-22 07:31:33] [INFO ] Invariant cache hit.
[2024-05-22 07:31:34] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-05-22 07:31:34] [INFO ] Invariant cache hit.
[2024-05-22 07:31:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:31:36] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2488 ms to find 0 implicit places.
[2024-05-22 07:31:36] [INFO ] Redundant transitions in 136 ms returned [1074]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1283 sub problems to find dead transitions.
// Phase 1: matrix 1286 rows 73 cols
[2024-05-22 07:31:36] [INFO ] Computed 12 invariants in 18 ms
[2024-05-22 07:31:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 72/1359 variables, and 12 constraints, problems are : Problem set: 0 solved, 1283 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/73 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1283/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
At refinement iteration 4 (OVERLAPS) 1285/1357 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1357/1359 variables, and 132 constraints, problems are : Problem set: 0 solved, 1283 unsolved in 30172 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/73 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1283/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 84624ms problems are : Problem set: 0 solved, 1283 unsolved
Search for dead transitions found 0 dead transitions in 84649ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/73 places, 1286/1287 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 71 transition count 1284
Applied a total of 2 rules in 119 ms. Remains 71 /73 variables (removed 2) and now considering 1284/1286 (removed 2) transitions.
// Phase 1: matrix 1284 rows 71 cols
[2024-05-22 07:33:01] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 07:33:01] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-05-22 07:33:01] [INFO ] Invariant cache hit.
[2024-05-22 07:33:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:33:03] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/73 places, 1284/1287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89318 ms. Remains : 71/73 places, 1284/1287 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 1084 steps (50 resets) in 20 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 506 reset in 201 ms.
Product exploration explored 100000 steps with 108 reset in 196 ms.
Built C files in :
/tmp/ltsmin15341211878999401053
[2024-05-22 07:33:03] [INFO ] Computing symmetric may disable matrix : 1284 transitions.
[2024-05-22 07:33:04] [INFO ] Computation of Complete disable matrix. took 453 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:33:04] [INFO ] Computing symmetric may enable matrix : 1284 transitions.
[2024-05-22 07:33:04] [INFO ] Computation of Complete enable matrix. took 67 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:33:04] [INFO ] Computing Do-Not-Accords matrix : 1284 transitions.
[2024-05-22 07:33:04] [INFO ] Computation of Completed DNA matrix. took 109 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:33:05] [INFO ] Built C files in 1234ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15341211878999401053
Running compilation step : cd /tmp/ltsmin15341211878999401053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15341211878999401053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15341211878999401053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1284/1284 transitions.
Applied a total of 0 rules in 104 ms. Remains 71 /71 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2024-05-22 07:33:08] [INFO ] Invariant cache hit.
[2024-05-22 07:33:08] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-22 07:33:08] [INFO ] Invariant cache hit.
[2024-05-22 07:33:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:33:10] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2024-05-22 07:33:10] [INFO ] Redundant transitions in 147 ms returned []
Running 1282 sub problems to find dead transitions.
[2024-05-22 07:33:10] [INFO ] Invariant cache hit.
[2024-05-22 07:33:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 4 (OVERLAPS) 1283/1354 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 1282 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 Real declared 1354/1355 variables, and 83 constraints, problems are : Problem set: 0 solved, 1282 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1282/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 4 (OVERLAPS) 1283/1354 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1354 variables, 45/128 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1354/1355 variables, and 128 constraints, problems are : Problem set: 0 solved, 1282 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1282/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 83848ms problems are : Problem set: 0 solved, 1282 unsolved
Search for dead transitions found 0 dead transitions in 83864ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86007 ms. Remains : 71/71 places, 1284/1284 transitions.
Built C files in :
/tmp/ltsmin10654549187504288705
[2024-05-22 07:34:34] [INFO ] Computing symmetric may disable matrix : 1284 transitions.
[2024-05-22 07:34:34] [INFO ] Computation of Complete disable matrix. took 465 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:34:34] [INFO ] Computing symmetric may enable matrix : 1284 transitions.
[2024-05-22 07:34:34] [INFO ] Computation of Complete enable matrix. took 66 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:34:35] [INFO ] Computing Do-Not-Accords matrix : 1284 transitions.
[2024-05-22 07:34:35] [INFO ] Computation of Completed DNA matrix. took 117 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:34:35] [INFO ] Built C files in 1275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10654549187504288705
Running compilation step : cd /tmp/ltsmin10654549187504288705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10654549187504288705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10654549187504288705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 07:34:38] [INFO ] Flatten gal took : 192 ms
[2024-05-22 07:34:38] [INFO ] Flatten gal took : 195 ms
[2024-05-22 07:34:38] [INFO ] Time to serialize gal into /tmp/LTL781442397844139008.gal : 30 ms
[2024-05-22 07:34:38] [INFO ] Time to serialize properties into /tmp/LTL8964143165696450674.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL781442397844139008.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10439446628587771341.hoa' '-atoms' '/tmp/LTL8964143165696450674.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8964143165696450674.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10439446628587771341.hoa
Detected timeout of ITS tools.
[2024-05-22 07:34:54] [INFO ] Flatten gal took : 199 ms
[2024-05-22 07:34:54] [INFO ] Flatten gal took : 208 ms
[2024-05-22 07:34:54] [INFO ] Time to serialize gal into /tmp/LTL18163743460854590799.gal : 27 ms
[2024-05-22 07:34:54] [INFO ] Time to serialize properties into /tmp/LTL10652444132501251004.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18163743460854590799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10652444132501251004.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p6!=1)||(p9!=1))||((p194!=1)||(p382!=1)))"))))
Formula 0 simplified : GF!"(((p6!=1)||(p9!=1))||((p194!=1)||(p382!=1)))"
Detected timeout of ITS tools.
[2024-05-22 07:35:09] [INFO ] Flatten gal took : 194 ms
[2024-05-22 07:35:09] [INFO ] Applying decomposition
[2024-05-22 07:35:10] [INFO ] Flatten gal took : 195 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5168079425414751474.txt' '-o' '/tmp/graph5168079425414751474.bin' '-w' '/tmp/graph5168079425414751474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5168079425414751474.bin' '-l' '-1' '-v' '-w' '/tmp/graph5168079425414751474.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:35:10] [INFO ] Decomposing Gal with order
[2024-05-22 07:35:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:35:11] [INFO ] Removed a total of 11632 redundant transitions.
[2024-05-22 07:35:11] [INFO ] Flatten gal took : 375 ms
[2024-05-22 07:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 87 ms.
[2024-05-22 07:35:11] [INFO ] Time to serialize gal into /tmp/LTL7217995914312934860.gal : 18 ms
[2024-05-22 07:35:11] [INFO ] Time to serialize properties into /tmp/LTL2356031589144956890.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7217995914312934860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2356031589144956890.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(((u20.p6!=1)||(u20.p9!=1))||((u8.p194!=1)||(u20.p382!=1)))"))))
Formula 0 simplified : GF!"(((u20.p6!=1)||(u20.p9!=1))||((u8.p194!=1)||(u20.p382!=1)))"
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-06 finished in 239699 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)||G(p1))))'
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 304 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 350 place count 186 transition count 1583
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 367 place count 176 transition count 1580
Iterating global reduction 3 with 3 rules applied. Total rules applied 370 place count 176 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 371 place count 175 transition count 1570
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 175 transition count 1570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 374 place count 175 transition count 1568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 375 place count 174 transition count 1568
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 501 place count 111 transition count 1504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 502 place count 111 transition count 1503
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 512 place count 101 transition count 1412
Iterating global reduction 6 with 10 rules applied. Total rules applied 522 place count 101 transition count 1412
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 531 place count 101 transition count 1403
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 535 place count 99 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 537 place count 97 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 538 place count 96 transition count 1399
Applied a total of 538 rules in 365 ms. Remains 96 /352 variables (removed 256) and now considering 1399/1779 (removed 380) transitions.
// Phase 1: matrix 1399 rows 96 cols
[2024-05-22 07:35:26] [INFO ] Computed 13 invariants in 9 ms
[2024-05-22 07:35:27] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-22 07:35:27] [INFO ] Invariant cache hit.
[2024-05-22 07:35:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:35:27] [INFO ] Implicit Places using invariants and state equation in 909 ms returned [91, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1198 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/352 places, 1399/1779 transitions.
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 2 place count 93 transition count 1398
Applied a total of 2 rules in 96 ms. Remains 93 /94 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 93 cols
[2024-05-22 07:35:28] [INFO ] Computed 11 invariants in 14 ms
[2024-05-22 07:35:28] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-22 07:35:28] [INFO ] Invariant cache hit.
[2024-05-22 07:35:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:35:29] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/352 places, 1398/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2715 ms. Remains : 93/352 places, 1398/1779 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-07
Product exploration explored 100000 steps with 25 reset in 187 ms.
Product exploration explored 100000 steps with 88 reset in 214 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 148 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1409 resets) in 703 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (128 resets) in 203 ms. (196 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (118 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (130 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (125 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
[2024-05-22 07:35:30] [INFO ] Invariant cache hit.
[2024-05-22 07:35:30] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/76 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1390/1466 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/1481 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1481 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1481 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/1489 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1489 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1490 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1490 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/1491 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1491 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1491 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1491/1491 variables, and 105 constraints, problems are : Problem set: 0 solved, 3 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/76 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1390/1466 variables, 76/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/1481 variables, 13/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1481 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1481 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/1489 variables, 3/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1489 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1490 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1490 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1491 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1491 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1491 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1491/1491 variables, and 105 constraints, problems are : Problem set: 1 solved, 2 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1880ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 16 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 401 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 1398/1398 transitions.
Applied a total of 0 rules in 82 ms. Remains 93 /93 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-22 07:35:32] [INFO ] Invariant cache hit.
[2024-05-22 07:35:32] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-22 07:35:32] [INFO ] Invariant cache hit.
[2024-05-22 07:35:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:35:33] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
[2024-05-22 07:35:33] [INFO ] Redundant transitions in 72 ms returned [1095]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1390 sub problems to find dead transitions.
// Phase 1: matrix 1397 rows 93 cols
[2024-05-22 07:35:33] [INFO ] Computed 11 invariants in 9 ms
[2024-05-22 07:35:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 91/1490 variables, and 11 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/93 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1390/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 4 (OVERLAPS) 1396/1487 variables, 91/102 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1487 variables, 31/133 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1487/1490 variables, and 133 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 91/93 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1357/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 85881ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 85899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 1397/1398 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 91 transition count 1395
Applied a total of 2 rules in 93 ms. Remains 91 /93 variables (removed 2) and now considering 1395/1397 (removed 2) transitions.
// Phase 1: matrix 1395 rows 91 cols
[2024-05-22 07:36:59] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 07:37:00] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-22 07:37:00] [INFO ] Invariant cache hit.
[2024-05-22 07:37:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:37:00] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/93 places, 1395/1398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88228 ms. Remains : 91/93 places, 1395/1398 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 144 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1436 resets) in 1285 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (127 resets) in 141 ms. (281 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (127 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (129 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (130 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
[2024-05-22 07:37:01] [INFO ] Invariant cache hit.
[2024-05-22 07:37:01] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/76 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1390/1466 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 17/1483 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1483 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1483 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/1485 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1485 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1486 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1486 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1486 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1486/1486 variables, and 103 constraints, problems are : Problem set: 0 solved, 3 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/76 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1390/1466 variables, 76/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/1483 variables, 13/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1483 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1483 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/1485 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1485 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1486 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1486 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1486 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1486/1486 variables, and 103 constraints, problems are : Problem set: 1 solved, 2 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1591ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 372 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1251 reset in 592 ms.
Product exploration explored 100000 steps with 2627 reset in 1119 ms.
Built C files in :
/tmp/ltsmin7569573476282213916
[2024-05-22 07:37:05] [INFO ] Computing symmetric may disable matrix : 1395 transitions.
[2024-05-22 07:37:06] [INFO ] Computation of Complete disable matrix. took 454 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:37:06] [INFO ] Computing symmetric may enable matrix : 1395 transitions.
[2024-05-22 07:37:06] [INFO ] Computation of Complete enable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:37:06] [INFO ] Computing Do-Not-Accords matrix : 1395 transitions.
[2024-05-22 07:37:06] [INFO ] Computation of Completed DNA matrix. took 126 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:37:06] [INFO ] Built C files in 1276ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7569573476282213916
Running compilation step : cd /tmp/ltsmin7569573476282213916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7569573476282213916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7569573476282213916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1395/1395 transitions.
Applied a total of 0 rules in 79 ms. Remains 91 /91 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2024-05-22 07:37:10] [INFO ] Invariant cache hit.
[2024-05-22 07:37:10] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-22 07:37:10] [INFO ] Invariant cache hit.
[2024-05-22 07:37:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:37:11] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
[2024-05-22 07:37:11] [INFO ] Redundant transitions in 60 ms returned []
Running 1389 sub problems to find dead transitions.
[2024-05-22 07:37:11] [INFO ] Invariant cache hit.
[2024-05-22 07:37:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 2 (OVERLAPS) 5/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
SMT process timed out in 55505ms, After SMT, problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 55523ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56673 ms. Remains : 91/91 places, 1395/1395 transitions.
Built C files in :
/tmp/ltsmin13950377705395411193
[2024-05-22 07:38:06] [INFO ] Computing symmetric may disable matrix : 1395 transitions.
[2024-05-22 07:38:07] [INFO ] Computation of Complete disable matrix. took 459 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:38:07] [INFO ] Computing symmetric may enable matrix : 1395 transitions.
[2024-05-22 07:38:07] [INFO ] Computation of Complete enable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:38:07] [INFO ] Computing Do-Not-Accords matrix : 1395 transitions.
[2024-05-22 07:38:07] [INFO ] Computation of Completed DNA matrix. took 137 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:38:07] [INFO ] Built C files in 1320ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13950377705395411193
Running compilation step : cd /tmp/ltsmin13950377705395411193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13950377705395411193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13950377705395411193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 07:38:11] [INFO ] Flatten gal took : 201 ms
[2024-05-22 07:38:11] [INFO ] Flatten gal took : 201 ms
[2024-05-22 07:38:11] [INFO ] Time to serialize gal into /tmp/LTL10893003785954774791.gal : 27 ms
[2024-05-22 07:38:11] [INFO ] Time to serialize properties into /tmp/LTL852230169805189523.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10893003785954774791.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2426106318847099823.hoa' '-atoms' '/tmp/LTL852230169805189523.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL852230169805189523.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2426106318847099823.hoa
Detected timeout of ITS tools.
[2024-05-22 07:38:26] [INFO ] Flatten gal took : 197 ms
[2024-05-22 07:38:27] [INFO ] Flatten gal took : 232 ms
[2024-05-22 07:38:27] [INFO ] Time to serialize gal into /tmp/LTL10634588152296280972.gal : 25 ms
[2024-05-22 07:38:27] [INFO ] Time to serialize properties into /tmp/LTL10234855515485182554.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10634588152296280972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10234855515485182554.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((p68==0)||(p105==0))||((p136==0)||(p161==0)))||(((p198==0)||(p223==0))||((p254==0)||(p291==0))))||(((p316==0)||(p347==0))...320
Formula 0 simplified : G(F!"(((((p68==0)||(p105==0))||((p136==0)||(p161==0)))||(((p198==0)||(p223==0))||((p254==0)||(p291==0))))||(((p316==0)||(p347==0))||...312
Detected timeout of ITS tools.
[2024-05-22 07:38:42] [INFO ] Flatten gal took : 192 ms
[2024-05-22 07:38:42] [INFO ] Applying decomposition
[2024-05-22 07:38:42] [INFO ] Flatten gal took : 193 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph680225472530812120.txt' '-o' '/tmp/graph680225472530812120.bin' '-w' '/tmp/graph680225472530812120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph680225472530812120.bin' '-l' '-1' '-v' '-w' '/tmp/graph680225472530812120.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:38:43] [INFO ] Decomposing Gal with order
[2024-05-22 07:38:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:38:43] [INFO ] Removed a total of 11934 redundant transitions.
[2024-05-22 07:38:43] [INFO ] Flatten gal took : 326 ms
[2024-05-22 07:38:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 52 ms.
[2024-05-22 07:38:43] [INFO ] Time to serialize gal into /tmp/LTL13884066764216451249.gal : 4 ms
[2024-05-22 07:38:43] [INFO ] Time to serialize properties into /tmp/LTL15355022681978628372.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13884066764216451249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15355022681978628372.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((i0.u0.p68==0)||(i0.u3.p105==0))||((i0.u5.p136==0)||(i0.u6.p161==0)))||(((i0.u9.p198==0)||(i0.u10.p223==0))||((i0.u12.p25...462
Formula 0 simplified : G(F!"(((((i0.u0.p68==0)||(i0.u3.p105==0))||((i0.u5.p136==0)||(i0.u6.p161==0)))||(((i0.u9.p198==0)||(i0.u10.p223==0))||((i0.u12.p254=...454
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-07 finished in 212289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0) U p1))&&(G((p2 U p1))||F(p3)))))'
Support contains 20 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 30 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 07:38:58] [INFO ] Computed 15 invariants in 14 ms
[2024-05-22 07:38:59] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-22 07:38:59] [INFO ] Invariant cache hit.
[2024-05-22 07:39:00] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 07:39:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 347/2121 variables, and 15 constraints, problems are : Problem set: 0 solved, 1773 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 0/347 constraints, PredecessorRefiner: 1773/347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1773 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
[2024-05-22 07:40:14] [INFO ] Deduced a trap composed of 31 places in 1525 ms of which 5 ms to minimize.
[2024-05-22 07:40:16] [INFO ] Deduced a trap composed of 23 places in 1343 ms of which 5 ms to minimize.
[2024-05-22 07:40:17] [INFO ] Deduced a trap composed of 67 places in 1369 ms of which 4 ms to minimize.
[2024-05-22 07:40:18] [INFO ] Deduced a trap composed of 40 places in 509 ms of which 1 ms to minimize.
[2024-05-22 07:40:20] [INFO ] Deduced a trap composed of 38 places in 1506 ms of which 4 ms to minimize.
[2024-05-22 07:40:21] [INFO ] Deduced a trap composed of 31 places in 1222 ms of which 3 ms to minimize.
[2024-05-22 07:40:22] [INFO ] Deduced a trap composed of 31 places in 1007 ms of which 2 ms to minimize.
[2024-05-22 07:40:24] [INFO ] Deduced a trap composed of 14 places in 1253 ms of which 3 ms to minimize.
[2024-05-22 07:40:25] [INFO ] Deduced a trap composed of 24 places in 1238 ms of which 4 ms to minimize.
[2024-05-22 07:40:26] [INFO ] Deduced a trap composed of 31 places in 1180 ms of which 4 ms to minimize.
[2024-05-22 07:40:27] [INFO ] Deduced a trap composed of 31 places in 1109 ms of which 3 ms to minimize.
SMT process timed out in 87875ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 87896ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89267 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-08 finished in 89626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1&&F(p2)))||p0))))'
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 309 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 349 transition count 1651
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 224 transition count 1594
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 343 place count 190 transition count 1593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 344 place count 189 transition count 1593
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 344 place count 189 transition count 1586
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 358 place count 182 transition count 1586
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 361 place count 179 transition count 1583
Iterating global reduction 4 with 3 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 365 place count 178 transition count 1573
Iterating global reduction 4 with 1 rules applied. Total rules applied 366 place count 178 transition count 1573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 368 place count 178 transition count 1571
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 369 place count 177 transition count 1571
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 501 place count 111 transition count 1504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 502 place count 111 transition count 1503
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 517 place count 96 transition count 1357
Iterating global reduction 7 with 15 rules applied. Total rules applied 532 place count 96 transition count 1357
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 541 place count 96 transition count 1348
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 545 place count 94 transition count 1346
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 546 place count 93 transition count 1345
Applied a total of 546 rules in 323 ms. Remains 93 /352 variables (removed 259) and now considering 1345/1779 (removed 434) transitions.
// Phase 1: matrix 1345 rows 93 cols
[2024-05-22 07:40:28] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:40:28] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-22 07:40:29] [INFO ] Invariant cache hit.
[2024-05-22 07:40:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:40:29] [INFO ] Implicit Places using invariants and state equation in 877 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1248 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/352 places, 1345/1779 transitions.
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 2 place count 90 transition count 1344
Applied a total of 2 rules in 89 ms. Remains 90 /91 variables (removed 1) and now considering 1344/1345 (removed 1) transitions.
// Phase 1: matrix 1344 rows 90 cols
[2024-05-22 07:40:29] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:40:30] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-22 07:40:30] [INFO ] Invariant cache hit.
[2024-05-22 07:40:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:40:31] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/352 places, 1344/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2918 ms. Remains : 90/352 places, 1344/1779 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-09
Product exploration explored 100000 steps with 78 reset in 174 ms.
Product exploration explored 100000 steps with 64 reset in 183 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/90 stabilizing places and 5/1344 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 441 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 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1236 resets) in 770 ms. (51 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (106 resets) in 143 ms. (277 steps per ms) remains 1/5 properties
[2024-05-22 07:40:32] [INFO ] Invariant cache hit.
[2024-05-22 07:40:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1333/1402 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/1422 variables, 15/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1422 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1424 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1424 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1424 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/1432 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1432 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1433 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1433 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1434 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1434 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1434 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1434/1434 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 69/1434 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, State Equation: 0/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 634ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 15 factoid took 646 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 15 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 1344/1344 transitions.
Applied a total of 0 rules in 74 ms. Remains 90 /90 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
[2024-05-22 07:40:34] [INFO ] Invariant cache hit.
[2024-05-22 07:40:34] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-22 07:40:34] [INFO ] Invariant cache hit.
[2024-05-22 07:40:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:40:35] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2024-05-22 07:40:35] [INFO ] Redundant transitions in 59 ms returned [1091]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1339 sub problems to find dead transitions.
// Phase 1: matrix 1343 rows 90 cols
[2024-05-22 07:40:35] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:40:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 1 (OVERLAPS) 2/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
[2024-05-22 07:41:20] [INFO ] Deduced a trap composed of 38 places in 1185 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 88/1433 variables, and 13 constraints, problems are : Problem set: 0 solved, 1339 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1339/63 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 1 (OVERLAPS) 2/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 4 (OVERLAPS) 1342/1430 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1430 variables, 33/134 constraints. Problems are: Problem set: 0 solved, 1339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/1433 variables, and 134 constraints, problems are : Problem set: 0 solved, 1339 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 88/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/63 constraints, Known Traps: 1/1 constraints]
After SMT, in 84750ms problems are : Problem set: 0 solved, 1339 unsolved
Search for dead transitions found 0 dead transitions in 84768ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/90 places, 1343/1344 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 88 transition count 1341
Applied a total of 2 rules in 89 ms. Remains 88 /90 variables (removed 2) and now considering 1341/1343 (removed 2) transitions.
// Phase 1: matrix 1341 rows 88 cols
[2024-05-22 07:42:00] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 07:42:00] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-22 07:42:00] [INFO ] Invariant cache hit.
[2024-05-22 07:42:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:42:01] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/90 places, 1341/1344 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87491 ms. Remains : 88/90 places, 1341/1344 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (1257 resets) in 1605 ms. (24 steps per ms) remains 2/3 properties
BEST_FIRST walk for 18621 steps (51 resets) in 100 ms. (184 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 272 reset in 259 ms.
Product exploration explored 100000 steps with 507 reset in 386 ms.
Built C files in :
/tmp/ltsmin15263865394325158582
[2024-05-22 07:42:03] [INFO ] Computing symmetric may disable matrix : 1341 transitions.
[2024-05-22 07:42:03] [INFO ] Computation of Complete disable matrix. took 452 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:42:04] [INFO ] Computing symmetric may enable matrix : 1341 transitions.
[2024-05-22 07:42:04] [INFO ] Computation of Complete enable matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:42:04] [INFO ] Computing Do-Not-Accords matrix : 1341 transitions.
[2024-05-22 07:42:04] [INFO ] Computation of Completed DNA matrix. took 119 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:42:04] [INFO ] Built C files in 1234ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15263865394325158582
Running compilation step : cd /tmp/ltsmin15263865394325158582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15263865394325158582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15263865394325158582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 15 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 1341/1341 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 1339
Applied a total of 1 rules in 146 ms. Remains 86 /88 variables (removed 2) and now considering 1339/1341 (removed 2) transitions.
// Phase 1: matrix 1339 rows 86 cols
[2024-05-22 07:42:07] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:42:08] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-22 07:42:08] [INFO ] Invariant cache hit.
[2024-05-22 07:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:42:09] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2024-05-22 07:42:09] [INFO ] Redundant transitions in 60 ms returned []
Running 1332 sub problems to find dead transitions.
[2024-05-22 07:42:09] [INFO ] Invariant cache hit.
[2024-05-22 07:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
At refinement iteration 2 (OVERLAPS) 6/85 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1332 unsolved
SMT process timed out in 54959ms, After SMT, problems are : Problem set: 0 solved, 1332 unsolved
Search for dead transitions found 0 dead transitions in 54980ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/88 places, 1339/1341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56413 ms. Remains : 86/88 places, 1339/1341 transitions.
Built C files in :
/tmp/ltsmin346503838476211042
[2024-05-22 07:43:04] [INFO ] Computing symmetric may disable matrix : 1339 transitions.
[2024-05-22 07:43:04] [INFO ] Computation of Complete disable matrix. took 452 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:43:04] [INFO ] Computing symmetric may enable matrix : 1339 transitions.
[2024-05-22 07:43:04] [INFO ] Computation of Complete enable matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:43:05] [INFO ] Computing Do-Not-Accords matrix : 1339 transitions.
[2024-05-22 07:43:05] [INFO ] Computation of Completed DNA matrix. took 122 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:43:05] [INFO ] Built C files in 1258ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin346503838476211042
Running compilation step : cd /tmp/ltsmin346503838476211042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin346503838476211042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin346503838476211042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 07:43:08] [INFO ] Flatten gal took : 192 ms
[2024-05-22 07:43:08] [INFO ] Flatten gal took : 195 ms
[2024-05-22 07:43:08] [INFO ] Time to serialize gal into /tmp/LTL647391533585738480.gal : 26 ms
[2024-05-22 07:43:08] [INFO ] Time to serialize properties into /tmp/LTL5365308034650537964.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL647391533585738480.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6629385914185276506.hoa' '-atoms' '/tmp/LTL5365308034650537964.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL5365308034650537964.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6629385914185276506.hoa
Detected timeout of ITS tools.
[2024-05-22 07:43:24] [INFO ] Flatten gal took : 190 ms
[2024-05-22 07:43:24] [INFO ] Flatten gal took : 195 ms
[2024-05-22 07:43:24] [INFO ] Time to serialize gal into /tmp/LTL3806393595493146193.gal : 26 ms
[2024-05-22 07:43:24] [INFO ] Time to serialize properties into /tmp/LTL7056256731191517364.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3806393595493146193.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7056256731191517364.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((p68==0)||(p99==0))||((p130==0)||(p161==0)))||(((p198==0)||(p223==0))||((p260==0)||(p291==0))))")||(("((p322==0)||(p353==0...253
Formula 0 simplified : G(F(!"(p33==0)" | G!"(((p6==1)&&(p9==1))&&((p163==1)&&(p382==1)))") & FG(!"((((p68==0)||(p99==0))||((p130==0)||(p161==0)))||(((p198=...242
Detected timeout of ITS tools.
[2024-05-22 07:43:39] [INFO ] Flatten gal took : 194 ms
[2024-05-22 07:43:39] [INFO ] Applying decomposition
[2024-05-22 07:43:39] [INFO ] Flatten gal took : 196 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17470996675351024034.txt' '-o' '/tmp/graph17470996675351024034.bin' '-w' '/tmp/graph17470996675351024034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17470996675351024034.bin' '-l' '-1' '-v' '-w' '/tmp/graph17470996675351024034.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:43:40] [INFO ] Decomposing Gal with order
[2024-05-22 07:43:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:43:40] [INFO ] Removed a total of 12002 redundant transitions.
[2024-05-22 07:43:40] [INFO ] Flatten gal took : 283 ms
[2024-05-22 07:43:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 98 ms.
[2024-05-22 07:43:41] [INFO ] Time to serialize gal into /tmp/LTL14350891554344566762.gal : 17 ms
[2024-05-22 07:43:41] [INFO ] Time to serialize properties into /tmp/LTL3200957624958442381.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14350891554344566762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3200957624958442381.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((i2.i0.u2.p68==0)||(i2.i0.u4.p99==0))||((i2.i0.u6.p130==0)||(i2.i0.u8.p161==0)))||(((i2.i0.u11.p198==0)||(i2.i1.u12.p223==...374
Formula 0 simplified : G(F(!"(u1.p33==0)" | G!"(((u0.p6==1)&&(u0.p9==1))&&((u0.p163==1)&&(u0.p382==1)))") & FG(!"((((i2.i0.u2.p68==0)||(i2.i0.u4.p99==0))||...363
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-09 finished in 207763 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)&&F(p1)))'
Support contains 15 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 314 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 349 transition count 1646
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 187 rules applied. Total rules applied 318 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 352 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 352 place count 185 transition count 1584
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 509 place count 107 transition count 1500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 510 place count 107 transition count 1499
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 525 place count 92 transition count 1353
Iterating global reduction 6 with 15 rules applied. Total rules applied 540 place count 92 transition count 1353
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 549 place count 92 transition count 1344
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 553 place count 90 transition count 1342
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 555 place count 88 transition count 1340
Applied a total of 555 rules in 304 ms. Remains 88 /352 variables (removed 264) and now considering 1340/1779 (removed 439) transitions.
// Phase 1: matrix 1340 rows 88 cols
[2024-05-22 07:43:56] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:43:56] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-22 07:43:56] [INFO ] Invariant cache hit.
[2024-05-22 07:43:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:43:57] [INFO ] Implicit Places using invariants and state equation in 912 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1295 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/352 places, 1340/1779 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 1339
Applied a total of 2 rules in 87 ms. Remains 85 /86 variables (removed 1) and now considering 1339/1340 (removed 1) transitions.
// Phase 1: matrix 1339 rows 85 cols
[2024-05-22 07:43:57] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 07:43:58] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-22 07:43:58] [INFO ] Invariant cache hit.
[2024-05-22 07:43:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:43:58] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/352 places, 1339/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2923 ms. Remains : 85/352 places, 1339/1779 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-10
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-10 finished in 3058 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((p0||F(G((p1 U !p2)))))))))'
Support contains 21 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 30 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 07:43:59] [INFO ] Computed 15 invariants in 11 ms
[2024-05-22 07:43:59] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-22 07:43:59] [INFO ] Invariant cache hit.
[2024-05-22 07:44:00] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 07:44:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
[2024-05-22 07:44:59] [INFO ] Deduced a trap composed of 31 places in 1549 ms of which 5 ms to minimize.
SMT process timed out in 59029ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 59051ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60396 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-11
Product exploration explored 100000 steps with 618 reset in 668 ms.
Product exploration explored 100000 steps with 494 reset in 519 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (307 resets) in 1527 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (43 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (72 resets) in 362 ms. (110 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (41 resets) in 243 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 315 ms. (126 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (59 resets) in 255 ms. (156 steps per ms) remains 3/4 properties
[2024-05-22 07:45:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 300/315 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 32/347 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1774/2121 variables, 347/362 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2121/2121 variables, and 362 constraints, problems are : Problem set: 1 solved, 2 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/315 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 07:45:04] [INFO ] Deduced a trap composed of 31 places in 1232 ms of which 3 ms to minimize.
[2024-05-22 07:45:05] [INFO ] Deduced a trap composed of 31 places in 1209 ms of which 3 ms to minimize.
[2024-05-22 07:45:07] [INFO ] Deduced a trap composed of 31 places in 1204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 3/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 32/347 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1774/2121 variables, 347/365 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 07:45:09] [INFO ] Deduced a trap composed of 31 places in 1376 ms of which 3 ms to minimize.
SMT process timed out in 6906ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 348 place count 183 transition count 1579
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 358 place count 178 transition count 1579
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 502 place count 106 transition count 1507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 503 place count 106 transition count 1506
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 522 place count 87 transition count 1317
Iterating global reduction 4 with 19 rules applied. Total rules applied 541 place count 87 transition count 1317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 551 place count 87 transition count 1307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 553 place count 86 transition count 1306
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 565 place count 86 transition count 1294
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 577 place count 74 transition count 1294
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 579 place count 74 transition count 1294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 580 place count 73 transition count 1293
Applied a total of 580 rules in 373 ms. Remains 73 /347 variables (removed 274) and now considering 1293/1774 (removed 481) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 73/347 places, 1293/1774 transitions.
RANDOM walk for 40000 steps (108 resets) in 2042 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (113 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (114 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 366700 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 2
Probabilistic random walk after 366700 steps, saw 55893 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 1293 rows 73 cols
[2024-05-22 07:45:13] [INFO ] Computed 15 invariants in 6 ms
[2024-05-22 07:45:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1290/1358 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1358 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/1366 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1366 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1366 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1366/1366 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:45:14] [INFO ] Deduced a trap composed of 8 places in 881 ms of which 1 ms to minimize.
[2024-05-22 07:45:15] [INFO ] Deduced a trap composed of 6 places in 884 ms of which 1 ms to minimize.
[2024-05-22 07:45:16] [INFO ] Deduced a trap composed of 6 places in 871 ms of which 1 ms to minimize.
[2024-05-22 07:45:17] [INFO ] Deduced a trap composed of 8 places in 888 ms of which 1 ms to minimize.
[2024-05-22 07:45:18] [INFO ] Deduced a trap composed of 7 places in 903 ms of which 1 ms to minimize.
[2024-05-22 07:45:19] [INFO ] Deduced a trap composed of 6 places in 863 ms of which 1 ms to minimize.
[2024-05-22 07:45:20] [INFO ] Deduced a trap composed of 8 places in 880 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1290/1358 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:45:21] [INFO ] Deduced a trap composed of 6 places in 903 ms of which 1 ms to minimize.
[2024-05-22 07:45:22] [INFO ] Deduced a trap composed of 6 places in 871 ms of which 1 ms to minimize.
[2024-05-22 07:45:23] [INFO ] Deduced a trap composed of 6 places in 827 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1358 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1358 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/1366 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1366 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1366 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1366 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1366 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1366/1366 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9593 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 10/10 constraints]
After SMT, in 10209ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1166 ms.
Support contains 15 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1293/1293 transitions.
Applied a total of 0 rules in 64 ms. Remains 73 /73 variables (removed 0) and now considering 1293/1293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 73/73 places, 1293/1293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1293/1293 transitions.
Applied a total of 0 rules in 65 ms. Remains 73 /73 variables (removed 0) and now considering 1293/1293 (removed 0) transitions.
[2024-05-22 07:45:24] [INFO ] Invariant cache hit.
[2024-05-22 07:45:25] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-22 07:45:25] [INFO ] Invariant cache hit.
[2024-05-22 07:45:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:45:26] [INFO ] Implicit Places using invariants and state equation in 874 ms returned [68, 72]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1222 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/73 places, 1292/1293 transitions.
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 2 place count 70 transition count 1291
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 70 transition count 1290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 69 transition count 1290
Applied a total of 4 rules in 145 ms. Remains 69 /71 variables (removed 2) and now considering 1290/1292 (removed 2) transitions.
// Phase 1: matrix 1290 rows 69 cols
[2024-05-22 07:45:26] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 07:45:26] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-22 07:45:26] [INFO ] Invariant cache hit.
[2024-05-22 07:45:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:45:27] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/73 places, 1290/1293 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2570 ms. Remains : 69/73 places, 1290/1293 transitions.
RANDOM walk for 40000 steps (27 resets) in 2082 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (113 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (115 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 364191 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 2
Probabilistic random walk after 364191 steps, saw 54416 distinct states, run finished after 3004 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-22 07:45:31] [INFO ] Invariant cache hit.
[2024-05-22 07:45:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1290/1357 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1359 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1359 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1359 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1359/1359 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:45:32] [INFO ] Deduced a trap composed of 6 places in 835 ms of which 1 ms to minimize.
[2024-05-22 07:45:33] [INFO ] Deduced a trap composed of 8 places in 815 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1290/1357 variables, 67/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:45:35] [INFO ] Deduced a trap composed of 6 places in 1108 ms of which 2 ms to minimize.
[2024-05-22 07:45:36] [INFO ] Deduced a trap composed of 6 places in 1074 ms of which 3 ms to minimize.
[2024-05-22 07:45:37] [INFO ] Deduced a trap composed of 8 places in 977 ms of which 2 ms to minimize.
[2024-05-22 07:45:38] [INFO ] Deduced a trap composed of 6 places in 895 ms of which 2 ms to minimize.
[2024-05-22 07:45:38] [INFO ] Deduced a trap composed of 8 places in 787 ms of which 1 ms to minimize.
[2024-05-22 07:45:39] [INFO ] Deduced a trap composed of 6 places in 806 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1357 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1357 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/1359 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1359 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1359 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 92 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8274 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 8/8 constraints]
After SMT, in 8913ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1146 ms.
Support contains 15 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1290/1290 transitions.
Applied a total of 0 rules in 63 ms. Remains 69 /69 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 69/69 places, 1290/1290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1290/1290 transitions.
Applied a total of 0 rules in 62 ms. Remains 69 /69 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
[2024-05-22 07:45:41] [INFO ] Invariant cache hit.
[2024-05-22 07:45:41] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-22 07:45:41] [INFO ] Invariant cache hit.
[2024-05-22 07:45:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:45:42] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2024-05-22 07:45:42] [INFO ] Redundant transitions in 55 ms returned []
Running 1279 sub problems to find dead transitions.
[2024-05-22 07:45:42] [INFO ] Invariant cache hit.
[2024-05-22 07:45:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 2 (OVERLAPS) 11/69 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
[2024-05-22 07:46:19] [INFO ] Deduced a trap composed of 6 places in 973 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1279 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 Real declared 69/1359 variables, and 14 constraints, problems are : Problem set: 0 solved, 1279 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/69 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1279/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 2 (OVERLAPS) 11/69 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
Problem TDEAD1289 is UNSAT
At refinement iteration 5 (OVERLAPS) 1290/1359 variables, 69/83 constraints. Problems are: Problem set: 1 solved, 1278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1359 variables, 2/85 constraints. Problems are: Problem set: 1 solved, 1278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1359 variables, 32/117 constraints. Problems are: Problem set: 1 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 117 constraints, problems are : Problem set: 1 solved, 1278 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1279/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 83558ms problems are : Problem set: 1 solved, 1278 unsolved
Search for dead transitions found 1 dead transitions in 83573ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/69 places, 1289/1290 transitions.
Applied a total of 0 rules in 66 ms. Remains 69 /69 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2024-05-22 07:47:06] [INFO ] Redundant transitions in 44 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84988 ms. Remains : 69/69 places, 1289/1290 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 15 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 11 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 07:47:06] [INFO ] Computed 15 invariants in 12 ms
[2024-05-22 07:47:07] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-22 07:47:07] [INFO ] Invariant cache hit.
[2024-05-22 07:47:08] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 07:47:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
[2024-05-22 07:48:07] [INFO ] Deduced a trap composed of 31 places in 1563 ms of which 4 ms to minimize.
SMT process timed out in 59076ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 59098ms
Finished structural reductions in LTL mode , in 1 iterations and 60412 ms. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (305 resets) in 771 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (57 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 235610 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 235610 steps, saw 43667 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-22 07:48:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/347 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1774/2121 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2121/2121 variables, and 362 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/347 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1774/2121 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2121 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2121/2121 variables, and 362 constraints, problems are : Problem set: 0 solved, 2 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2099ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1593 ms.
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 348 place count 183 transition count 1579
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 358 place count 178 transition count 1579
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 502 place count 106 transition count 1507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 503 place count 106 transition count 1506
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 518 place count 91 transition count 1361
Iterating global reduction 4 with 15 rules applied. Total rules applied 533 place count 91 transition count 1361
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 543 place count 91 transition count 1351
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 5 with 2 rules applied. Total rules applied 545 place count 90 transition count 1350
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 561 place count 90 transition count 1334
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 577 place count 74 transition count 1334
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 583 place count 74 transition count 1334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 584 place count 73 transition count 1333
Applied a total of 584 rules in 376 ms. Remains 73 /347 variables (removed 274) and now considering 1333/1774 (removed 441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 73/347 places, 1333/1774 transitions.
RANDOM walk for 40000 steps (104 resets) in 1846 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (164 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (135 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 361292 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 2
Probabilistic random walk after 361292 steps, saw 55551 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 1333 rows 73 cols
[2024-05-22 07:48:18] [INFO ] Computed 15 invariants in 6 ms
[2024-05-22 07:48:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1330/1398 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1398 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/1406 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1406 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1406 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1406 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1406 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1406/1406 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1330/1398 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1398 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/1406 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1406 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1406 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1406 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1406 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1406/1406 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1414ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1076 ms.
Support contains 15 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1333/1333 transitions.
Applied a total of 0 rules in 65 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 73/73 places, 1333/1333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1333/1333 transitions.
Applied a total of 0 rules in 66 ms. Remains 73 /73 variables (removed 0) and now considering 1333/1333 (removed 0) transitions.
[2024-05-22 07:48:21] [INFO ] Invariant cache hit.
[2024-05-22 07:48:21] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-22 07:48:21] [INFO ] Invariant cache hit.
[2024-05-22 07:48:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:48:22] [INFO ] Implicit Places using invariants and state equation in 811 ms returned [68, 72]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1139 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/73 places, 1332/1333 transitions.
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 2 place count 70 transition count 1331
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 70 transition count 1330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 69 transition count 1330
Applied a total of 4 rules in 146 ms. Remains 69 /71 variables (removed 2) and now considering 1330/1332 (removed 2) transitions.
// Phase 1: matrix 1330 rows 69 cols
[2024-05-22 07:48:22] [INFO ] Computed 13 invariants in 9 ms
[2024-05-22 07:48:22] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-22 07:48:23] [INFO ] Invariant cache hit.
[2024-05-22 07:48:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:48:23] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/73 places, 1330/1333 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2411 ms. Remains : 69/73 places, 1330/1333 transitions.
RANDOM walk for 40000 steps (27 resets) in 1924 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (164 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (135 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 363597 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 2
Probabilistic random walk after 363597 steps, saw 54854 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-22 07:48:27] [INFO ] Invariant cache hit.
[2024-05-22 07:48:27] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1330/1397 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1397 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1397 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1399 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1399 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1399 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1399/1399 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1330/1397 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1397 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1397 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1399 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1399 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1399 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1399/1399 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1378ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1053 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1330/1330 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 69 transition count 1329
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 2 place count 68 transition count 1329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 63 transition count 1324
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 58 transition count 1319
Applied a total of 22 rules in 132 ms. Remains 58 /69 variables (removed 11) and now considering 1319/1330 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 58/69 places, 1319/1330 transitions.
RANDOM walk for 40000 steps (39 resets) in 1023 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (146 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 520638 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 520638 steps, saw 71731 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
// Phase 1: matrix 1319 rows 58 cols
[2024-05-22 07:48:33] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 07:48:33] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1292/1312 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1312 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1312 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1377 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1377 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1377 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1377 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1377/1377 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1292/1312 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1312 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1312 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1377 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1377 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1377 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1377 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1377/1377 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1148ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1319/1319 transitions.
Applied a total of 0 rules in 90 ms. Remains 58 /58 variables (removed 0) and now considering 1319/1319 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 58/58 places, 1319/1319 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1319/1319 transitions.
Applied a total of 0 rules in 83 ms. Remains 58 /58 variables (removed 0) and now considering 1319/1319 (removed 0) transitions.
[2024-05-22 07:48:34] [INFO ] Invariant cache hit.
[2024-05-22 07:48:35] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-22 07:48:35] [INFO ] Invariant cache hit.
[2024-05-22 07:48:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:48:36] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2024-05-22 07:48:36] [INFO ] Redundant transitions in 57 ms returned []
Running 1317 sub problems to find dead transitions.
[2024-05-22 07:48:36] [INFO ] Invariant cache hit.
[2024-05-22 07:48:36] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
Problem TDEAD144 is UNSAT
At refinement iteration 4 (OVERLAPS) 1319/1377 variables, 58/71 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1377 variables, 2/73 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1377/1377 variables, and 73 constraints, problems are : Problem set: 1 solved, 1316 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1317/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
At refinement iteration 4 (OVERLAPS) 1319/1377 variables, 58/71 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1377 variables, 2/73 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1377 variables, 31/104 constraints. Problems are: Problem set: 1 solved, 1316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1377/1377 variables, and 104 constraints, problems are : Problem set: 1 solved, 1316 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1316/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 83807ms problems are : Problem set: 1 solved, 1316 unsolved
Search for dead transitions found 1 dead transitions in 83824ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/58 places, 1318/1319 transitions.
Applied a total of 0 rules in 84 ms. Remains 58 /58 variables (removed 0) and now considering 1318/1318 (removed 0) transitions.
[2024-05-22 07:50:00] [INFO ] Redundant transitions in 45 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 85852 ms. Remains : 58/58 places, 1318/1319 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 60 reset in 201 ms.
Product exploration explored 100000 steps with 240 reset in 307 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 148 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 148 place count 345 transition count 1749
Deduced a syphon composed of 149 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 173 place count 345 transition count 1749
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 280 place count 238 transition count 1642
Deduced a syphon composed of 43 places in 2 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 387 place count 238 transition count 1642
Performed 87 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 2 with 87 rules applied. Total rules applied 474 place count 238 transition count 1655
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 476 place count 238 transition count 1653
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 543 place count 171 transition count 1456
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 3 with 67 rules applied. Total rules applied 610 place count 171 transition count 1456
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 630 place count 171 transition count 1436
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 641 place count 160 transition count 1425
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 652 place count 160 transition count 1425
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 653 place count 160 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 655 place count 158 transition count 1423
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 657 place count 158 transition count 1423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 658 place count 158 transition count 1425
Deduced a syphon composed of 67 places in 0 ms
Applied a total of 658 rules in 289 ms. Remains 158 /347 variables (removed 189) and now considering 1425/1774 (removed 349) transitions.
[2024-05-22 07:50:02] [INFO ] Redundant transitions in 52 ms returned []
Running 1424 sub problems to find dead transitions.
// Phase 1: matrix 1425 rows 158 cols
[2024-05-22 07:50:02] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 07:50:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1424 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1424 unsolved
[2024-05-22 07:50:40] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 2 ms to minimize.
[2024-05-22 07:50:41] [INFO ] Deduced a trap composed of 6 places in 1047 ms of which 2 ms to minimize.
[2024-05-22 07:50:43] [INFO ] Deduced a trap composed of 5 places in 1087 ms of which 2 ms to minimize.
[2024-05-22 07:50:44] [INFO ] Deduced a trap composed of 6 places in 1032 ms of which 2 ms to minimize.
[2024-05-22 07:50:45] [INFO ] Deduced a trap composed of 16 places in 1059 ms of which 2 ms to minimize.
[2024-05-22 07:50:46] [INFO ] Deduced a trap composed of 7 places in 1006 ms of which 2 ms to minimize.
[2024-05-22 07:50:46] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 07:50:47] [INFO ] Deduced a trap composed of 35 places in 1021 ms of which 2 ms to minimize.
[2024-05-22 07:50:48] [INFO ] Deduced a trap composed of 8 places in 933 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-22 07:50:49] [INFO ] Deduced a trap composed of 8 places in 999 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-22 07:50:50] [INFO ] Deduced a trap composed of 8 places in 967 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 07:50:51] [INFO ] Deduced a trap composed of 8 places in 954 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-22 07:50:52] [INFO ] Deduced a trap composed of 8 places in 944 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-22 07:50:53] [INFO ] Deduced a trap composed of 9 places in 940 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-22 07:50:54] [INFO ] Deduced a trap composed of 16 places in 1193 ms of which 2 ms to minimize.
[2024-05-22 07:50:56] [INFO ] Deduced a trap composed of 16 places in 1149 ms of which 3 ms to minimize.
[2024-05-22 07:50:57] [INFO ] Deduced a trap composed of 14 places in 1101 ms of which 3 ms to minimize.
[2024-05-22 07:50:58] [INFO ] Deduced a trap composed of 19 places in 1034 ms of which 2 ms to minimize.
SMT process timed out in 55605ms, After SMT, problems are : Problem set: 0 solved, 1424 unsolved
Search for dead transitions found 0 dead transitions in 55623ms
Starting structural reductions in SI_LTL mode, iteration 1 : 158/347 places, 1425/1774 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55976 ms. Remains : 158/347 places, 1425/1774 transitions.
Built C files in :
/tmp/ltsmin1818113030349355441
[2024-05-22 07:50:58] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1818113030349355441
Running compilation step : cd /tmp/ltsmin1818113030349355441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1818113030349355441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1818113030349355441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 22 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 07:51:01] [INFO ] Computed 15 invariants in 13 ms
[2024-05-22 07:51:01] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-22 07:51:01] [INFO ] Invariant cache hit.
[2024-05-22 07:51:03] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 07:51:03] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 57444ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 57468ms
Finished structural reductions in LTL mode , in 1 iterations and 59227 ms. Remains : 347/347 places, 1774/1774 transitions.
Built C files in :
/tmp/ltsmin5325399720787766046
[2024-05-22 07:52:00] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5325399720787766046
Running compilation step : cd /tmp/ltsmin5325399720787766046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5325399720787766046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5325399720787766046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 07:52:04] [INFO ] Flatten gal took : 279 ms
[2024-05-22 07:52:04] [INFO ] Flatten gal took : 284 ms
[2024-05-22 07:52:04] [INFO ] Time to serialize gal into /tmp/LTL13091378541270697208.gal : 31 ms
[2024-05-22 07:52:04] [INFO ] Time to serialize properties into /tmp/LTL9133651575106295941.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13091378541270697208.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16699831636845505366.hoa' '-atoms' '/tmp/LTL9133651575106295941.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9133651575106295941.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16699831636845505366.hoa
Detected timeout of ITS tools.
[2024-05-22 07:52:19] [INFO ] Flatten gal took : 158 ms
[2024-05-22 07:52:19] [INFO ] Flatten gal took : 162 ms
[2024-05-22 07:52:19] [INFO ] Time to serialize gal into /tmp/LTL11783583280350743827.gal : 29 ms
[2024-05-22 07:52:19] [INFO ] Time to serialize properties into /tmp/LTL17547358633542086802.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11783583280350743827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17547358633542086802.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((F(G(("(((((p74==1)&&(p99==1))&&((p136==1)&&(p167==1)))&&(((p198==1)&&(p229==1))&&((p260==1)&&(p291==1))))&&(((p322==1)&&(p...384
Formula 0 simplified : XXXX(!"(((((p74==1)&&(p105==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&((p254==1)&&(p291==1))))&&(((p322==1)&&(p347==1))...367
Detected timeout of ITS tools.
[2024-05-22 07:52:35] [INFO ] Flatten gal took : 178 ms
[2024-05-22 07:52:35] [INFO ] Applying decomposition
[2024-05-22 07:52:35] [INFO ] Flatten gal took : 157 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6449024794105992998.txt' '-o' '/tmp/graph6449024794105992998.bin' '-w' '/tmp/graph6449024794105992998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6449024794105992998.bin' '-l' '-1' '-v' '-w' '/tmp/graph6449024794105992998.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:52:35] [INFO ] Decomposing Gal with order
[2024-05-22 07:52:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:52:36] [INFO ] Removed a total of 11968 redundant transitions.
[2024-05-22 07:52:36] [INFO ] Flatten gal took : 344 ms
[2024-05-22 07:52:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 56 ms.
[2024-05-22 07:52:36] [INFO ] Time to serialize gal into /tmp/LTL13946320866142043298.gal : 11 ms
[2024-05-22 07:52:36] [INFO ] Time to serialize properties into /tmp/LTL14837196998037429311.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13946320866142043298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14837196998037429311.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((F(G(("(((((i8.u20.p74==1)&&(i8.u26.p99==1))&&((i8.u37.p136==1)&&(i8.u44.p167==1)))&&(((i8.u51.p198==1)&&(i8.u58.p229==1))&...563
Formula 0 simplified : XXXX(!"(((((i8.u20.p74==1)&&(i8.u28.p105==1))&&((i8.u37.p136==1)&&(i8.u42.p161==1)))&&(((i8.u49.p192==1)&&(i8.u56.p223==1))&&((i8.u6...546
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-11 finished in 532283 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(p0)))))'
Support contains 11 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 36 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
[2024-05-22 07:52:51] [INFO ] Invariant cache hit.
[2024-05-22 07:52:51] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-22 07:52:51] [INFO ] Invariant cache hit.
[2024-05-22 07:52:53] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 07:52:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 347/2121 variables, and 15 constraints, problems are : Problem set: 0 solved, 1773 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 0/347 constraints, PredecessorRefiner: 1773/347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1773 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
[2024-05-22 07:54:12] [INFO ] Deduced a trap composed of 31 places in 2036 ms of which 6 ms to minimize.
[2024-05-22 07:54:14] [INFO ] Deduced a trap composed of 23 places in 1916 ms of which 3 ms to minimize.
[2024-05-22 07:54:15] [INFO ] Deduced a trap composed of 67 places in 1690 ms of which 4 ms to minimize.
[2024-05-22 07:54:16] [INFO ] Deduced a trap composed of 40 places in 518 ms of which 1 ms to minimize.
[2024-05-22 07:54:19] [INFO ] Deduced a trap composed of 38 places in 1991 ms of which 4 ms to minimize.
[2024-05-22 07:54:21] [INFO ] Deduced a trap composed of 31 places in 1758 ms of which 3 ms to minimize.
SMT process timed out in 88127ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 88148ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89904 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-12
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-12 finished in 90012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 11 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 314 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 350 place count 186 transition count 1583
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 367 place count 176 transition count 1580
Iterating global reduction 3 with 3 rules applied. Total rules applied 370 place count 176 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 371 place count 175 transition count 1570
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 175 transition count 1570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 374 place count 175 transition count 1568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 375 place count 174 transition count 1568
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 511 place count 106 transition count 1499
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 512 place count 106 transition count 1498
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 528 place count 90 transition count 1341
Iterating global reduction 6 with 16 rules applied. Total rules applied 544 place count 90 transition count 1341
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 553 place count 90 transition count 1332
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 7 with 4 rules applied. Total rules applied 557 place count 88 transition count 1330
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 559 place count 86 transition count 1328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 560 place count 85 transition count 1328
Applied a total of 560 rules in 347 ms. Remains 85 /352 variables (removed 267) and now considering 1328/1779 (removed 451) transitions.
// Phase 1: matrix 1328 rows 85 cols
[2024-05-22 07:54:21] [INFO ] Computed 13 invariants in 12 ms
[2024-05-22 07:54:22] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-22 07:54:22] [INFO ] Invariant cache hit.
[2024-05-22 07:54:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:54:23] [INFO ] Implicit Places using invariants and state equation in 999 ms returned [80, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1500 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/352 places, 1328/1779 transitions.
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 2 place count 82 transition count 1327
Applied a total of 2 rules in 90 ms. Remains 82 /83 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
// Phase 1: matrix 1327 rows 82 cols
[2024-05-22 07:54:23] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 07:54:23] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-22 07:54:23] [INFO ] Invariant cache hit.
[2024-05-22 07:54:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:54:24] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1443 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/352 places, 1327/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3380 ms. Remains : 82/352 places, 1327/1779 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-13
Product exploration explored 100000 steps with 373 reset in 358 ms.
Product exploration explored 100000 steps with 2053 reset in 1060 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1445 resets) in 847 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 15767 steps (40 resets) in 56 ms. (276 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 1327/1327 transitions.
Applied a total of 0 rules in 73 ms. Remains 82 /82 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-22 07:54:26] [INFO ] Invariant cache hit.
[2024-05-22 07:54:27] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-22 07:54:27] [INFO ] Invariant cache hit.
[2024-05-22 07:54:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:54:28] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2024-05-22 07:54:28] [INFO ] Redundant transitions in 83 ms returned [1084]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1318 sub problems to find dead transitions.
// Phase 1: matrix 1326 rows 82 cols
[2024-05-22 07:54:28] [INFO ] Computed 11 invariants in 10 ms
[2024-05-22 07:54:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 2 (OVERLAPS) 6/80 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 80/1408 variables, and 11 constraints, problems are : Problem set: 0 solved, 1318 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/82 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1318/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 2 (OVERLAPS) 6/80 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 80/1408 variables, and 11 constraints, problems are : Problem set: 0 solved, 1318 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/82 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1266/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 85474ms problems are : Problem set: 0 solved, 1318 unsolved
Search for dead transitions found 0 dead transitions in 85498ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 1326/1327 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 80 transition count 1324
Applied a total of 2 rules in 147 ms. Remains 80 /82 variables (removed 2) and now considering 1324/1326 (removed 2) transitions.
// Phase 1: matrix 1324 rows 80 cols
[2024-05-22 07:55:54] [INFO ] Computed 11 invariants in 13 ms
[2024-05-22 07:55:55] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-22 07:55:55] [INFO ] Invariant cache hit.
[2024-05-22 07:55:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:55:56] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/82 places, 1324/1327 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89461 ms. Remains : 80/82 places, 1324/1327 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1506 resets) in 1104 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 9820 steps (26 resets) in 42 ms. (228 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 980 reset in 717 ms.
Product exploration explored 100000 steps with 1156 reset in 816 ms.
Built C files in :
/tmp/ltsmin17736113551051641743
[2024-05-22 07:55:58] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2024-05-22 07:55:59] [INFO ] Computation of Complete disable matrix. took 452 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:55:59] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2024-05-22 07:55:59] [INFO ] Computation of Complete enable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:55:59] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2024-05-22 07:55:59] [INFO ] Computation of Completed DNA matrix. took 119 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:56:00] [INFO ] Built C files in 1223ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17736113551051641743
Running compilation step : cd /tmp/ltsmin17736113551051641743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17736113551051641743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17736113551051641743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 1324/1324 transitions.
Applied a total of 0 rules in 76 ms. Remains 80 /80 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-22 07:56:03] [INFO ] Invariant cache hit.
[2024-05-22 07:56:03] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-22 07:56:03] [INFO ] Invariant cache hit.
[2024-05-22 07:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:56:04] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
[2024-05-22 07:56:04] [INFO ] Redundant transitions in 70 ms returned []
Running 1317 sub problems to find dead transitions.
[2024-05-22 07:56:04] [INFO ] Invariant cache hit.
[2024-05-22 07:56:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 2 (OVERLAPS) 6/79 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 79/1404 variables, and 11 constraints, problems are : Problem set: 0 solved, 1317 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/80 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1317/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 2 (OVERLAPS) 6/79 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 4 (OVERLAPS) 1323/1402 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1402 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 1317 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 1402/1404 variables, and 120 constraints, problems are : Problem set: 0 solved, 1317 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 79/80 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1298/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 86781ms problems are : Problem set: 0 solved, 1317 unsolved
Search for dead transitions found 0 dead transitions in 86802ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 88297 ms. Remains : 80/80 places, 1324/1324 transitions.
Built C files in :
/tmp/ltsmin4927137819646580037
[2024-05-22 07:57:31] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2024-05-22 07:57:31] [INFO ] Computation of Complete disable matrix. took 462 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:57:31] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2024-05-22 07:57:32] [INFO ] Computation of Complete enable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:57:32] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2024-05-22 07:57:32] [INFO ] Computation of Completed DNA matrix. took 128 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:57:32] [INFO ] Built C files in 1256ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4927137819646580037
Running compilation step : cd /tmp/ltsmin4927137819646580037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4927137819646580037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4927137819646580037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 07:57:35] [INFO ] Flatten gal took : 192 ms
[2024-05-22 07:57:36] [INFO ] Flatten gal took : 194 ms
[2024-05-22 07:57:36] [INFO ] Time to serialize gal into /tmp/LTL4596452607640810244.gal : 27 ms
[2024-05-22 07:57:36] [INFO ] Time to serialize properties into /tmp/LTL12088776492372019728.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4596452607640810244.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5997516338653272676.hoa' '-atoms' '/tmp/LTL12088776492372019728.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12088776492372019728.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5997516338653272676.hoa
Detected timeout of ITS tools.
[2024-05-22 07:57:51] [INFO ] Flatten gal took : 193 ms
[2024-05-22 07:57:51] [INFO ] Flatten gal took : 197 ms
[2024-05-22 07:57:51] [INFO ] Time to serialize gal into /tmp/LTL11180718198645233208.gal : 28 ms
[2024-05-22 07:57:51] [INFO ] Time to serialize properties into /tmp/LTL14934288717961976704.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11180718198645233208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14934288717961976704.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((p68!=1)||(p105!=1))||((p136!=1)||(p161!=1)))||(((p198!=1)||(p223!=1))||((p260!=1)||(p285!=1))))||(((p322!=1)||(p353!=1))|...172
Formula 0 simplified : GF!"(((((p68!=1)||(p105!=1))||((p136!=1)||(p161!=1)))||(((p198!=1)||(p223!=1))||((p260!=1)||(p285!=1))))||(((p322!=1)||(p353!=1))||(...166
Detected timeout of ITS tools.
[2024-05-22 07:58:06] [INFO ] Flatten gal took : 196 ms
[2024-05-22 07:58:06] [INFO ] Applying decomposition
[2024-05-22 07:58:07] [INFO ] Flatten gal took : 203 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9490776599942707312.txt' '-o' '/tmp/graph9490776599942707312.bin' '-w' '/tmp/graph9490776599942707312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9490776599942707312.bin' '-l' '-1' '-v' '-w' '/tmp/graph9490776599942707312.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:58:07] [INFO ] Decomposing Gal with order
[2024-05-22 07:58:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:58:08] [INFO ] Removed a total of 11976 redundant transitions.
[2024-05-22 07:58:08] [INFO ] Flatten gal took : 303 ms
[2024-05-22 07:58:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 142 ms.
[2024-05-22 07:58:08] [INFO ] Time to serialize gal into /tmp/LTL12944063971687915473.gal : 13 ms
[2024-05-22 07:58:08] [INFO ] Time to serialize properties into /tmp/LTL7553631918563505523.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12944063971687915473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7553631918563505523.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((i0.i1.u0.p68!=1)||(i0.i1.u3.p105!=1))||((i0.i0.u5.p136!=1)||(i0.i1.u6.p161!=1)))||(((i0.i1.u9.p198!=1)||(i0.i0.u10.p223!=...276
Formula 0 simplified : GF!"(((((i0.i1.u0.p68!=1)||(i0.i1.u3.p105!=1))||((i0.i0.u5.p136!=1)||(i0.i1.u6.p161!=1)))||(((i0.i1.u9.p198!=1)||(i0.i0.u10.p223!=1)...270
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-13 finished in 241963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U (F(p3)&&p2)))'
Support contains 21 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 301 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 349 transition count 1648
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 185 rules applied. Total rules applied 314 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 348 place count 187 transition count 1591
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 187 transition count 1585
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 360 place count 181 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 362 place count 179 transition count 1583
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 179 transition count 1583
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 490 place count 116 transition count 1519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 491 place count 116 transition count 1518
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 505 place count 102 transition count 1383
Iterating global reduction 4 with 14 rules applied. Total rules applied 519 place count 102 transition count 1383
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 528 place count 102 transition count 1374
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 5 with 4 rules applied. Total rules applied 532 place count 100 transition count 1372
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 533 place count 99 transition count 1371
Applied a total of 533 rules in 261 ms. Remains 99 /352 variables (removed 253) and now considering 1371/1779 (removed 408) transitions.
// Phase 1: matrix 1371 rows 99 cols
[2024-05-22 07:58:23] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 07:58:23] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-22 07:58:23] [INFO ] Invariant cache hit.
[2024-05-22 07:58:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:58:24] [INFO ] Implicit Places using invariants and state equation in 734 ms returned [94, 98]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 985 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/352 places, 1371/1779 transitions.
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 2 place count 96 transition count 1370
Applied a total of 2 rules in 87 ms. Remains 96 /97 variables (removed 1) and now considering 1370/1371 (removed 1) transitions.
// Phase 1: matrix 1370 rows 96 cols
[2024-05-22 07:58:24] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 07:58:24] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-22 07:58:24] [INFO ] Invariant cache hit.
[2024-05-22 07:58:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:58:25] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/352 places, 1370/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2281 ms. Remains : 96/352 places, 1370/1779 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-14
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-14 finished in 2442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(G(F(p0))||p1))))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 42 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 07:58:25] [INFO ] Computed 15 invariants in 12 ms
[2024-05-22 07:58:26] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-22 07:58:26] [INFO ] Invariant cache hit.
[2024-05-22 07:58:28] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2418 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 07:58:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
[2024-05-22 07:59:26] [INFO ] Deduced a trap composed of 31 places in 1466 ms of which 4 ms to minimize.
SMT process timed out in 58595ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 58617ms
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61082 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15
Product exploration explored 100000 steps with 26 reset in 183 ms.
Product exploration explored 100000 steps with 271 reset in 314 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (305 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (42 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 302406 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 302406 steps, saw 55419 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-22 07:59:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/347 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:59:32] [INFO ] Deduced a trap composed of 31 places in 1317 ms of which 3 ms to minimize.
[2024-05-22 07:59:33] [INFO ] Deduced a trap composed of 32 places in 1344 ms of which 3 ms to minimize.
[2024-05-22 07:59:34] [INFO ] Deduced a trap composed of 31 places in 1269 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1774/2121 variables, 347/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:59:36] [INFO ] Deduced a trap composed of 31 places in 1138 ms of which 3 ms to minimize.
SMT process timed out in 5989ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 183 transition count 1578
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 360 place count 177 transition count 1578
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1295
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 575 place count 75 transition count 1285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 577 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 588 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 599 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 62 transition count 1272
Applied a total of 601 rules in 477 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 62/347 places, 1272/1774 transitions.
RANDOM walk for 40000 steps (126 resets) in 1098 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (140 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 526786 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 526786 steps, saw 75188 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 1272 rows 62 cols
[2024-05-22 07:59:40] [INFO ] Computed 15 invariants in 7 ms
[2024-05-22 07:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1100ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 77 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 62/62 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 77 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-22 07:59:42] [INFO ] Invariant cache hit.
[2024-05-22 07:59:42] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-22 07:59:42] [INFO ] Invariant cache hit.
[2024-05-22 07:59:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 07:59:43] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned [57, 61]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1833 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 1271/1272 transitions.
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 2 place count 59 transition count 1270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 1269
Applied a total of 4 rules in 174 ms. Remains 58 /60 variables (removed 2) and now considering 1269/1271 (removed 2) transitions.
// Phase 1: matrix 1269 rows 58 cols
[2024-05-22 07:59:44] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 07:59:44] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-22 07:59:44] [INFO ] Invariant cache hit.
[2024-05-22 07:59:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:59:45] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 1269/1272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3885 ms. Remains : 58/62 places, 1269/1272 transitions.
RANDOM walk for 40000 steps (52 resets) in 973 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (139 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 514541 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 514541 steps, saw 71237 distinct states, run finished after 3004 ms. (steps per millisecond=171 ) properties seen :0
[2024-05-22 07:59:49] [INFO ] Invariant cache hit.
[2024-05-22 07:59:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1094ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 79 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 79 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2024-05-22 07:59:50] [INFO ] Invariant cache hit.
[2024-05-22 07:59:51] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-22 07:59:51] [INFO ] Invariant cache hit.
[2024-05-22 07:59:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:59:52] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
[2024-05-22 07:59:52] [INFO ] Redundant transitions in 56 ms returned []
Running 1267 sub problems to find dead transitions.
[2024-05-22 07:59:52] [INFO ] Invariant cache hit.
[2024-05-22 07:59:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
SMT process timed out in 53844ms, After SMT, problems are : Problem set: 0 solved, 1267 unsolved
Search for dead transitions found 0 dead transitions in 53861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55777 ms. Remains : 58/58 places, 1269/1269 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1011 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 1268
Applied a total of 2 rules in 90 ms. Remains 57 /58 variables (removed 1) and now considering 1268/1269 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2024-05-22 08:00:46] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 08:00:46] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 08:00:46] [INFO ] After 484ms SMT Verify possible using After timeout in real domain returned unsat :0 sat :1
[2024-05-22 08:00:46] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 668 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 13 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:00:47] [INFO ] Computed 15 invariants in 12 ms
[2024-05-22 08:00:47] [INFO ] Implicit Places using invariants in 827 ms returned []
[2024-05-22 08:00:47] [INFO ] Invariant cache hit.
[2024-05-22 08:00:49] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 2430 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:00:49] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
SMT process timed out in 57431ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 57454ms
Finished structural reductions in LTL mode , in 1 iterations and 59904 ms. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (244 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (44 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 299558 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 299558 steps, saw 54924 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-22 08:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/347 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:01:51] [INFO ] Deduced a trap composed of 31 places in 1235 ms of which 3 ms to minimize.
[2024-05-22 08:01:53] [INFO ] Deduced a trap composed of 32 places in 1258 ms of which 3 ms to minimize.
[2024-05-22 08:01:54] [INFO ] Deduced a trap composed of 31 places in 1295 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1774/2121 variables, 347/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:01:56] [INFO ] Deduced a trap composed of 31 places in 1062 ms of which 4 ms to minimize.
SMT process timed out in 5769ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 183 transition count 1578
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 360 place count 177 transition count 1578
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1295
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 575 place count 75 transition count 1285
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 5 with 2 rules applied. Total rules applied 577 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 588 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 599 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 62 transition count 1272
Applied a total of 601 rules in 454 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 62/347 places, 1272/1774 transitions.
RANDOM walk for 40000 steps (134 resets) in 1076 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (139 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 520844 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 520844 steps, saw 74528 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
// Phase 1: matrix 1272 rows 62 cols
[2024-05-22 08:02:00] [INFO ] Computed 15 invariants in 7 ms
[2024-05-22 08:02:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1263 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1263 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/1334 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1334 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1334/1334 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1119ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 81 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 62/62 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 80 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-22 08:02:01] [INFO ] Invariant cache hit.
[2024-05-22 08:02:02] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-22 08:02:02] [INFO ] Invariant cache hit.
[2024-05-22 08:02:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:02:03] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned [57, 61]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1924 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 1271/1272 transitions.
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 2 place count 59 transition count 1270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 1269
Applied a total of 4 rules in 164 ms. Remains 58 /60 variables (removed 2) and now considering 1269/1271 (removed 2) transitions.
// Phase 1: matrix 1269 rows 58 cols
[2024-05-22 08:02:03] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 08:02:04] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-22 08:02:04] [INFO ] Invariant cache hit.
[2024-05-22 08:02:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:02:05] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 1269/1272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4004 ms. Remains : 58/62 places, 1269/1272 transitions.
RANDOM walk for 40000 steps (37 resets) in 978 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (137 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 554537 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 554537 steps, saw 76018 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-05-22 08:02:08] [INFO ] Invariant cache hit.
[2024-05-22 08:02:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1262 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/1327 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1327 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1327/1327 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1103ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 75 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 74 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2024-05-22 08:02:09] [INFO ] Invariant cache hit.
[2024-05-22 08:02:10] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-22 08:02:10] [INFO ] Invariant cache hit.
[2024-05-22 08:02:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:02:11] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2024-05-22 08:02:11] [INFO ] Redundant transitions in 59 ms returned []
Running 1267 sub problems to find dead transitions.
[2024-05-22 08:02:11] [INFO ] Invariant cache hit.
[2024-05-22 08:02:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
SMT process timed out in 53895ms, After SMT, problems are : Problem set: 0 solved, 1267 unsolved
Search for dead transitions found 0 dead transitions in 53910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55849 ms. Remains : 58/58 places, 1269/1269 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1011 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 1268
Applied a total of 2 rules in 94 ms. Remains 57 /58 variables (removed 1) and now considering 1268/1269 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2024-05-22 08:03:05] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 08:03:05] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 08:03:06] [INFO ] After 501ms SMT Verify possible using After timeout in real domain returned unsat :0 sat :1
[2024-05-22 08:03:06] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 676 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 769 reset in 575 ms.
Product exploration explored 100000 steps with 771 reset in 594 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 148 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 148 place count 345 transition count 1749
Deduced a syphon composed of 149 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 173 place count 345 transition count 1749
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 280 place count 238 transition count 1642
Deduced a syphon composed of 43 places in 2 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 387 place count 238 transition count 1642
Performed 98 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 485 place count 238 transition count 1655
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 487 place count 238 transition count 1653
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 570 place count 155 transition count 1390
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 3 with 83 rules applied. Total rules applied 653 place count 155 transition count 1390
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 673 place count 155 transition count 1370
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 684 place count 144 transition count 1359
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 695 place count 144 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 696 place count 144 transition count 1359
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 698 place count 142 transition count 1357
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 700 place count 142 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 701 place count 142 transition count 1359
Deduced a syphon composed of 67 places in 1 ms
Applied a total of 701 rules in 307 ms. Remains 142 /347 variables (removed 205) and now considering 1359/1774 (removed 415) transitions.
[2024-05-22 08:03:08] [INFO ] Redundant transitions in 56 ms returned []
Running 1358 sub problems to find dead transitions.
// Phase 1: matrix 1359 rows 142 cols
[2024-05-22 08:03:08] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 08:03:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1358 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1358 unsolved
[2024-05-22 08:03:44] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-22 08:03:45] [INFO ] Deduced a trap composed of 5 places in 958 ms of which 2 ms to minimize.
[2024-05-22 08:03:46] [INFO ] Deduced a trap composed of 4 places in 913 ms of which 2 ms to minimize.
[2024-05-22 08:03:46] [INFO ] Deduced a trap composed of 5 places in 929 ms of which 2 ms to minimize.
[2024-05-22 08:03:47] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 08:03:48] [INFO ] Deduced a trap composed of 8 places in 881 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-22 08:03:49] [INFO ] Deduced a trap composed of 14 places in 874 ms of which 1 ms to minimize.
[2024-05-22 08:03:49] [INFO ] Deduced a trap composed of 14 places in 853 ms of which 1 ms to minimize.
[2024-05-22 08:03:50] [INFO ] Deduced a trap composed of 14 places in 799 ms of which 2 ms to minimize.
[2024-05-22 08:03:51] [INFO ] Deduced a trap composed of 14 places in 756 ms of which 1 ms to minimize.
[2024-05-22 08:03:52] [INFO ] Deduced a trap composed of 12 places in 725 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 08:04:02] [INFO ] Deduced a trap composed of 6 places in 479 ms of which 1 ms to minimize.
SMT process timed out in 54175ms, After SMT, problems are : Problem set: 0 solved, 1358 unsolved
Search for dead transitions found 0 dead transitions in 54193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 142/347 places, 1359/1774 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54567 ms. Remains : 142/347 places, 1359/1774 transitions.
Built C files in :
/tmp/ltsmin7300190987834731764
[2024-05-22 08:04:02] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7300190987834731764
Running compilation step : cd /tmp/ltsmin7300190987834731764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7300190987834731764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7300190987834731764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 13 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-22 08:04:05] [INFO ] Computed 15 invariants in 12 ms
[2024-05-22 08:04:06] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-05-22 08:04:06] [INFO ] Invariant cache hit.
[2024-05-22 08:04:08] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
Running 1773 sub problems to find dead transitions.
[2024-05-22 08:04:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1773 unsolved
[2024-05-22 08:05:03] [INFO ] Deduced a trap composed of 31 places in 1468 ms of which 4 ms to minimize.
[2024-05-22 08:05:04] [INFO ] Deduced a trap composed of 79 places in 1288 ms of which 4 ms to minimize.
[2024-05-22 08:05:06] [INFO ] Deduced a trap composed of 22 places in 1273 ms of which 5 ms to minimize.
SMT process timed out in 57937ms, After SMT, problems are : Problem set: 0 solved, 1773 unsolved
Search for dead transitions found 0 dead transitions in 57958ms
Finished structural reductions in LTL mode , in 1 iterations and 60231 ms. Remains : 347/347 places, 1774/1774 transitions.
Built C files in :
/tmp/ltsmin7650397694510512820
[2024-05-22 08:05:06] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7650397694510512820
Running compilation step : cd /tmp/ltsmin7650397694510512820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7650397694510512820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7650397694510512820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 08:05:09] [INFO ] Flatten gal took : 149 ms
[2024-05-22 08:05:09] [INFO ] Flatten gal took : 151 ms
[2024-05-22 08:05:09] [INFO ] Time to serialize gal into /tmp/LTL11588873592326565245.gal : 28 ms
[2024-05-22 08:05:09] [INFO ] Time to serialize properties into /tmp/LTL12807568258373153773.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11588873592326565245.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16718732770332628314.hoa' '-atoms' '/tmp/LTL12807568258373153773.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12807568258373153773.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16718732770332628314.hoa
Detected timeout of ITS tools.
[2024-05-22 08:05:24] [INFO ] Flatten gal took : 150 ms
[2024-05-22 08:05:25] [INFO ] Flatten gal took : 150 ms
[2024-05-22 08:05:25] [INFO ] Time to serialize gal into /tmp/LTL16007303813194592189.gal : 28 ms
[2024-05-22 08:05:25] [INFO ] Time to serialize properties into /tmp/LTL3775037875637441528.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16007303813194592189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3775037875637441528.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((p6!=1)||(p14!=1))||((p194!=1)||(p382!=1)))")&&(("(((p6!=1)||(p20!=1))||((p98!=1)||(p382!=1)))")||(G(F("(((p6!=1)||(p14!=...193
Formula 0 simplified : XXF(!"(((p6!=1)||(p14!=1))||((p194!=1)||(p382!=1)))" | (!"(((p6!=1)||(p20!=1))||((p98!=1)||(p382!=1)))" & FG!"(((p6!=1)||(p14!=1))||...181
Detected timeout of ITS tools.
[2024-05-22 08:05:40] [INFO ] Flatten gal took : 149 ms
[2024-05-22 08:05:40] [INFO ] Applying decomposition
[2024-05-22 08:05:40] [INFO ] Flatten gal took : 153 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5340298363102400878.txt' '-o' '/tmp/graph5340298363102400878.bin' '-w' '/tmp/graph5340298363102400878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5340298363102400878.bin' '-l' '-1' '-v' '-w' '/tmp/graph5340298363102400878.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:05:40] [INFO ] Decomposing Gal with order
[2024-05-22 08:05:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:05:41] [INFO ] Removed a total of 12105 redundant transitions.
[2024-05-22 08:05:41] [INFO ] Flatten gal took : 317 ms
[2024-05-22 08:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 48 ms.
[2024-05-22 08:05:41] [INFO ] Time to serialize gal into /tmp/LTL502106412477551485.gal : 9 ms
[2024-05-22 08:05:41] [INFO ] Time to serialize properties into /tmp/LTL12443186528669809981.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL502106412477551485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12443186528669809981.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((i0.u1.p6!=1)||(i0.u1.p14!=1))||((i0.u51.p194!=1)||(i0.u1.p382!=1)))")&&(("(((i0.u1.p6!=1)||(i0.u1.p20!=1))||((i8.u27.p98...268
Formula 0 simplified : XXF(!"(((i0.u1.p6!=1)||(i0.u1.p14!=1))||((i0.u51.p194!=1)||(i0.u1.p382!=1)))" | (!"(((i0.u1.p6!=1)||(i0.u1.p20!=1))||((i8.u27.p98!=1...256
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-15 finished in 450677 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((p0&&(p1||G(p0))))||X(F(p2))))'
Found a Shortening insensitive property : AutonomousCar-PT-10b-LTLFireability-01
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 311 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 186 transition count 1584
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 505 place count 109 transition count 1502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 506 place count 109 transition count 1501
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 518 place count 97 transition count 1386
Iterating global reduction 6 with 12 rules applied. Total rules applied 530 place count 97 transition count 1386
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 537 place count 97 transition count 1379
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 541 place count 95 transition count 1377
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 543 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 545 place count 93 transition count 1375
Applied a total of 545 rules in 264 ms. Remains 93 /352 variables (removed 259) and now considering 1375/1779 (removed 404) transitions.
// Phase 1: matrix 1375 rows 93 cols
[2024-05-22 08:05:57] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 08:05:57] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-22 08:05:57] [INFO ] Invariant cache hit.
[2024-05-22 08:05:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:05:58] [INFO ] Implicit Places using invariants and state equation in 862 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1246 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 91/352 places, 1375/1779 transitions.
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 2 place count 90 transition count 1374
Applied a total of 2 rules in 41 ms. Remains 90 /91 variables (removed 1) and now considering 1374/1375 (removed 1) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2024-05-22 08:05:58] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:05:58] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-22 08:05:58] [INFO ] Invariant cache hit.
[2024-05-22 08:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:05:59] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/352 places, 1374/1779 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2751 ms. Remains : 90/352 places, 1374/1779 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01
Product exploration explored 100000 steps with 3468 reset in 1396 ms.
Product exploration explored 100000 steps with 1757 reset in 747 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
RANDOM walk for 40000 steps (1443 resets) in 779 ms. (51 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (114 resets) in 357 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (113 resets) in 383 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (115 resets) in 339 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (106 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 205666 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 6
Probabilistic random walk after 205666 steps, saw 34331 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-22 08:06:05] [INFO ] Invariant cache hit.
[2024-05-22 08:06:05] [INFO ] State equation strengthened by 1 read => feed constraints.
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, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1323/1355 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/1462 variables, 57/93 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 8/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1462 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1463 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1463 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/1464 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1464 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1464 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1464/1464 variables, and 103 constraints, problems are : Problem set: 1 solved, 5 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1323/1355 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/1462 variables, 57/93 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1462 variables, 8/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 08:06:08] [INFO ] Deduced a trap composed of 8 places in 1003 ms of which 2 ms to minimize.
[2024-05-22 08:06:09] [INFO ] Deduced a trap composed of 7 places in 1014 ms of which 1 ms to minimize.
[2024-05-22 08:06:10] [INFO ] Deduced a trap composed of 8 places in 958 ms of which 1 ms to minimize.
[2024-05-22 08:06:11] [INFO ] Deduced a trap composed of 7 places in 904 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1462 variables, 4/105 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1462 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/1463 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1463 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1464 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1464/1464 variables, and 107 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 4/4 constraints]
After SMT, in 6011ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 326 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 59/90 places, 1283/1374 transitions.
RANDOM walk for 40000 steps (530 resets) in 4004 ms. (9 steps per ms) remains 5/5 properties
BEST_FIRST walk for 39301 steps (36 resets) in 226 ms. (173 steps per ms) remains 0/5 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 6 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Applied a total of 0 rules in 81 ms. Remains 90 /90 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-22 08:06:14] [INFO ] Invariant cache hit.
[2024-05-22 08:06:14] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-22 08:06:14] [INFO ] Invariant cache hit.
[2024-05-22 08:06:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:06:15] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2024-05-22 08:06:15] [INFO ] Redundant transitions in 61 ms returned [1089]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1366 sub problems to find dead transitions.
// Phase 1: matrix 1373 rows 90 cols
[2024-05-22 08:06:15] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:06:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 2 (OVERLAPS) 5/88 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 88/1463 variables, and 12 constraints, problems are : Problem set: 0 solved, 1366 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1366/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 2 (OVERLAPS) 5/88 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
At refinement iteration 4 (OVERLAPS) 1372/1460 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 1366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1460/1463 variables, and 135 constraints, problems are : Problem set: 0 solved, 1366 unsolved in 30152 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 88/90 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1341/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85457ms problems are : Problem set: 0 solved, 1366 unsolved
Search for dead transitions found 0 dead transitions in 85477ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/90 places, 1373/1374 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 1371
Applied a total of 2 rules in 97 ms. Remains 88 /90 variables (removed 2) and now considering 1371/1373 (removed 2) transitions.
// Phase 1: matrix 1371 rows 88 cols
[2024-05-22 08:07:41] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:07:41] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-22 08:07:41] [INFO ] Invariant cache hit.
[2024-05-22 08:07:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:07:42] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/90 places, 1371/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88257 ms. Remains : 88/90 places, 1371/1374 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 239 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), false, false]
RANDOM walk for 40000 steps (1470 resets) in 4025 ms. (9 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (116 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (117 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (115 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
[2024-05-22 08:07:44] [INFO ] Invariant cache hit.
[2024-05-22 08:07:44] [INFO ] State equation strengthened by 1 read => feed constraints.
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, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1325/1357 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/1458 variables, 56/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1458 variables, 8/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1458 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1459 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1459 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1459 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1459/1459 variables, and 101 constraints, problems are : Problem set: 1 solved, 2 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1325/1357 variables, 32/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/1458 variables, 56/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1458 variables, 8/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 08:07:47] [INFO ] Deduced a trap composed of 7 places in 1199 ms of which 2 ms to minimize.
[2024-05-22 08:07:48] [INFO ] Deduced a trap composed of 7 places in 1166 ms of which 2 ms to minimize.
[2024-05-22 08:07:49] [INFO ] Deduced a trap composed of 7 places in 1058 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1458 variables, 3/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1458 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1459 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1459 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1459 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1459/1459 variables, and 104 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4332 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 3/3 constraints]
After SMT, in 5032ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 521 ms.
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 1371/1371 transitions.
Graph (complete) has 1143 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 1369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 1368
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 1368
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 1362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 74 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 74 transition count 1296
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 70 transition count 1292
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 70 transition count 1280
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 60 place count 58 transition count 1280
Applied a total of 60 rules in 259 ms. Remains 58 /88 variables (removed 30) and now considering 1280/1371 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 58/88 places, 1280/1371 transitions.
RANDOM walk for 40000 steps (491 resets) in 2067 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 6228 steps (0 resets) in 26 ms. (230 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 14 factoid took 420 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 409 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 417 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 677 reset in 400 ms.
Product exploration explored 100000 steps with 3088 reset in 1297 ms.
Built C files in :
/tmp/ltsmin2897309699678935580
[2024-05-22 08:07:54] [INFO ] Computing symmetric may disable matrix : 1371 transitions.
[2024-05-22 08:07:54] [INFO ] Computation of Complete disable matrix. took 473 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:07:54] [INFO ] Computing symmetric may enable matrix : 1371 transitions.
[2024-05-22 08:07:55] [INFO ] Computation of Complete enable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:07:55] [INFO ] Computing Do-Not-Accords matrix : 1371 transitions.
[2024-05-22 08:07:55] [INFO ] Computation of Completed DNA matrix. took 125 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:07:55] [INFO ] Built C files in 1315ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2897309699678935580
Running compilation step : cd /tmp/ltsmin2897309699678935580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2897309699678935580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2897309699678935580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 1371/1371 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 88 transition count 1370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 81 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 1298
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 71 transition count 1294
Applied a total of 34 rules in 182 ms. Remains 71 /88 variables (removed 17) and now considering 1294/1371 (removed 77) transitions.
// Phase 1: matrix 1294 rows 71 cols
[2024-05-22 08:07:58] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:07:59] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-05-22 08:07:59] [INFO ] Invariant cache hit.
[2024-05-22 08:08:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:08:00] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
[2024-05-22 08:08:01] [INFO ] Redundant transitions in 77 ms returned []
Running 1292 sub problems to find dead transitions.
[2024-05-22 08:08:01] [INFO ] Invariant cache hit.
[2024-05-22 08:08:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 71/1365 variables, and 12 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/71 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1292/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 4 (OVERLAPS) 1293/1364 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1364 variables, 45/128 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1364/1365 variables, and 128 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1292/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 85128ms problems are : Problem set: 0 solved, 1292 unsolved
Search for dead transitions found 0 dead transitions in 85147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/88 places, 1294/1371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87494 ms. Remains : 71/88 places, 1294/1371 transitions.
Built C files in :
/tmp/ltsmin14955198566240896998
[2024-05-22 08:09:26] [INFO ] Computing symmetric may disable matrix : 1294 transitions.
[2024-05-22 08:09:26] [INFO ] Computation of Complete disable matrix. took 452 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:09:26] [INFO ] Computing symmetric may enable matrix : 1294 transitions.
[2024-05-22 08:09:26] [INFO ] Computation of Complete enable matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:09:27] [INFO ] Computing Do-Not-Accords matrix : 1294 transitions.
[2024-05-22 08:09:27] [INFO ] Computation of Completed DNA matrix. took 113 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:09:27] [INFO ] Built C files in 1230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14955198566240896998
Running compilation step : cd /tmp/ltsmin14955198566240896998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14955198566240896998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14955198566240896998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 08:09:30] [INFO ] Flatten gal took : 144 ms
[2024-05-22 08:09:30] [INFO ] Flatten gal took : 152 ms
[2024-05-22 08:09:30] [INFO ] Time to serialize gal into /tmp/LTL14997189573377968668.gal : 25 ms
[2024-05-22 08:09:30] [INFO ] Time to serialize properties into /tmp/LTL12875561770632851709.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14997189573377968668.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14926695409070130809.hoa' '-atoms' '/tmp/LTL12875561770632851709.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12875561770632851709.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14926695409070130809.hoa
Detected timeout of ITS tools.
[2024-05-22 08:09:46] [INFO ] Flatten gal took : 200 ms
[2024-05-22 08:09:46] [INFO ] Flatten gal took : 210 ms
[2024-05-22 08:09:46] [INFO ] Time to serialize gal into /tmp/LTL2831236157952712715.gal : 27 ms
[2024-05-22 08:09:46] [INFO ] Time to serialize properties into /tmp/LTL4633598636553993632.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2831236157952712715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4633598636553993632.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(("(((p6==0)||(p20==0))||((p218==0)||(p382==0)))")&&(("(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&...336
Formula 0 simplified : F(!"(((p6==0)||(p20==0))||((p218==0)||(p382==0)))" | (!"(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&(...324
Detected timeout of ITS tools.
[2024-05-22 08:10:01] [INFO ] Flatten gal took : 204 ms
[2024-05-22 08:10:01] [INFO ] Applying decomposition
[2024-05-22 08:10:01] [INFO ] Flatten gal took : 206 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4801704693093111889.txt' '-o' '/tmp/graph4801704693093111889.bin' '-w' '/tmp/graph4801704693093111889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4801704693093111889.bin' '-l' '-1' '-v' '-w' '/tmp/graph4801704693093111889.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:10:02] [INFO ] Decomposing Gal with order
[2024-05-22 08:10:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:10:02] [INFO ] Removed a total of 12084 redundant transitions.
[2024-05-22 08:10:02] [INFO ] Flatten gal took : 280 ms
[2024-05-22 08:10:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 126 ms.
[2024-05-22 08:10:02] [INFO ] Time to serialize gal into /tmp/LTL11405147164776868463.gal : 14 ms
[2024-05-22 08:10:02] [INFO ] Time to serialize properties into /tmp/LTL15955276798871377268.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11405147164776868463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15955276798871377268.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(("(((u0.p6==0)||(u0.p20==0))||((i1.i0.u12.p218==0)||(u0.p382==0)))")&&(("(((((i1.i0.u1.p68==1)&&(i1.i1.u3.p99==1))&&((i1.i1.u6.p...498
Formula 0 simplified : F(!"(((u0.p6==0)||(u0.p20==0))||((i1.i0.u12.p218==0)||(u0.p382==0)))" | (!"(((((i1.i0.u1.p68==1)&&(i1.i1.u3.p99==1))&&((i1.i1.u6.p13...486
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-01 finished in 261514 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)))'
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)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1&&F(p2)))||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((p0||F(G((p1 U !p2)))))))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(G(F(p0))||p1))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-10b-LTLFireability-15
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 332 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 186 transition count 1584
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 78 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 529 place count 97 transition count 1490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 97 transition count 1489
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 548 place count 79 transition count 1310
Iterating global reduction 6 with 18 rules applied. Total rules applied 566 place count 79 transition count 1310
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 575 place count 79 transition count 1301
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 7 with 4 rules applied. Total rules applied 579 place count 77 transition count 1299
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 581 place count 75 transition count 1297
Applied a total of 581 rules in 222 ms. Remains 75 /352 variables (removed 277) and now considering 1297/1779 (removed 482) transitions.
// Phase 1: matrix 1297 rows 75 cols
[2024-05-22 08:10:19] [INFO ] Computed 14 invariants in 7 ms
[2024-05-22 08:10:19] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-22 08:10:19] [INFO ] Invariant cache hit.
[2024-05-22 08:10:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:10:21] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned [70, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1894 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 73/352 places, 1297/1779 transitions.
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 2 place count 72 transition count 1296
Applied a total of 2 rules in 43 ms. Remains 72 /73 variables (removed 1) and now considering 1296/1297 (removed 1) transitions.
// Phase 1: matrix 1296 rows 72 cols
[2024-05-22 08:10:21] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 08:10:21] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-05-22 08:10:21] [INFO ] Invariant cache hit.
[2024-05-22 08:10:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:10:22] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 72/352 places, 1296/1779 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4044 ms. Remains : 72/352 places, 1296/1779 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15
Product exploration explored 100000 steps with 1067 reset in 360 ms.
Product exploration explored 100000 steps with 106 reset in 119 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1963 resets) in 644 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (120 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 440970 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 440970 steps, saw 74134 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-22 08:10:26] [INFO ] Invariant cache hit.
[2024-05-22 08:10:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1253/1274 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1366 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1367 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1253/1274 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1366 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1367 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1217ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Graph (complete) has 1052 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1282
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1282
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 16 place count 70 transition count 1271
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 27 place count 59 transition count 1271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 59 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 58 transition count 1272
Applied a total of 29 rules in 272 ms. Remains 58 /72 variables (removed 14) and now considering 1272/1296 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 58/72 places, 1272/1296 transitions.
RANDOM walk for 40000 steps (182 resets) in 968 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 538609 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 538609 steps, saw 73355 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 1272 rows 58 cols
[2024-05-22 08:10:31] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 08:10:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1245/1264 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1264 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1264 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 66/1330 variables, 39/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1245/1264 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1264 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1264 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 66/1330 variables, 39/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 79 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 58/58 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 79 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-22 08:10:33] [INFO ] Invariant cache hit.
[2024-05-22 08:10:33] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-22 08:10:33] [INFO ] Invariant cache hit.
[2024-05-22 08:10:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:10:34] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2024-05-22 08:10:34] [INFO ] Redundant transitions in 59 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-05-22 08:10:34] [INFO ] Invariant cache hit.
[2024-05-22 08:10:35] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
At refinement iteration 4 (OVERLAPS) 1272/1330 variables, 58/70 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 2/72 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 72 constraints, problems are : Problem set: 2 solved, 1268 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1270/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 4 (OVERLAPS) 1272/1330 variables, 58/70 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 2/72 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1330 variables, 31/103 constraints. Problems are: Problem set: 2 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 103 constraints, problems are : Problem set: 2 solved, 1268 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1268/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 84097ms problems are : Problem set: 2 solved, 1268 unsolved
Search for dead transitions found 2 dead transitions in 84114ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/58 places, 1270/1272 transitions.
Applied a total of 0 rules in 78 ms. Remains 58 /58 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-22 08:11:59] [INFO ] Redundant transitions in 41 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 86162 ms. Remains : 58/58 places, 1270/1272 transitions.
RANDOM walk for 40000 steps (170 resets) in 1034 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (138 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 532946 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 532946 steps, saw 72729 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
// Phase 1: matrix 1270 rows 58 cols
[2024-05-22 08:12:02] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 08:12:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1265 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1265 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/1328 variables, 36/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1328 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1328/1328 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1265 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1265 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/1328 variables, 36/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1328 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1270/1270 transitions.
Applied a total of 0 rules in 87 ms. Remains 58 /58 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 58/58 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1270/1270 transitions.
Applied a total of 0 rules in 77 ms. Remains 58 /58 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-22 08:12:03] [INFO ] Invariant cache hit.
[2024-05-22 08:12:04] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-22 08:12:04] [INFO ] Invariant cache hit.
[2024-05-22 08:12:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:12:05] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2024-05-22 08:12:05] [INFO ] Redundant transitions in 41 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-22 08:12:05] [INFO ] Invariant cache hit.
[2024-05-22 08:12:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1328 variables, and 13 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/58 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1268/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 5 (OVERLAPS) 1270/1328 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1328 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1328 variables, 31/103 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 103 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1268/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 84016ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 84032ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86016 ms. Remains : 58/58 places, 1270/1270 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Applied a total of 0 rules in 8 ms. Remains 72 /72 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
// Phase 1: matrix 1296 rows 72 cols
[2024-05-22 08:13:30] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:13:31] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-22 08:13:31] [INFO ] Invariant cache hit.
[2024-05-22 08:13:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:13:32] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
Running 1293 sub problems to find dead transitions.
[2024-05-22 08:13:32] [INFO ] Invariant cache hit.
[2024-05-22 08:13:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
SMT process timed out in 54734ms, After SMT, problems are : Problem set: 0 solved, 1293 unsolved
Search for dead transitions found 0 dead transitions in 54764ms
Finished structural reductions in LTL mode , in 1 iterations and 56933 ms. Remains : 72/72 places, 1296/1296 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1922 resets) in 570 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (118 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 430443 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 430443 steps, saw 72507 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-22 08:14:30] [INFO ] Invariant cache hit.
[2024-05-22 08:14:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1253/1274 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1366 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1367 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1253/1274 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/1366 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1367 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Graph (complete) has 1052 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1282
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1282
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 16 place count 70 transition count 1271
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 27 place count 59 transition count 1271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 59 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 58 transition count 1272
Applied a total of 29 rules in 276 ms. Remains 58 /72 variables (removed 14) and now considering 1272/1296 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 58/72 places, 1272/1296 transitions.
RANDOM walk for 32079 steps (154 resets) in 741 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2258 reset in 604 ms.
Product exploration explored 100000 steps with 749 reset in 282 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 1285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 1285
Applied a total of 2 rules in 119 ms. Remains 71 /72 variables (removed 1) and now considering 1285/1296 (removed 11) transitions.
[2024-05-22 08:14:34] [INFO ] Redundant transitions in 55 ms returned [1072]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1281 sub problems to find dead transitions.
// Phase 1: matrix 1284 rows 71 cols
[2024-05-22 08:14:34] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
SMT process timed out in 54255ms, After SMT, problems are : Problem set: 0 solved, 1281 unsolved
Search for dead transitions found 0 dead transitions in 54272ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/72 places, 1284/1296 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 1286
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 127 ms. Remains 71 /71 variables (removed 0) and now considering 1286/1284 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/72 places, 1286/1296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54585 ms. Remains : 71/72 places, 1286/1296 transitions.
Built C files in :
/tmp/ltsmin13064938095020482097
[2024-05-22 08:15:28] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13064938095020482097
Running compilation step : cd /tmp/ltsmin13064938095020482097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13064938095020482097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13064938095020482097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 1285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 1285
Applied a total of 2 rules in 18 ms. Remains 71 /72 variables (removed 1) and now considering 1285/1296 (removed 11) transitions.
// Phase 1: matrix 1285 rows 71 cols
[2024-05-22 08:15:31] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 08:15:32] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-22 08:15:32] [INFO ] Invariant cache hit.
[2024-05-22 08:15:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 08:15:33] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
Running 1282 sub problems to find dead transitions.
[2024-05-22 08:15:33] [INFO ] Invariant cache hit.
[2024-05-22 08:15:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
SMT process timed out in 54092ms, After SMT, problems are : Problem set: 0 solved, 1282 unsolved
Search for dead transitions found 0 dead transitions in 54109ms
Starting structural reductions in LTL mode, iteration 1 : 71/72 places, 1285/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55980 ms. Remains : 71/72 places, 1285/1296 transitions.
Built C files in :
/tmp/ltsmin4855514959027858755
[2024-05-22 08:16:27] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4855514959027858755
Running compilation step : cd /tmp/ltsmin4855514959027858755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4855514959027858755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4855514959027858755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 08:16:31] [INFO ] Flatten gal took : 195 ms
[2024-05-22 08:16:31] [INFO ] Flatten gal took : 199 ms
[2024-05-22 08:16:31] [INFO ] Time to serialize gal into /tmp/LTL8695822397553137582.gal : 26 ms
[2024-05-22 08:16:31] [INFO ] Time to serialize properties into /tmp/LTL2735626725135652417.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8695822397553137582.gal' '-t' 'CGAL' '-hoa' '/tmp/aut224870710671484108.hoa' '-atoms' '/tmp/LTL2735626725135652417.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL2735626725135652417.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut224870710671484108.hoa
Detected timeout of ITS tools.
[2024-05-22 08:16:46] [INFO ] Flatten gal took : 195 ms
[2024-05-22 08:16:46] [INFO ] Flatten gal took : 201 ms
[2024-05-22 08:16:46] [INFO ] Time to serialize gal into /tmp/LTL6096198149048365710.gal : 27 ms
[2024-05-22 08:16:46] [INFO ] Time to serialize properties into /tmp/LTL17865279984378023378.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6096198149048365710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17865279984378023378.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((p6!=1)||(p14!=1))||((p194!=1)||(p382!=1)))")&&(("(((p6!=1)||(p20!=1))||((p98!=1)||(p382!=1)))")||(G(F("(((p6!=1)||(p14!=...193
Formula 0 simplified : XXF(!"(((p6!=1)||(p14!=1))||((p194!=1)||(p382!=1)))" | (!"(((p6!=1)||(p20!=1))||((p98!=1)||(p382!=1)))" & FG!"(((p6!=1)||(p14!=1))||...181
Detected timeout of ITS tools.
[2024-05-22 08:17:02] [INFO ] Flatten gal took : 212 ms
[2024-05-22 08:17:02] [INFO ] Applying decomposition
[2024-05-22 08:17:02] [INFO ] Flatten gal took : 190 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph442467836455624211.txt' '-o' '/tmp/graph442467836455624211.bin' '-w' '/tmp/graph442467836455624211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph442467836455624211.bin' '-l' '-1' '-v' '-w' '/tmp/graph442467836455624211.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:17:02] [INFO ] Decomposing Gal with order
[2024-05-22 08:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:17:03] [INFO ] Removed a total of 11651 redundant transitions.
[2024-05-22 08:17:03] [INFO ] Flatten gal took : 234 ms
[2024-05-22 08:17:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 91 ms.
[2024-05-22 08:17:03] [INFO ] Time to serialize gal into /tmp/LTL18385237425139484120.gal : 12 ms
[2024-05-22 08:17:03] [INFO ] Time to serialize properties into /tmp/LTL16553097485501069218.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18385237425139484120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16553097485501069218.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((u0.p6!=1)||(u0.p14!=1))||((i1.u9.p194!=1)||(u0.p382!=1)))")&&(("(((u0.p6!=1)||(u0.p20!=1))||((u3.p98!=1)||(u0.p382!=1)))...235
Formula 0 simplified : XXF(!"(((u0.p6!=1)||(u0.p14!=1))||((i1.u9.p194!=1)||(u0.p382!=1)))" | (!"(((u0.p6!=1)||(u0.p20!=1))||((u3.p98!=1)||(u0.p382!=1)))" &...223
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10b-LTLFireability-15 finished in 419624 ms.
[2024-05-22 08:17:18] [INFO ] Flatten gal took : 152 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15577190074003032573
[2024-05-22 08:17:18] [INFO ] Too many transitions (1779) to apply POR reductions. Disabling POR matrices.
[2024-05-22 08:17:18] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15577190074003032573
Running compilation step : cd /tmp/ltsmin15577190074003032573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 08:17:18] [INFO ] Applying decomposition
[2024-05-22 08:17:18] [INFO ] Flatten gal took : 156 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2555758499677059775.txt' '-o' '/tmp/graph2555758499677059775.bin' '-w' '/tmp/graph2555758499677059775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2555758499677059775.bin' '-l' '-1' '-v' '-w' '/tmp/graph2555758499677059775.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:17:19] [INFO ] Decomposing Gal with order
[2024-05-22 08:17:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:17:19] [INFO ] Removed a total of 12097 redundant transitions.
[2024-05-22 08:17:19] [INFO ] Flatten gal took : 334 ms
[2024-05-22 08:17:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 48 ms.
[2024-05-22 08:17:19] [INFO ] Time to serialize gal into /tmp/LTLFireability8707861668682354343.gal : 8 ms
[2024-05-22 08:17:19] [INFO ] Time to serialize properties into /tmp/LTLFireability14810149047187792419.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8707861668682354343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14810149047187792419.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 7 LTL properties
Checking formula 0 : !(((G(("(((i0.u1.p6==0)||(i0.u1.p20==0))||((i0.u1.p218==0)||(i0.u1.p382==0)))")&&(("(((((i12.u18.p68==1)&&(i12.u26.p99==1))&&((i12.u37...496
Formula 0 simplified : F(!"(((i0.u1.p6==0)||(i0.u1.p20==0))||((i0.u1.p218==0)||(i0.u1.p382==0)))" | (!"(((((i12.u18.p68==1)&&(i12.u26.p99==1))&&((i12.u37.p...484
Compilation finished in 14969 ms.
Running link step : cd /tmp/ltsmin15577190074003032573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin15577190074003032573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&((LTLAPp1==true)||[]((LTLAPp0==true)))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15577190074003032573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&((LTLAPp1==true)||[]((LTLAPp0==true)))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15577190074003032573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15577190074003032573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15577190074003032573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp4==true))||[]((LTLAPp5==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15577190074003032573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp4==true))||[]((LTLAPp5==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15577190074003032573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](((LTLAPp7==true)&&<>((LTLAPp8==true))))||(LTLAPp6==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-10b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167600372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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