MCC'2024- Execution of r289-tajo-171654445600291

About the Execution of GreatSPN+red for PolyORBLF-PT-S04J06T06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15256.979	3600000.00	10648004.00	354.50	FFF?FFTT?FFTFFFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445600291.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M May 18 16:43 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 PolyORBLF-PT-S04J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716866913047

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:28:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 03:28:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:28:35] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2024-05-28 03:28:35] [INFO ] Transformed 618 places.
[2024-05-28 03:28:35] [INFO ] Transformed 3190 transitions.
[2024-05-28 03:28:35] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 144 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:28:35] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-28 03:28:36] [INFO ] Computed 50 invariants in 96 ms
[2024-05-28 03:28:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:28:57] [INFO ] Deduced a trap composed of 98 places in 305 ms of which 50 ms to minimize.
[2024-05-28 03:28:57] [INFO ] Deduced a trap composed of 134 places in 400 ms of which 3 ms to minimize.
[2024-05-28 03:28:58] [INFO ] Deduced a trap composed of 133 places in 426 ms of which 4 ms to minimize.
[2024-05-28 03:28:58] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 5 ms to minimize.
[2024-05-28 03:29:00] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
[2024-05-28 03:29:01] [INFO ] Deduced a trap composed of 288 places in 248 ms of which 3 ms to minimize.
[2024-05-28 03:29:01] [INFO ] Deduced a trap composed of 277 places in 286 ms of which 3 ms to minimize.
SMT process timed out in 25917ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 26019ms
[2024-05-28 03:29:01] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 03:29:01] [INFO ] Invariant cache hit.
[2024-05-28 03:29:02] [INFO ] Implicit Places using invariants in 547 ms returned [135, 200, 326, 361, 478, 545]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 555 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/618 places, 1552/1564 transitions.
Applied a total of 0 rules in 14 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26825 ms. Remains : 596/618 places, 1552/1564 transitions.
Support contains 136 out of 596 places after structural reductions.
[2024-05-28 03:29:02] [INFO ] Flatten gal took : 240 ms
[2024-05-28 03:29:03] [INFO ] Flatten gal took : 208 ms
[2024-05-28 03:29:03] [INFO ] Input system was already deterministic with 1552 transitions.
Support contains 132 out of 596 places (down from 136) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1650 ms. (24 steps per ms) remains 9/27 properties
BEST_FIRST walk for 40002 steps (8 resets) in 311 ms. (128 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 296 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 406 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 288 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 366 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 248 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
[2024-05-28 03:29:05] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:29:05] [INFO ] Computed 44 invariants in 80 ms
[2024-05-28 03:29:05] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 292/315 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 114/429 variables, 9/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 15/444 variables, 5/19 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 596/2124 variables, and 44 constraints, problems are : Problem set: 9 solved, 0 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 569ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1))&&F(G(p2)))))'
Support contains 60 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 13 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:29:05] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-28 03:29:05] [INFO ] Invariant cache hit.
[2024-05-28 03:29:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:29:24] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 2 ms to minimize.
[2024-05-28 03:29:25] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 46604ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 46621ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:29:52] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:29:52] [INFO ] Computed 44 invariants in 38 ms
[2024-05-28 03:29:53] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-05-28 03:29:53] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:29:53] [INFO ] Invariant cache hit.
[2024-05-28 03:29:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:30:10] [INFO ] Implicit Places using invariants and state equation in 17130 ms returned []
Implicit Place search using SMT with State Equation took 17918 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 12 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64569 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-02
Stuttering criterion allowed to conclude after 63647 steps with 0 reset in 348 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-02 finished in 65359 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)||G(p1))))'
Support contains 31 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 14 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:30:11] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:30:11] [INFO ] Computed 44 invariants in 49 ms
[2024-05-28 03:30:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:30:29] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-28 03:30:30] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 03:30:56] [INFO ] Deduced a trap composed of 47 places in 340 ms of which 3 ms to minimize.
[2024-05-28 03:30:56] [INFO ] Deduced a trap composed of 33 places in 326 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 40 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 4/4 constraints]
After SMT, in 45339ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45369ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:30:56] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:30:56] [INFO ] Computed 44 invariants in 56 ms
[2024-05-28 03:30:57] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-28 03:30:57] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:30:57] [INFO ] Invariant cache hit.
[2024-05-28 03:30:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:31:12] [INFO ] Implicit Places using invariants and state equation in 14742 ms returned []
Implicit Place search using SMT with State Equation took 15470 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 10 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60868 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-03
Product exploration explored 100000 steps with 723 reset in 636 ms.
Product exploration explored 100000 steps with 729 reset in 541 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 531 steps (0 resets) in 11 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 03:31:14] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:31:14] [INFO ] Invariant cache hit.
[2024-05-28 03:31:14] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-28 03:31:15] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 121 ms returned sat
[2024-05-28 03:31:16] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2024-05-28 03:31:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:31:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-28 03:31:17] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 82 ms returned sat
[2024-05-28 03:31:22] [INFO ] [Nat]Absence check using state equation in 4748 ms returned sat
[2024-05-28 03:31:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:31:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 03:31:24] [INFO ] [Nat]Added 120 Read/Feed constraints in 2039 ms returned sat
[2024-05-28 03:31:24] [INFO ] Deduced a trap composed of 82 places in 322 ms of which 3 ms to minimize.
[2024-05-28 03:31:25] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-05-28 03:31:25] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-28 03:31:26] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2024-05-28 03:31:26] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-05-28 03:31:26] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-05-28 03:31:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2882 ms
[2024-05-28 03:31:27] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 165 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 03:31:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 12 out of 596 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 15 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-05-28 03:31:31] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:31:31] [INFO ] Invariant cache hit.
[2024-05-28 03:31:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:31:46] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
[2024-05-28 03:31:46] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2034 variables, and 38 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 2/2 constraints]
After SMT, in 43109ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 43124ms
[2024-05-28 03:32:14] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:32:14] [INFO ] Invariant cache hit.
[2024-05-28 03:32:15] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-28 03:32:15] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:32:15] [INFO ] Invariant cache hit.
[2024-05-28 03:32:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:32:30] [INFO ] Implicit Places using invariants and state equation in 14775 ms returned []
Implicit Place search using SMT with State Equation took 15471 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-05-28 03:32:30] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:32:30] [INFO ] Invariant cache hit.
[2024-05-28 03:32:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:32:44] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-05-28 03:32:45] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:33:24] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 4 ms to minimize.
[2024-05-28 03:33:25] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-28 03:33:25] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 2 ms to minimize.
[2024-05-28 03:33:25] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2024-05-28 03:33:25] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 3 ms to minimize.
[2024-05-28 03:33:25] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
(s576 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 4)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 2)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 3)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 4)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 2)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 3)
(s213 0)
(s214 0)
(s215 9)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 4)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 2)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 2)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 2)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 4)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 1)
(s324 1)
(s325 0)
(s326 0)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 1)
(s359 0)
(s360 4)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 1)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 1)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 10)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 1)
(s441 0)
(s442 0)
(s443 0)
(s444 2)
(s445 0)
(s446 1)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 2)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 1)
(s463 1)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 1)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 1)
(s498 1)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 1)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 2)
(s536 0)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 6)
(s553 0)
(s554 1)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 1)
(s566 1)
(s567 0)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2034 variables, and 44 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 8/8 constraints]
After SMT, in 63024ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 63037ms
Finished structural reductions in LTL mode , in 1 iterations and 121656 ms. Remains : 596/596 places, 1462/1462 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 576 steps (0 resets) in 9 ms. (57 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 03:33:33] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:33:33] [INFO ] Invariant cache hit.
[2024-05-28 03:33:34] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-28 03:33:34] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 66 ms returned sat
[2024-05-28 03:33:35] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2024-05-28 03:33:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:33:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-28 03:33:36] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 81 ms returned sat
[2024-05-28 03:33:41] [INFO ] [Nat]Absence check using state equation in 4623 ms returned sat
[2024-05-28 03:33:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:33:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 03:33:42] [INFO ] [Nat]Added 120 Read/Feed constraints in 1889 ms returned sat
[2024-05-28 03:33:43] [INFO ] Deduced a trap composed of 82 places in 248 ms of which 3 ms to minimize.
[2024-05-28 03:33:43] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 2 ms to minimize.
[2024-05-28 03:33:44] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
[2024-05-28 03:33:44] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 2 ms to minimize.
[2024-05-28 03:33:44] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 2 ms to minimize.
[2024-05-28 03:33:46] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3398 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 730 reset in 473 ms.
Product exploration explored 100000 steps with 733 reset in 411 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1462
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 30 place count 596 transition count 1510
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 66 place count 596 transition count 1510
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 584 transition count 1498
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 584 transition count 1498
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 186 place count 584 transition count 1498
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 207 place count 563 transition count 1477
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 228 place count 563 transition count 1477
Deduced a syphon composed of 132 places in 2 ms
Applied a total of 228 rules in 170 ms. Remains 563 /596 variables (removed 33) and now considering 1477/1462 (removed -15) transitions.
Running 1473 sub problems to find dead transitions.
[2024-05-28 03:33:47] [INFO ] Flow matrix only has 1453 transitions (discarded 24 similar events)
// Phase 1: matrix 1453 rows 563 cols
[2024-05-28 03:33:47] [INFO ] Computed 44 invariants in 24 ms
[2024-05-28 03:33:47] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1473 unsolved
[2024-05-28 03:34:04] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 6 ms to minimize.
[2024-05-28 03:34:04] [INFO ] Deduced a trap composed of 144 places in 260 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-28 03:34:04] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-28 03:34:05] [INFO ] Deduced a trap composed of 150 places in 262 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-28 03:34:06] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 4 ms to minimize.
[2024-05-28 03:34:06] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 3 ms to minimize.
[2024-05-28 03:34:06] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-28 03:34:07] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD576 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.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 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 2.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/2016 variables, and 47 constraints, problems are : Problem set: 92 solved, 1381 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1473/1473 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 92 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 11/11 constraints. Problems are: Problem set: 92 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 9/20 constraints. Problems are: Problem set: 92 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 8/28 constraints. Problems are: Problem set: 92 solved, 1381 unsolved
[2024-05-28 03:34:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 1/29 constraints. Problems are: Problem set: 92 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/2016 variables, and 29 constraints, problems are : Problem set: 92 solved, 1381 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 9/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/1473 constraints, Known Traps: 9/9 constraints]
After SMT, in 44311ms problems are : Problem set: 92 solved, 1381 unsolved
Search for dead transitions found 92 dead transitions in 44326ms
Found 92 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 92 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 92 transitions.
[2024-05-28 03:34:32] [INFO ] Redundant transitions in 118 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1385/1462 transitions.
Graph (complete) has 3182 edges and 563 vertex of which 506 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.6 ms
Discarding 57 places :
Also discarding 0 output transitions
Deduced a syphon composed of 75 places in 1 ms
Applied a total of 1 rules in 50 ms. Remains 506 /563 variables (removed 57) and now considering 1385/1385 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 506/596 places, 1385/1462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44680 ms. Remains : 506/596 places, 1385/1462 transitions.
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 17 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-05-28 03:34:32] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:34:32] [INFO ] Computed 44 invariants in 47 ms
[2024-05-28 03:34:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:34:47] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 11 ms to minimize.
[2024-05-28 03:34:47] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:35:00] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 2 ms to minimize.
[2024-05-28 03:35:00] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 2 ms to minimize.
[2024-05-28 03:35:00] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-28 03:35:00] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 41 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 6/6 constraints]
After SMT, in 43438ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 43455ms
[2024-05-28 03:35:15] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:35:15] [INFO ] Invariant cache hit.
[2024-05-28 03:35:16] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-28 03:35:16] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:35:16] [INFO ] Invariant cache hit.
[2024-05-28 03:35:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:35:32] [INFO ] Implicit Places using invariants and state equation in 16477 ms returned []
Implicit Place search using SMT with State Equation took 17036 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-05-28 03:35:32] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:35:32] [INFO ] Invariant cache hit.
[2024-05-28 03:35:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:35:47] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-05-28 03:35:47] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 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 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:36:26] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 3 ms to minimize.
[2024-05-28 03:36:26] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-05-28 03:36:26] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-05-28 03:36:26] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-05-28 03:36:26] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 7 ms to minimize.
[2024-05-28 03:36:27] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2034 variables, and 44 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 8/8 constraints]
After SMT, in 63675ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 63690ms
Finished structural reductions in LTL mode , in 1 iterations and 124206 ms. Remains : 596/596 places, 1462/1462 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-03 finished in 385594 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)||G(F(p1))))'
Support contains 48 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 336 place count 428 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 339 place count 425 transition count 1381
Iterating global reduction 2 with 3 rules applied. Total rules applied 342 place count 425 transition count 1381
Applied a total of 342 rules in 127 ms. Remains 425 /596 variables (removed 171) and now considering 1381/1552 (removed 171) transitions.
Running 1377 sub problems to find dead transitions.
[2024-05-28 03:36:37] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
// Phase 1: matrix 1357 rows 425 cols
[2024-05-28 03:36:37] [INFO ] Computed 44 invariants in 48 ms
[2024-05-28 03:36:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:36:50] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 3 ms to minimize.
[2024-05-28 03:36:50] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 2 ms to minimize.
[2024-05-28 03:36:51] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 2 ms to minimize.
[2024-05-28 03:36:51] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 3 ms to minimize.
[2024-05-28 03:36:51] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:36:51] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-28 03:36:51] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:36:51] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-28 03:36:51] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-05-28 03:36:51] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-28 03:36:52] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-05-28 03:36:52] [INFO ] Deduced a trap composed of 55 places in 257 ms of which 2 ms to minimize.
[2024-05-28 03:36:52] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 2 ms to minimize.
[2024-05-28 03:36:54] [INFO ] Deduced a trap composed of 132 places in 287 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 54 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1377 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 421/1782 variables, and 54 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 14/14 constraints]
After SMT, in 45981ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 46002ms
[2024-05-28 03:37:22] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:37:22] [INFO ] Invariant cache hit.
[2024-05-28 03:37:23] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-28 03:37:23] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:37:23] [INFO ] Invariant cache hit.
[2024-05-28 03:37:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:37:34] [INFO ] Implicit Places using invariants and state equation in 11509 ms returned []
Implicit Place search using SMT with State Equation took 11968 ms to find 0 implicit places.
[2024-05-28 03:37:35] [INFO ] Redundant transitions in 96 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-05-28 03:37:35] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:37:35] [INFO ] Invariant cache hit.
[2024-05-28 03:37:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:37:47] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-05-28 03:37:47] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-28 03:37:48] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 0 ms to minimize.
[2024-05-28 03:37:48] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-28 03:37:48] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 03:37:48] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-28 03:37:48] [INFO ] Deduced a trap composed of 151 places in 278 ms of which 4 ms to minimize.
[2024-05-28 03:37:48] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2024-05-28 03:37:49] [INFO ] Deduced a trap composed of 57 places in 223 ms of which 3 ms to minimize.
[2024-05-28 03:37:49] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:37:49] [INFO ] Deduced a trap composed of 132 places in 210 ms of which 2 ms to minimize.
[2024-05-28 03:37:51] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2024-05-28 03:38:01] [INFO ] Deduced a trap composed of 242 places in 282 ms of which 3 ms to minimize.
[2024-05-28 03:38:02] [INFO ] Deduced a trap composed of 195 places in 314 ms of which 2 ms to minimize.
[2024-05-28 03:38:03] [INFO ] Deduced a trap composed of 235 places in 247 ms of which 3 ms to minimize.
[2024-05-28 03:38:03] [INFO ] Deduced a trap composed of 238 places in 294 ms of which 3 ms to minimize.
[2024-05-28 03:38:03] [INFO ] Deduced a trap composed of 211 places in 286 ms of which 3 ms to minimize.
[2024-05-28 03:38:04] [INFO ] Deduced a trap composed of 223 places in 351 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 58 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 58 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 18/18 constraints]
After SMT, in 65246ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 65265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/596 places, 1381/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123479 ms. Remains : 425/596 places, 1381/1552 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-04
Stuttering criterion allowed to conclude after 3871 steps with 3 reset in 24 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-04 finished in 123648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1522
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 566 transition count 1522
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 60 place count 566 transition count 1444
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 216 place count 488 transition count 1444
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 324 place count 434 transition count 1390
Applied a total of 324 rules in 82 ms. Remains 434 /596 variables (removed 162) and now considering 1390/1552 (removed 162) transitions.
Running 1386 sub problems to find dead transitions.
[2024-05-28 03:38:40] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 434 cols
[2024-05-28 03:38:40] [INFO ] Computed 44 invariants in 20 ms
[2024-05-28 03:38:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 03:38:56] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2024-05-28 03:38:56] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 3 ms to minimize.
[2024-05-28 03:38:56] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 3 ms to minimize.
[2024-05-28 03:38:57] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2024-05-28 03:39:05] [INFO ] Deduced a trap composed of 141 places in 206 ms of which 3 ms to minimize.
[2024-05-28 03:39:06] [INFO ] Deduced a trap composed of 140 places in 228 ms of which 3 ms to minimize.
[2024-05-28 03:39:06] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 3 ms to minimize.
[2024-05-28 03:39:07] [INFO ] Deduced a trap composed of 133 places in 198 ms of which 2 ms to minimize.
SMT process timed out in 26434ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 26449ms
[2024-05-28 03:39:07] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 03:39:07] [INFO ] Invariant cache hit.
[2024-05-28 03:39:07] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-28 03:39:07] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 03:39:07] [INFO ] Invariant cache hit.
[2024-05-28 03:39:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:39:17] [INFO ] Implicit Places using invariants and state equation in 9702 ms returned []
Implicit Place search using SMT with State Equation took 10257 ms to find 0 implicit places.
[2024-05-28 03:39:17] [INFO ] Redundant transitions in 49 ms returned []
Running 1386 sub problems to find dead transitions.
[2024-05-28 03:39:17] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 03:39:17] [INFO ] Invariant cache hit.
[2024-05-28 03:39:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 03:39:30] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-05-28 03:39:30] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 2 ms to minimize.
[2024-05-28 03:39:31] [INFO ] Deduced a trap composed of 63 places in 268 ms of which 3 ms to minimize.
[2024-05-28 03:39:31] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 3 ms to minimize.
[2024-05-28 03:39:31] [INFO ] Deduced a trap composed of 61 places in 217 ms of which 3 ms to minimize.
[2024-05-28 03:39:32] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2024-05-28 03:39:41] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 3 ms to minimize.
[2024-05-28 03:39:41] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 03:39:42] [INFO ] Deduced a trap composed of 130 places in 249 ms of which 2 ms to minimize.
[2024-05-28 03:39:42] [INFO ] Deduced a trap composed of 130 places in 221 ms of which 2 ms to minimize.
[2024-05-28 03:39:42] [INFO ] Deduced a trap composed of 128 places in 177 ms of which 2 ms to minimize.
[2024-05-28 03:39:43] [INFO ] Deduced a trap composed of 122 places in 252 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 51 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 03:39:56] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-05-28 03:39:56] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2024-05-28 03:39:56] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-28 03:39:56] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-28 03:39:57] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 56 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 17/17 constraints]
After SMT, in 64834ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 64849ms
Starting structural reductions in SI_LTL mode, iteration 1 : 434/596 places, 1390/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101705 ms. Remains : 434/596 places, 1390/1552 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-07
Product exploration explored 100000 steps with 10 reset in 441 ms.
Product exploration explored 100000 steps with 12 reset in 485 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 184258 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 184258 steps, saw 123448 distinct states, run finished after 3006 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-28 03:40:26] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-05-28 03:40:26] [INFO ] Invariant cache hit.
[2024-05-28 03:40:26] [INFO ] State equation strengthened by 120 read => feed constraints.
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) 293/305 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/373 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 432/1800 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-07 finished in 106284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U (X(p1) U p2))&&p3)))'
Support contains 7 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 336 place count 428 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 339 place count 425 transition count 1381
Iterating global reduction 2 with 3 rules applied. Total rules applied 342 place count 425 transition count 1381
Applied a total of 342 rules in 90 ms. Remains 425 /596 variables (removed 171) and now considering 1381/1552 (removed 171) transitions.
Running 1377 sub problems to find dead transitions.
[2024-05-28 03:40:26] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
// Phase 1: matrix 1357 rows 425 cols
[2024-05-28 03:40:26] [INFO ] Computed 44 invariants in 22 ms
[2024-05-28 03:40:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:40:39] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 2 ms to minimize.
[2024-05-28 03:40:40] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 2 ms to minimize.
[2024-05-28 03:40:40] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2024-05-28 03:40:40] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-05-28 03:40:40] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:40:40] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-28 03:40:40] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:40:40] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:40:41] [INFO ] Deduced a trap composed of 27 places in 935 ms of which 2 ms to minimize.
[2024-05-28 03:40:42] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 2 ms to minimize.
[2024-05-28 03:40:43] [INFO ] Deduced a trap composed of 82 places in 310 ms of which 3 ms to minimize.
[2024-05-28 03:40:44] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 2 ms to minimize.
[2024-05-28 03:40:44] [INFO ] Deduced a trap composed of 140 places in 298 ms of which 3 ms to minimize.
[2024-05-28 03:40:44] [INFO ] Deduced a trap composed of 137 places in 272 ms of which 3 ms to minimize.
[2024-05-28 03:40:46] [INFO ] Deduced a trap composed of 206 places in 307 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 55 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:41:04] [INFO ] Deduced a trap composed of 123 places in 288 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 56 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 16/16 constraints]
After SMT, in 45093ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 45109ms
[2024-05-28 03:41:11] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:41:11] [INFO ] Invariant cache hit.
[2024-05-28 03:41:12] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-28 03:41:12] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:41:12] [INFO ] Invariant cache hit.
[2024-05-28 03:41:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:41:23] [INFO ] Implicit Places using invariants and state equation in 11157 ms returned []
Implicit Place search using SMT with State Equation took 11742 ms to find 0 implicit places.
[2024-05-28 03:41:23] [INFO ] Redundant transitions in 26 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-05-28 03:41:23] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:41:23] [INFO ] Invariant cache hit.
[2024-05-28 03:41:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:41:38] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2024-05-28 03:41:38] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-28 03:41:38] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:41:38] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-28 03:41:38] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 3 ms to minimize.
[2024-05-28 03:41:39] [INFO ] Deduced a trap composed of 156 places in 253 ms of which 2 ms to minimize.
[2024-05-28 03:41:39] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-28 03:41:39] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-05-28 03:41:39] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-28 03:41:39] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-28 03:41:40] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 3 ms to minimize.
[2024-05-28 03:41:40] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 1 ms to minimize.
[2024-05-28 03:41:40] [INFO ] Deduced a trap composed of 137 places in 286 ms of which 4 ms to minimize.
[2024-05-28 03:41:41] [INFO ] Deduced a trap composed of 143 places in 313 ms of which 3 ms to minimize.
[2024-05-28 03:41:42] [INFO ] Deduced a trap composed of 215 places in 330 ms of which 3 ms to minimize.
[2024-05-28 03:41:42] [INFO ] Deduced a trap composed of 253 places in 325 ms of which 3 ms to minimize.
[2024-05-28 03:41:42] [INFO ] Deduced a trap composed of 242 places in 312 ms of which 2 ms to minimize.
[2024-05-28 03:41:43] [INFO ] Deduced a trap composed of 200 places in 345 ms of which 3 ms to minimize.
[2024-05-28 03:41:43] [INFO ] Deduced a trap composed of 203 places in 324 ms of which 3 ms to minimize.
[2024-05-28 03:41:45] [INFO ] Deduced a trap composed of 194 places in 313 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:41:57] [INFO ] Deduced a trap composed of 222 places in 341 ms of which 3 ms to minimize.
[2024-05-28 03:41:58] [INFO ] Deduced a trap composed of 210 places in 259 ms of which 3 ms to minimize.
[2024-05-28 03:41:59] [INFO ] Deduced a trap composed of 260 places in 255 ms of which 2 ms to minimize.
[2024-05-28 03:41:59] [INFO ] Deduced a trap composed of 258 places in 301 ms of which 3 ms to minimize.
[2024-05-28 03:41:59] [INFO ] Deduced a trap composed of 213 places in 261 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 (/ 3.0 4.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 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 4.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 (/ 1.0 4.0))
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 (/ 1.0 4.0))
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 (/ 1.0 2.0))
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 65 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:42:20] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 3 ms to minimize.
[2024-05-28 03:42:29] [INFO ] Deduced a trap composed of 178 places in 281 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 2)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 9)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 67 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 27/27 constraints]
After SMT, in 66187ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 66203ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/596 places, 1381/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123189 ms. Remains : 425/596 places, 1381/1552 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 1936 reset in 788 ms.
Product exploration explored 100000 steps with 2014 reset in 593 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1))), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) p0)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT p3)), (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 198 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter insensitive) to 5 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40002 steps (10 resets) in 515 ms. (77 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 458 ms. (87 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 449 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 559 ms. (71 steps per ms) remains 3/3 properties
[2024-05-28 03:42:32] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:42:32] [INFO ] Invariant cache hit.
[2024-05-28 03:42:32] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
Problem apf14 is UNSAT
After SMT solving in domain Real declared 7/1782 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1))), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) p0)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT p3)), (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1)), (G (OR p0 p2 p3 p1)), (G (OR p0 p2 (NOT p3))), (G (AND (OR p0 p2 (NOT p3)) (OR p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p2) p3) (AND p0 (NOT p2) p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F (NOT (OR p3 p1))), (F (NOT (OR p0 p3))), (F (NOT p0)), (F (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) (NOT p3) p1)))), (F p2), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p1)), (F (NOT (OR p0 p3 p1))), (F p3), (F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 34 factoid took 714 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
[2024-05-28 03:42:34] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:42:34] [INFO ] Invariant cache hit.
[2024-05-28 03:42:34] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 03:42:34] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 147 ms returned sat
[2024-05-28 03:42:36] [INFO ] [Real]Absence check using state equation in 2235 ms returned sat
[2024-05-28 03:42:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:42:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 03:42:37] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 46 ms returned sat
[2024-05-28 03:42:41] [INFO ] [Nat]Absence check using state equation in 4047 ms returned sat
[2024-05-28 03:42:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:42:42] [INFO ] [Nat]Added 120 Read/Feed constraints in 1029 ms returned sat
[2024-05-28 03:42:42] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-05-28 03:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-05-28 03:42:43] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 125 ms.
[2024-05-28 03:42:47] [INFO ] Added : 60 causal constraints over 12 iterations in 4702 ms. Result :unknown
Could not prove EG (NOT p3)
[2024-05-28 03:42:47] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:42:47] [INFO ] Invariant cache hit.
[2024-05-28 03:42:48] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-28 03:42:48] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 128 ms returned sat
[2024-05-28 03:42:49] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2024-05-28 03:42:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:42:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 03:42:49] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 54 ms returned sat
[2024-05-28 03:42:52] [INFO ] [Nat]Absence check using state equation in 2391 ms returned sat
[2024-05-28 03:42:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:42:52] [INFO ] [Nat]Added 120 Read/Feed constraints in 295 ms returned sat
[2024-05-28 03:42:52] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-28 03:42:53] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 2 ms to minimize.
[2024-05-28 03:42:53] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:42:53] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
[2024-05-28 03:42:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1413 ms
[2024-05-28 03:42:54] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 121 ms.
[2024-05-28 03:43:02] [INFO ] Added : 302 causal constraints over 61 iterations in 8887 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1381/1381 transitions.
Applied a total of 0 rules in 31 ms. Remains 425 /425 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running 1377 sub problems to find dead transitions.
[2024-05-28 03:43:02] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:43:02] [INFO ] Invariant cache hit.
[2024-05-28 03:43:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:43:17] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 3 ms to minimize.
[2024-05-28 03:43:17] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-28 03:43:17] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-28 03:43:17] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-28 03:43:17] [INFO ] Deduced a trap composed of 52 places in 263 ms of which 3 ms to minimize.
[2024-05-28 03:43:18] [INFO ] Deduced a trap composed of 156 places in 248 ms of which 2 ms to minimize.
[2024-05-28 03:43:18] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:43:18] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-05-28 03:43:18] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2024-05-28 03:43:18] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-05-28 03:43:18] [INFO ] Deduced a trap composed of 61 places in 320 ms of which 3 ms to minimize.
[2024-05-28 03:43:19] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 3 ms to minimize.
[2024-05-28 03:43:19] [INFO ] Deduced a trap composed of 137 places in 284 ms of which 3 ms to minimize.
[2024-05-28 03:43:20] [INFO ] Deduced a trap composed of 143 places in 343 ms of which 3 ms to minimize.
[2024-05-28 03:43:21] [INFO ] Deduced a trap composed of 215 places in 402 ms of which 3 ms to minimize.
[2024-05-28 03:43:21] [INFO ] Deduced a trap composed of 253 places in 339 ms of which 4 ms to minimize.
[2024-05-28 03:43:22] [INFO ] Deduced a trap composed of 242 places in 351 ms of which 3 ms to minimize.
[2024-05-28 03:43:22] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 3 ms to minimize.
[2024-05-28 03:43:22] [INFO ] Deduced a trap composed of 203 places in 348 ms of which 3 ms to minimize.
[2024-05-28 03:43:24] [INFO ] Deduced a trap composed of 194 places in 272 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 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 421/1782 variables, and 60 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:43:38] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 3 ms to minimize.
[2024-05-28 03:43:39] [INFO ] Deduced a trap composed of 207 places in 244 ms of which 2 ms to minimize.
[2024-05-28 03:43:43] [INFO ] Deduced a trap composed of 242 places in 212 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 63 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 23/23 constraints]
After SMT, in 45501ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 45519ms
[2024-05-28 03:43:48] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:43:48] [INFO ] Invariant cache hit.
[2024-05-28 03:43:48] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-28 03:43:48] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:43:48] [INFO ] Invariant cache hit.
[2024-05-28 03:43:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:44:00] [INFO ] Implicit Places using invariants and state equation in 11149 ms returned []
Implicit Place search using SMT with State Equation took 11589 ms to find 0 implicit places.
[2024-05-28 03:44:00] [INFO ] Redundant transitions in 60 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-05-28 03:44:00] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:44:00] [INFO ] Invariant cache hit.
[2024-05-28 03:44:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:44:13] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-05-28 03:44:13] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-28 03:44:14] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-05-28 03:44:14] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:44:14] [INFO ] Deduced a trap composed of 52 places in 324 ms of which 4 ms to minimize.
[2024-05-28 03:44:14] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 2 ms to minimize.
[2024-05-28 03:44:14] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2024-05-28 03:44:14] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-28 03:44:15] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 03:44:15] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2024-05-28 03:44:15] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 3 ms to minimize.
[2024-05-28 03:44:15] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2024-05-28 03:44:16] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 2 ms to minimize.
[2024-05-28 03:44:16] [INFO ] Deduced a trap composed of 143 places in 348 ms of which 3 ms to minimize.
[2024-05-28 03:44:17] [INFO ] Deduced a trap composed of 215 places in 377 ms of which 4 ms to minimize.
[2024-05-28 03:44:17] [INFO ] Deduced a trap composed of 253 places in 330 ms of which 3 ms to minimize.
[2024-05-28 03:44:18] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 3 ms to minimize.
[2024-05-28 03:44:18] [INFO ] Deduced a trap composed of 200 places in 315 ms of which 3 ms to minimize.
[2024-05-28 03:44:18] [INFO ] Deduced a trap composed of 203 places in 285 ms of which 2 ms to minimize.
[2024-05-28 03:44:20] [INFO ] Deduced a trap composed of 194 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:44:33] [INFO ] Deduced a trap composed of 222 places in 327 ms of which 3 ms to minimize.
[2024-05-28 03:44:34] [INFO ] Deduced a trap composed of 210 places in 218 ms of which 3 ms to minimize.
[2024-05-28 03:44:34] [INFO ] Deduced a trap composed of 260 places in 268 ms of which 3 ms to minimize.
[2024-05-28 03:44:34] [INFO ] Deduced a trap composed of 258 places in 215 ms of which 3 ms to minimize.
[2024-05-28 03:44:35] [INFO ] Deduced a trap composed of 213 places in 254 ms of which 2 ms to minimize.
[2024-05-28 03:44:35] [INFO ] Deduced a trap composed of 184 places in 295 ms of which 3 ms to minimize.
SMT process timed out in 35698ms, After SMT, problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 35717ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92934 ms. Remains : 425/425 places, 1381/1381 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT p3)), (X p0), (X p1), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 156 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (12 resets) in 566 ms. (70 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
[2024-05-28 03:44:36] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:44:36] [INFO ] Invariant cache hit.
[2024-05-28 03:44:36] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 7/1782 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT p3)), (X p0), (X p1), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (G (OR p2 p3 p0 p1))]
False Knowledge obtained : [(F (NOT (OR p3 p0 p1))), (F (NOT (OR p2 p3 (NOT p0) p1))), (F (NOT (OR p3 p0))), (F (NOT (OR p3 (NOT p0) p1))), (F (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p3) p0))), (F (NOT p1)), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1)))), (F p2), (F (NOT p0)), (F p3)]
Knowledge based reduction with 26 factoid took 644 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
[2024-05-28 03:44:37] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:44:37] [INFO ] Invariant cache hit.
[2024-05-28 03:44:38] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-28 03:44:38] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 185 ms returned sat
[2024-05-28 03:44:40] [INFO ] [Real]Absence check using state equation in 2419 ms returned sat
[2024-05-28 03:44:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:44:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 03:44:41] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 47 ms returned sat
[2024-05-28 03:44:44] [INFO ] [Nat]Absence check using state equation in 3341 ms returned sat
[2024-05-28 03:44:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:44:45] [INFO ] [Nat]Added 120 Read/Feed constraints in 576 ms returned sat
[2024-05-28 03:44:45] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-05-28 03:44:45] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-28 03:44:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2024-05-28 03:44:45] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 113 ms.
[2024-05-28 03:44:51] [INFO ] Added : 75 causal constraints over 15 iterations in 6162 ms. Result :unknown
Could not prove EG (NOT p3)
[2024-05-28 03:44:51] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:44:51] [INFO ] Invariant cache hit.
[2024-05-28 03:44:52] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-28 03:44:52] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 130 ms returned sat
[2024-05-28 03:44:53] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2024-05-28 03:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:44:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 03:44:54] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 51 ms returned sat
[2024-05-28 03:44:56] [INFO ] [Nat]Absence check using state equation in 2329 ms returned sat
[2024-05-28 03:44:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:44:56] [INFO ] [Nat]Added 120 Read/Feed constraints in 289 ms returned sat
[2024-05-28 03:44:57] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-28 03:44:57] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:44:58] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:44:58] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:44:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1397 ms
[2024-05-28 03:44:58] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 114 ms.
[2024-05-28 03:45:07] [INFO ] Added : 302 causal constraints over 61 iterations in 9209 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 1883 reset in 687 ms.
Product exploration explored 100000 steps with 1950 reset in 576 ms.
Support contains 7 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1381/1381 transitions.
Applied a total of 0 rules in 24 ms. Remains 425 /425 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running 1377 sub problems to find dead transitions.
[2024-05-28 03:45:09] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:45:09] [INFO ] Invariant cache hit.
[2024-05-28 03:45:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:45:23] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-05-28 03:45:23] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-28 03:45:23] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-28 03:45:23] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:45:24] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 3 ms to minimize.
[2024-05-28 03:45:24] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 3 ms to minimize.
[2024-05-28 03:45:24] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-28 03:45:24] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-05-28 03:45:24] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 03:45:24] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:45:25] [INFO ] Deduced a trap composed of 61 places in 273 ms of which 2 ms to minimize.
[2024-05-28 03:45:25] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 2 ms to minimize.
[2024-05-28 03:45:26] [INFO ] Deduced a trap composed of 137 places in 295 ms of which 3 ms to minimize.
[2024-05-28 03:45:27] [INFO ] Deduced a trap composed of 143 places in 296 ms of which 3 ms to minimize.
[2024-05-28 03:45:27] [INFO ] Deduced a trap composed of 215 places in 369 ms of which 3 ms to minimize.
[2024-05-28 03:45:28] [INFO ] Deduced a trap composed of 253 places in 299 ms of which 3 ms to minimize.
[2024-05-28 03:45:28] [INFO ] Deduced a trap composed of 242 places in 290 ms of which 2 ms to minimize.
[2024-05-28 03:45:28] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 3 ms to minimize.
[2024-05-28 03:45:28] [INFO ] Deduced a trap composed of 203 places in 258 ms of which 3 ms to minimize.
[2024-05-28 03:45:31] [INFO ] Deduced a trap composed of 194 places in 285 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 60 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:45:44] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 3 ms to minimize.
[2024-05-28 03:45:46] [INFO ] Deduced a trap composed of 207 places in 240 ms of which 2 ms to minimize.
[2024-05-28 03:45:49] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 63 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 23/23 constraints]
After SMT, in 45930ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 45943ms
[2024-05-28 03:45:55] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:45:55] [INFO ] Invariant cache hit.
[2024-05-28 03:45:55] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-28 03:45:55] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:45:55] [INFO ] Invariant cache hit.
[2024-05-28 03:45:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:46:06] [INFO ] Implicit Places using invariants and state equation in 11022 ms returned []
Implicit Place search using SMT with State Equation took 11495 ms to find 0 implicit places.
[2024-05-28 03:46:06] [INFO ] Redundant transitions in 27 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-05-28 03:46:06] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-05-28 03:46:06] [INFO ] Invariant cache hit.
[2024-05-28 03:46:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:46:20] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-28 03:46:20] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-28 03:46:20] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-05-28 03:46:20] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-28 03:46:20] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 2 ms to minimize.
[2024-05-28 03:46:21] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 2 ms to minimize.
[2024-05-28 03:46:21] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:46:21] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2024-05-28 03:46:21] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 4 ms to minimize.
[2024-05-28 03:46:21] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-28 03:46:21] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 2 ms to minimize.
[2024-05-28 03:46:22] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2024-05-28 03:46:22] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 2 ms to minimize.
[2024-05-28 03:46:23] [INFO ] Deduced a trap composed of 143 places in 226 ms of which 2 ms to minimize.
[2024-05-28 03:46:23] [INFO ] Deduced a trap composed of 215 places in 239 ms of which 3 ms to minimize.
[2024-05-28 03:46:23] [INFO ] Deduced a trap composed of 253 places in 241 ms of which 6 ms to minimize.
[2024-05-28 03:46:24] [INFO ] Deduced a trap composed of 242 places in 336 ms of which 2 ms to minimize.
[2024-05-28 03:46:24] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 3 ms to minimize.
[2024-05-28 03:46:24] [INFO ] Deduced a trap composed of 203 places in 309 ms of which 2 ms to minimize.
[2024-05-28 03:46:27] [INFO ] Deduced a trap composed of 194 places in 344 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-05-28 03:46:40] [INFO ] Deduced a trap composed of 222 places in 326 ms of which 3 ms to minimize.
[2024-05-28 03:46:41] [INFO ] Deduced a trap composed of 210 places in 295 ms of which 3 ms to minimize.
[2024-05-28 03:46:41] [INFO ] Deduced a trap composed of 260 places in 269 ms of which 3 ms to minimize.
[2024-05-28 03:46:41] [INFO ] Deduced a trap composed of 258 places in 266 ms of which 2 ms to minimize.
SMT process timed out in 35380ms, After SMT, problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 35393ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92896 ms. Remains : 425/425 places, 1381/1381 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-08 finished in 375286 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))))'
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:46:42] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:46:42] [INFO ] Computed 44 invariants in 50 ms
[2024-05-28 03:46:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:47:00] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-05-28 03:47:01] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 46052ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 46066ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:47:28] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:47:28] [INFO ] Computed 44 invariants in 34 ms
[2024-05-28 03:47:28] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-28 03:47:28] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:47:28] [INFO ] Invariant cache hit.
[2024-05-28 03:47:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:47:42] [INFO ] Implicit Places using invariants and state equation in 14102 ms returned []
Implicit Place search using SMT with State Equation took 14811 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60898 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 703 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-09 finished in 61033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:47:43] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:47:43] [INFO ] Computed 44 invariants in 36 ms
[2024-05-28 03:47:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:48:01] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-05-28 03:48:02] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 03:48:28] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 4 ms to minimize.
[2024-05-28 03:48:28] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 40 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 4/4 constraints]
After SMT, in 45532ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45546ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:48:28] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:48:28] [INFO ] Computed 44 invariants in 31 ms
[2024-05-28 03:48:29] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-05-28 03:48:29] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:48:29] [INFO ] Invariant cache hit.
[2024-05-28 03:48:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:48:41] [INFO ] Implicit Places using invariants and state equation in 12068 ms returned []
Implicit Place search using SMT with State Equation took 12865 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 16 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58442 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-10 finished in 58561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1522
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 566 transition count 1516
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 560 transition count 1516
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 72 place count 560 transition count 1438
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 300 place count 446 transition count 1402
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 303 place count 443 transition count 1399
Iterating global reduction 3 with 3 rules applied. Total rules applied 306 place count 443 transition count 1399
Applied a total of 306 rules in 92 ms. Remains 443 /596 variables (removed 153) and now considering 1399/1552 (removed 153) transitions.
Running 1395 sub problems to find dead transitions.
[2024-05-28 03:48:41] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
// Phase 1: matrix 1375 rows 443 cols
[2024-05-28 03:48:41] [INFO ] Computed 44 invariants in 23 ms
[2024-05-28 03:48:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 03:48:56] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 3 ms to minimize.
[2024-05-28 03:48:57] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 3 ms to minimize.
[2024-05-28 03:48:57] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-28 03:48:57] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-28 03:48:57] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-28 03:48:57] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-28 03:48:58] [INFO ] Deduced a trap composed of 240 places in 318 ms of which 3 ms to minimize.
[2024-05-28 03:48:58] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-28 03:48:58] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 1 ms to minimize.
[2024-05-28 03:48:59] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 2 ms to minimize.
[2024-05-28 03:48:59] [INFO ] Deduced a trap composed of 186 places in 225 ms of which 3 ms to minimize.
[2024-05-28 03:49:00] [INFO ] Deduced a trap composed of 150 places in 236 ms of which 2 ms to minimize.
[2024-05-28 03:49:00] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 2 ms to minimize.
[2024-05-28 03:49:02] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 3 ms to minimize.
[2024-05-28 03:49:02] [INFO ] Deduced a trap composed of 145 places in 219 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1818 variables, and 55 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 03:49:15] [INFO ] Deduced a trap composed of 216 places in 266 ms of which 3 ms to minimize.
[2024-05-28 03:49:16] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 3 ms to minimize.
[2024-05-28 03:49:17] [INFO ] Deduced a trap composed of 169 places in 333 ms of which 3 ms to minimize.
[2024-05-28 03:49:18] [INFO ] Deduced a trap composed of 216 places in 358 ms of which 4 ms to minimize.
[2024-05-28 03:49:19] [INFO ] Deduced a trap composed of 244 places in 319 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1818 variables, and 60 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 20/20 constraints]
After SMT, in 45521ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 45536ms
[2024-05-28 03:49:27] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-05-28 03:49:27] [INFO ] Invariant cache hit.
[2024-05-28 03:49:27] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-28 03:49:27] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-05-28 03:49:27] [INFO ] Invariant cache hit.
[2024-05-28 03:49:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:49:39] [INFO ] Implicit Places using invariants and state equation in 11198 ms returned []
Implicit Place search using SMT with State Equation took 11806 ms to find 0 implicit places.
[2024-05-28 03:49:39] [INFO ] Redundant transitions in 37 ms returned []
Running 1395 sub problems to find dead transitions.
[2024-05-28 03:49:39] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-05-28 03:49:39] [INFO ] Invariant cache hit.
[2024-05-28 03:49:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 03:49:53] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-28 03:49:53] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 2 ms to minimize.
[2024-05-28 03:49:53] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:49:53] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 0 ms to minimize.
[2024-05-28 03:49:53] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-28 03:49:54] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 2 ms to minimize.
[2024-05-28 03:49:54] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:49:55] [INFO ] Deduced a trap composed of 240 places in 325 ms of which 3 ms to minimize.
[2024-05-28 03:49:55] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 2 ms to minimize.
[2024-05-28 03:49:56] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 4 ms to minimize.
[2024-05-28 03:49:57] [INFO ] Deduced a trap composed of 187 places in 320 ms of which 4 ms to minimize.
[2024-05-28 03:49:57] [INFO ] Deduced a trap composed of 150 places in 320 ms of which 3 ms to minimize.
[2024-05-28 03:49:58] [INFO ] Deduced a trap composed of 137 places in 316 ms of which 3 ms to minimize.
[2024-05-28 03:49:58] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 3 ms to minimize.
[2024-05-28 03:50:00] [INFO ] Deduced a trap composed of 288 places in 277 ms of which 3 ms to minimize.
[2024-05-28 03:50:00] [INFO ] Deduced a trap composed of 206 places in 333 ms of which 4 ms to minimize.
[2024-05-28 03:50:01] [INFO ] Deduced a trap composed of 181 places in 297 ms of which 3 ms to minimize.
[2024-05-28 03:50:01] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 3 ms to minimize.
[2024-05-28 03:50:01] [INFO ] Deduced a trap composed of 160 places in 254 ms of which 3 ms to minimize.
[2024-05-28 03:50:12] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 03:50:14] [INFO ] Deduced a trap composed of 136 places in 305 ms of which 3 ms to minimize.
[2024-05-28 03:50:14] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1818 variables, and 62 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-05-28 03:50:25] [INFO ] Deduced a trap composed of 234 places in 344 ms of which 4 ms to minimize.
[2024-05-28 03:50:26] [INFO ] Deduced a trap composed of 237 places in 331 ms of which 3 ms to minimize.
[2024-05-28 03:50:27] [INFO ] Deduced a trap composed of 220 places in 349 ms of which 3 ms to minimize.
[2024-05-28 03:50:28] [INFO ] Deduced a trap composed of 202 places in 305 ms of which 2 ms to minimize.
[2024-05-28 03:50:44] [INFO ] Deduced a trap composed of 225 places in 327 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1818 variables, and 67 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 27/27 constraints]
After SMT, in 66319ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 66334ms
Starting structural reductions in SI_LTL mode, iteration 1 : 443/596 places, 1399/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123825 ms. Remains : 443/596 places, 1399/1552 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-14
Stuttering criterion allowed to conclude after 615 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-14 finished in 123899 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)||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' '!(F(((G(p0) U (X(p1) U p2))&&p3)))'
[2024-05-28 03:50:46] [INFO ] Flatten gal took : 103 ms
[2024-05-28 03:50:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 03:50:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 596 places, 1552 transitions and 7748 arcs took 16 ms.
Total runtime 1331327 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 596
TRANSITIONS: 1552
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.055s, Sys 0.020s]

SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2392
MODEL NAME: /home/mcc/execution/415/model
596 places, 1552 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S04J06T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445600291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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