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.r290-tajo-171654447200467.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 itstools
Input is PolyORBNT-PT-S05J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBNT-PT-S05J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716931054215

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 21:17:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:17:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:17:35] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-28 21:17:35] [INFO ] Transformed 909 places.
[2024-05-28 21:17:35] [INFO ] Transformed 1970 transitions.
[2024-05-28 21:17:35] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 519 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Applied a total of 5 rules in 71 ms. Remains 904 /909 variables (removed 5) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-05-28 21:17:36] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2024-05-28 21:17:36] [INFO ] Computed 137 invariants in 111 ms
[2024-05-28 21:17:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 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 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 43926ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 43968ms
[2024-05-28 21:18:20] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:18:20] [INFO ] Invariant cache hit.
[2024-05-28 21:18:20] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-28 21:18:20] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:18:20] [INFO ] Invariant cache hit.
[2024-05-28 21:18:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:18:24] [INFO ] Implicit Places using invariants and state equation in 3390 ms returned []
Implicit Place search using SMT with State Equation took 3809 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-05-28 21:18:24] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:18:24] [INFO ] Invariant cache hit.
[2024-05-28 21:18:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD267 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/904 variables, 6/137 constraints. Problems are: Problem set: 1 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2215 variables, and 137 constraints, problems are : Problem set: 1 solved, 1308 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 1 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 1 solved, 1308 unsolved
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 14 places in 332 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 132 constraints, problems are : Problem set: 1 solved, 1308 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 1/1 constraints]
After SMT, in 63513ms problems are : Problem set: 1 solved, 1308 unsolved
Search for dead transitions found 1 dead transitions in 63537ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1314/1315 transitions.
Applied a total of 0 rules in 11 ms. Remains 904 /904 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111458 ms. Remains : 904/909 places, 1314/1315 transitions.
Support contains 519 out of 904 places after structural reductions.
[2024-05-28 21:19:27] [INFO ] Flatten gal took : 129 ms
[2024-05-28 21:19:28] [INFO ] Flatten gal took : 82 ms
[2024-05-28 21:19:28] [INFO ] Input system was already deterministic with 1314 transitions.
Support contains 518 out of 904 places (down from 519) after GAL structural reductions.
RANDOM walk for 40000 steps (2738 resets) in 1880 ms. (21 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40002 steps (503 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (587 resets) in 255 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (480 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (991 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (473 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (501 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (465 resets) in 157 ms. (253 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
[2024-05-28 21:19:29] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 904 cols
[2024-05-28 21:19:29] [INFO ] Computed 137 invariants in 50 ms
[2024-05-28 21:19:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 727/797 variables, 110/110 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 3 (OVERLAPS) 104/901 variables, 25/135 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/135 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/903 variables, 2/137 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/137 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1310/2213 variables, 903/1040 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2213 variables, 1/1041 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2213 variables, 0/1041 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2214 variables, 1/1042 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2214 variables, 0/1042 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2214 variables, 0/1042 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2214/2214 variables, and 1042 constraints, problems are : Problem set: 7 solved, 1 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 904/904 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/197 variables, 2/3 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/479 variables, 47/50 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/50 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 235/714 variables, 47/97 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/97 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 888/2214 variables, and 122 constraints, problems are : Problem set: 8 solved, 0 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 97/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1314ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-11 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(X(F(p0))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1314/1314 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1313
Applied a total of 2 rules in 153 ms. Remains 903 /904 variables (removed 1) and now considering 1313/1314 (removed 1) transitions.
Running 1307 sub problems to find dead transitions.
[2024-05-28 21:19:31] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
// Phase 1: matrix 1309 rows 903 cols
[2024-05-28 21:19:31] [INFO ] Computed 137 invariants in 48 ms
[2024-05-28 21:19:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 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 897/2212 variables, and 131 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
SMT process timed out in 44159ms, After SMT, problems are : Problem set: 0 solved, 1307 unsolved
Search for dead transitions found 0 dead transitions in 44183ms
[2024-05-28 21:20:15] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:20:15] [INFO ] Invariant cache hit.
[2024-05-28 21:20:16] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2024-05-28 21:20:16] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:20:16] [INFO ] Invariant cache hit.
[2024-05-28 21:20:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:20:30] [INFO ] Implicit Places using invariants and state equation in 13957 ms returned []
Implicit Place search using SMT with State Equation took 15364 ms to find 0 implicit places.
Running 1307 sub problems to find dead transitions.
[2024-05-28 21:20:30] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:20:30] [INFO ] Invariant cache hit.
[2024-05-28 21:20:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2212 variables, and 137 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Problem TDEAD347 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 94 solved, 1213 unsolved
[2024-05-28 21:21:26] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 4 ms to minimize.
[2024-05-28 21:21:26] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 3 ms to minimize.
[2024-05-28 21:21:26] [INFO ] Deduced a trap composed of 24 places in 481 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2212 variables, and 140 constraints, problems are : Problem set: 94 solved, 1213 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1307 constraints, Known Traps: 3/3 constraints]
After SMT, in 63234ms problems are : Problem set: 94 solved, 1213 unsolved
Search for dead transitions found 94 dead transitions in 63246ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1219/1314 transitions.
Applied a total of 0 rules in 24 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122982 ms. Remains : 903/904 places, 1219/1314 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 491 ms.
Product exploration explored 100000 steps with 33333 reset in 522 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 34 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-01 finished in 124469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1) U (F((p2 U p3))&&p2)))'
Support contains 125 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1314/1314 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1313
Applied a total of 2 rules in 47 ms. Remains 903 /904 variables (removed 1) and now considering 1313/1314 (removed 1) transitions.
Running 1307 sub problems to find dead transitions.
[2024-05-28 21:21:35] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:21:35] [INFO ] Invariant cache hit.
[2024-05-28 21:21:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2212 variables, and 131 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
SMT process timed out in 43005ms, After SMT, problems are : Problem set: 0 solved, 1307 unsolved
Search for dead transitions found 0 dead transitions in 43020ms
[2024-05-28 21:22:18] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:22:18] [INFO ] Invariant cache hit.
[2024-05-28 21:22:19] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2024-05-28 21:22:19] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:22:19] [INFO ] Invariant cache hit.
[2024-05-28 21:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:22:35] [INFO ] Implicit Places using invariants and state equation in 15664 ms returned []
Implicit Place search using SMT with State Equation took 16996 ms to find 0 implicit places.
Running 1307 sub problems to find dead transitions.
[2024-05-28 21:22:35] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:22:35] [INFO ] Invariant cache hit.
[2024-05-28 21:22:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
SMT process timed out in 33748ms, After SMT, problems are : Problem set: 0 solved, 1307 unsolved
Search for dead transitions found 0 dead transitions in 33760ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1313/1314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93830 ms. Remains : 903/904 places, 1313/1314 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p3), true]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-04 finished in 94014 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 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1314/1314 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1248
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1248
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1183
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1182
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1180
Applied a total of 268 rules in 328 ms. Remains 770 /904 variables (removed 134) and now considering 1180/1314 (removed 134) transitions.
Running 1174 sub problems to find dead transitions.
[2024-05-28 21:23:09] [INFO ] Flow matrix only has 1176 transitions (discarded 4 similar events)
// Phase 1: matrix 1176 rows 770 cols
[2024-05-28 21:23:09] [INFO ] Computed 137 invariants in 55 ms
[2024-05-28 21:23:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1946 variables, and 132 constraints, problems are : Problem set: 0 solved, 1174 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1174/1174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
[2024-05-28 21:23:41] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1946 variables, and 133 constraints, problems are : Problem set: 0 solved, 1174 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1174 constraints, Known Traps: 1/1 constraints]
After SMT, in 43676ms problems are : Problem set: 0 solved, 1174 unsolved
Search for dead transitions found 0 dead transitions in 43693ms
[2024-05-28 21:23:53] [INFO ] Flow matrix only has 1176 transitions (discarded 4 similar events)
[2024-05-28 21:23:53] [INFO ] Invariant cache hit.
[2024-05-28 21:23:54] [INFO ] Implicit Places using invariants in 1359 ms returned []
[2024-05-28 21:23:54] [INFO ] Flow matrix only has 1176 transitions (discarded 4 similar events)
[2024-05-28 21:23:54] [INFO ] Invariant cache hit.
[2024-05-28 21:23:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:24:08] [INFO ] Implicit Places using invariants and state equation in 13871 ms returned []
Implicit Place search using SMT with State Equation took 15257 ms to find 0 implicit places.
[2024-05-28 21:24:08] [INFO ] Redundant transitions in 66 ms returned []
Running 1174 sub problems to find dead transitions.
[2024-05-28 21:24:08] [INFO ] Flow matrix only has 1176 transitions (discarded 4 similar events)
[2024-05-28 21:24:08] [INFO ] Invariant cache hit.
[2024-05-28 21:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
[2024-05-28 21:24:31] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1946 variables, and 133 constraints, problems are : Problem set: 0 solved, 1174 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1174/1174 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
[2024-05-28 21:24:50] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1946 variables, and 134 constraints, problems are : Problem set: 0 solved, 1174 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1174 constraints, Known Traps: 2/2 constraints]
After SMT, in 63279ms problems are : Problem set: 0 solved, 1174 unsolved
Search for dead transitions found 0 dead transitions in 63290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1180/1314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122649 ms. Remains : 770/904 places, 1180/1314 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-06
Stuttering criterion allowed to conclude after 49 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-06 finished in 122725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 8 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1314/1314 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1249
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 772 transition count 1182
Applied a total of 264 rules in 216 ms. Remains 772 /904 variables (removed 132) and now considering 1182/1314 (removed 132) transitions.
Running 1176 sub problems to find dead transitions.
[2024-05-28 21:25:12] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 772 cols
[2024-05-28 21:25:12] [INFO ] Computed 137 invariants in 112 ms
[2024-05-28 21:25:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.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 1.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 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.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 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.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 0.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 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.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 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.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 4.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 1.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)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 8.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 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 (/ 2.0 3.0))
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 (/ 2.0 3.0))
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 2.0)
timeout
(s300 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1950 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2024-05-28 21:25:36] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 14 ms to minimize.
[2024-05-28 21:25:50] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 4 ms to minimize.
[2024-05-28 21:25:51] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1950 variables, and 135 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 3/3 constraints]
After SMT, in 43138ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 43148ms
[2024-05-28 21:25:55] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2024-05-28 21:25:55] [INFO ] Invariant cache hit.
[2024-05-28 21:25:56] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2024-05-28 21:25:56] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2024-05-28 21:25:56] [INFO ] Invariant cache hit.
[2024-05-28 21:25:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:26:08] [INFO ] Implicit Places using invariants and state equation in 11653 ms returned []
Implicit Place search using SMT with State Equation took 12839 ms to find 0 implicit places.
[2024-05-28 21:26:08] [INFO ] Redundant transitions in 15 ms returned []
Running 1176 sub problems to find dead transitions.
[2024-05-28 21:26:08] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2024-05-28 21:26:08] [INFO ] Invariant cache hit.
[2024-05-28 21:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Problem TDEAD743 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 5/772 variables, 5/137 constraints. Problems are: Problem set: 94 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/1950 variables, and 137 constraints, problems are : Problem set: 94 solved, 1082 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 94 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 94 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 94 solved, 1082 unsolved
[2024-05-28 21:26:45] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:26:58] [INFO ] Deduced a trap composed of 192 places in 428 ms of which 6 ms to minimize.
[2024-05-28 21:26:58] [INFO ] Deduced a trap composed of 203 places in 306 ms of which 4 ms to minimize.
[2024-05-28 21:27:00] [INFO ] Deduced a trap composed of 15 places in 409 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 4/136 constraints. Problems are: Problem set: 94 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1950 variables, and 136 constraints, problems are : Problem set: 94 solved, 1082 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 4/4 constraints]
After SMT, in 63356ms problems are : Problem set: 94 solved, 1082 unsolved
Search for dead transitions found 94 dead transitions in 63367ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 772/904 places, 1088/1314 transitions.
Applied a total of 0 rules in 54 ms. Remains 772 /772 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
[2024-05-28 21:27:12] [INFO ] Redundant transitions in 80 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 119760 ms. Remains : 772/904 places, 1088/1314 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-07
Product exploration explored 100000 steps with 9102 reset in 1018 ms.
Product exploration explored 100000 steps with 9096 reset in 871 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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2107 resets) in 421 ms. (94 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1428 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
[2024-05-28 21:27:14] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
// Phase 1: matrix 1084 rows 772 cols
[2024-05-28 21:27:14] [INFO ] Computed 137 invariants in 14 ms
[2024-05-28 21:27:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 534/542 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/752 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/772 variables, 18/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1084/1856 variables, 772/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1856 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1856 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1856 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1856/1856 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 772/772 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 534/542 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 210/752 variables, 111/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 772/1856 variables, and 138 constraints, problems are : Problem set: 1 solved, 0 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1442ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 772 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1088/1088 transitions.
Applied a total of 0 rules in 47 ms. Remains 772 /772 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
Running 1082 sub problems to find dead transitions.
[2024-05-28 21:27:16] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:27:16] [INFO ] Invariant cache hit.
[2024-05-28 21:27:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:27:30] [INFO ] Deduced a trap composed of 198 places in 359 ms of which 6 ms to minimize.
[2024-05-28 21:27:31] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
[2024-05-28 21:27:31] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 5 ms to minimize.
[2024-05-28 21:27:31] [INFO ] Deduced a trap composed of 250 places in 353 ms of which 5 ms to minimize.
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 5 ms to minimize.
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:27:33] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:27:33] [INFO ] Deduced a trap composed of 247 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:27:33] [INFO ] Deduced a trap composed of 235 places in 348 ms of which 5 ms to minimize.
[2024-05-28 21:27:34] [INFO ] Deduced a trap composed of 198 places in 331 ms of which 5 ms to minimize.
[2024-05-28 21:27:34] [INFO ] Deduced a trap composed of 138 places in 338 ms of which 5 ms to minimize.
[2024-05-28 21:27:35] [INFO ] Deduced a trap composed of 147 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:27:35] [INFO ] Deduced a trap composed of 210 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:27:35] [INFO ] Deduced a trap composed of 138 places in 272 ms of which 18 ms to minimize.
[2024-05-28 21:27:36] [INFO ] Deduced a trap composed of 144 places in 344 ms of which 5 ms to minimize.
[2024-05-28 21:27:36] [INFO ] Deduced a trap composed of 198 places in 322 ms of which 6 ms to minimize.
[2024-05-28 21:27:37] [INFO ] Deduced a trap composed of 138 places in 589 ms of which 3 ms to minimize.
[2024-05-28 21:27:37] [INFO ] Deduced a trap composed of 138 places in 367 ms of which 6 ms to minimize.
[2024-05-28 21:27:37] [INFO ] Deduced a trap composed of 244 places in 230 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:27:39] [INFO ] Deduced a trap composed of 241 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 22759ms, After SMT, problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 22771ms
[2024-05-28 21:27:39] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:27:39] [INFO ] Invariant cache hit.
[2024-05-28 21:27:40] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2024-05-28 21:27:40] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:27:40] [INFO ] Invariant cache hit.
[2024-05-28 21:27:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:27:52] [INFO ] Implicit Places using invariants and state equation in 12349 ms returned []
Implicit Place search using SMT with State Equation took 13372 ms to find 0 implicit places.
[2024-05-28 21:27:52] [INFO ] Redundant transitions in 18 ms returned []
Running 1082 sub problems to find dead transitions.
[2024-05-28 21:27:52] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2024-05-28 21:27:52] [INFO ] Invariant cache hit.
[2024-05-28 21:27:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:28:04] [INFO ] Deduced a trap composed of 198 places in 223 ms of which 4 ms to minimize.
[2024-05-28 21:28:05] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:28:05] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 5 ms to minimize.
[2024-05-28 21:28:05] [INFO ] Deduced a trap composed of 250 places in 244 ms of which 13 ms to minimize.
[2024-05-28 21:28:06] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:28:06] [INFO ] Deduced a trap composed of 198 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:28:06] [INFO ] Deduced a trap composed of 198 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:28:07] [INFO ] Deduced a trap composed of 198 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:28:07] [INFO ] Deduced a trap composed of 247 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:28:07] [INFO ] Deduced a trap composed of 235 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:28:07] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:28:08] [INFO ] Deduced a trap composed of 138 places in 274 ms of which 3 ms to minimize.
[2024-05-28 21:28:08] [INFO ] Deduced a trap composed of 147 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:28:09] [INFO ] Deduced a trap composed of 210 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:28:09] [INFO ] Deduced a trap composed of 138 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:28:09] [INFO ] Deduced a trap composed of 144 places in 359 ms of which 5 ms to minimize.
[2024-05-28 21:28:10] [INFO ] Deduced a trap composed of 198 places in 328 ms of which 5 ms to minimize.
[2024-05-28 21:28:10] [INFO ] Deduced a trap composed of 138 places in 344 ms of which 6 ms to minimize.
[2024-05-28 21:28:11] [INFO ] Deduced a trap composed of 138 places in 378 ms of which 5 ms to minimize.
[2024-05-28 21:28:11] [INFO ] Deduced a trap composed of 244 places in 342 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:28:12] [INFO ] Deduced a trap composed of 241 places in 344 ms of which 9 ms to minimize.
[2024-05-28 21:28:13] [INFO ] Deduced a trap composed of 235 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:28:13] [INFO ] Deduced a trap composed of 244 places in 326 ms of which 5 ms to minimize.
[2024-05-28 21:28:14] [INFO ] Deduced a trap composed of 250 places in 306 ms of which 5 ms to minimize.
[2024-05-28 21:28:14] [INFO ] Deduced a trap composed of 268 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:28:14] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:28:15] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 4 ms to minimize.
[2024-05-28 21:28:15] [INFO ] Deduced a trap composed of 198 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:28:15] [INFO ] Deduced a trap composed of 198 places in 347 ms of which 6 ms to minimize.
[2024-05-28 21:28:16] [INFO ] Deduced a trap composed of 198 places in 366 ms of which 5 ms to minimize.
[2024-05-28 21:28:16] [INFO ] Deduced a trap composed of 235 places in 353 ms of which 6 ms to minimize.
[2024-05-28 21:28:17] [INFO ] Deduced a trap composed of 198 places in 351 ms of which 5 ms to minimize.
[2024-05-28 21:28:18] [INFO ] Deduced a trap composed of 251 places in 313 ms of which 5 ms to minimize.
[2024-05-28 21:28:18] [INFO ] Deduced a trap composed of 199 places in 330 ms of which 5 ms to minimize.
[2024-05-28 21:28:19] [INFO ] Deduced a trap composed of 199 places in 401 ms of which 5 ms to minimize.
[2024-05-28 21:28:19] [INFO ] Deduced a trap composed of 238 places in 370 ms of which 5 ms to minimize.
[2024-05-28 21:28:19] [INFO ] Deduced a trap composed of 250 places in 368 ms of which 6 ms to minimize.
[2024-05-28 21:28:20] [INFO ] Deduced a trap composed of 247 places in 345 ms of which 5 ms to minimize.
[2024-05-28 21:28:20] [INFO ] Deduced a trap composed of 244 places in 327 ms of which 5 ms to minimize.
[2024-05-28 21:28:20] [INFO ] Deduced a trap composed of 241 places in 304 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1856 variables, and 172 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:28:32] [INFO ] Deduced a trap composed of 198 places in 336 ms of which 5 ms to minimize.
[2024-05-28 21:28:32] [INFO ] Deduced a trap composed of 198 places in 319 ms of which 5 ms to minimize.
[2024-05-28 21:28:33] [INFO ] Deduced a trap composed of 198 places in 332 ms of which 5 ms to minimize.
[2024-05-28 21:28:33] [INFO ] Deduced a trap composed of 241 places in 361 ms of which 5 ms to minimize.
[2024-05-28 21:28:33] [INFO ] Deduced a trap composed of 238 places in 347 ms of which 5 ms to minimize.
[2024-05-28 21:28:34] [INFO ] Deduced a trap composed of 202 places in 404 ms of which 5 ms to minimize.
[2024-05-28 21:28:34] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 4 ms to minimize.
[2024-05-28 21:28:34] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
[2024-05-28 21:28:35] [INFO ] Deduced a trap composed of 199 places in 435 ms of which 5 ms to minimize.
[2024-05-28 21:28:35] [INFO ] Deduced a trap composed of 207 places in 348 ms of which 5 ms to minimize.
[2024-05-28 21:28:36] [INFO ] Deduced a trap composed of 204 places in 307 ms of which 3 ms to minimize.
[2024-05-28 21:28:36] [INFO ] Deduced a trap composed of 198 places in 410 ms of which 5 ms to minimize.
[2024-05-28 21:28:37] [INFO ] Deduced a trap composed of 210 places in 389 ms of which 6 ms to minimize.
[2024-05-28 21:28:37] [INFO ] Deduced a trap composed of 138 places in 430 ms of which 6 ms to minimize.
[2024-05-28 21:28:38] [INFO ] Deduced a trap composed of 139 places in 381 ms of which 5 ms to minimize.
[2024-05-28 21:28:38] [INFO ] Deduced a trap composed of 138 places in 400 ms of which 5 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 142 places in 394 ms of which 5 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 138 places in 353 ms of which 5 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 142 places in 322 ms of which 5 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 138 places in 279 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1856 variables, and 192 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 60/60 constraints]
After SMT, in 62896ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 62906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 99132 ms. Remains : 772/772 places, 1088/1088 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 66 steps (5 resets) in 9 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9143 reset in 848 ms.
Product exploration explored 100000 steps with 9076 reset in 1115 ms.
Built C files in :
/tmp/ltsmin8294160895465928998
[2024-05-28 21:28:57] [INFO ] Computing symmetric may disable matrix : 1088 transitions.
[2024-05-28 21:28:58] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:28:58] [INFO ] Computing symmetric may enable matrix : 1088 transitions.
[2024-05-28 21:28:58] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:28:58] [INFO ] Computing Do-Not-Accords matrix : 1088 transitions.
[2024-05-28 21:28:58] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:28:58] [INFO ] Built C files in 356ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8294160895465928998
Running compilation step : cd /tmp/ltsmin8294160895465928998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8294160895465928998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8294160895465928998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1088/1088 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 771 transition count 1087
Applied a total of 2 rules in 79 ms. Remains 771 /772 variables (removed 1) and now considering 1087/1088 (removed 1) transitions.
Running 1081 sub problems to find dead transitions.
[2024-05-28 21:29:01] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2024-05-28 21:29:01] [INFO ] Computed 137 invariants in 28 ms
[2024-05-28 21:29:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:29:14] [INFO ] Deduced a trap composed of 274 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:29:14] [INFO ] Deduced a trap composed of 259 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:29:15] [INFO ] Deduced a trap composed of 252 places in 270 ms of which 3 ms to minimize.
[2024-05-28 21:29:15] [INFO ] Deduced a trap composed of 214 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:29:15] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:29:16] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 3 ms to minimize.
[2024-05-28 21:29:16] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:29:16] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:29:16] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:29:17] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 3 ms to minimize.
[2024-05-28 21:29:17] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 3 ms to minimize.
[2024-05-28 21:29:17] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:29:18] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 3 ms to minimize.
[2024-05-28 21:29:18] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:29:18] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 3 ms to minimize.
[2024-05-28 21:29:18] [INFO ] Deduced a trap composed of 245 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:29:19] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:29:19] [INFO ] Deduced a trap composed of 247 places in 238 ms of which 3 ms to minimize.
[2024-05-28 21:29:19] [INFO ] Deduced a trap composed of 263 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:29:20] [INFO ] Deduced a trap composed of 206 places in 296 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:29:21] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:29:21] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:29:22] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 3 ms to minimize.
[2024-05-28 21:29:23] [INFO ] Deduced a trap composed of 249 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:29:23] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:29:23] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 16 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 252 places in 257 ms of which 4 ms to minimize.
SMT process timed out in 23363ms, After SMT, problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 23372ms
[2024-05-28 21:29:24] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2024-05-28 21:29:24] [INFO ] Invariant cache hit.
[2024-05-28 21:29:26] [INFO ] Implicit Places using invariants in 1709 ms returned []
[2024-05-28 21:29:26] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2024-05-28 21:29:26] [INFO ] Invariant cache hit.
[2024-05-28 21:29:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:29:41] [INFO ] Implicit Places using invariants and state equation in 14600 ms returned []
Implicit Place search using SMT with State Equation took 16325 ms to find 0 implicit places.
[2024-05-28 21:29:41] [INFO ] Redundant transitions in 13 ms returned []
Running 1081 sub problems to find dead transitions.
[2024-05-28 21:29:41] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2024-05-28 21:29:41] [INFO ] Invariant cache hit.
[2024-05-28 21:29:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:29:54] [INFO ] Deduced a trap composed of 210 places in 319 ms of which 6 ms to minimize.
[2024-05-28 21:29:55] [INFO ] Deduced a trap composed of 240 places in 264 ms of which 5 ms to minimize.
[2024-05-28 21:29:55] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:29:55] [INFO ] Deduced a trap composed of 240 places in 284 ms of which 9 ms to minimize.
[2024-05-28 21:29:55] [INFO ] Deduced a trap composed of 198 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:29:56] [INFO ] Deduced a trap composed of 244 places in 331 ms of which 5 ms to minimize.
[2024-05-28 21:29:56] [INFO ] Deduced a trap composed of 239 places in 346 ms of which 5 ms to minimize.
[2024-05-28 21:29:57] [INFO ] Deduced a trap composed of 265 places in 354 ms of which 4 ms to minimize.
[2024-05-28 21:29:57] [INFO ] Deduced a trap composed of 225 places in 400 ms of which 6 ms to minimize.
[2024-05-28 21:29:58] [INFO ] Deduced a trap composed of 208 places in 384 ms of which 4 ms to minimize.
[2024-05-28 21:29:58] [INFO ] Deduced a trap composed of 255 places in 295 ms of which 4 ms to minimize.
[2024-05-28 21:29:58] [INFO ] Deduced a trap composed of 206 places in 287 ms of which 3 ms to minimize.
[2024-05-28 21:29:59] [INFO ] Deduced a trap composed of 202 places in 331 ms of which 4 ms to minimize.
[2024-05-28 21:29:59] [INFO ] Deduced a trap composed of 208 places in 383 ms of which 6 ms to minimize.
[2024-05-28 21:29:59] [INFO ] Deduced a trap composed of 208 places in 324 ms of which 4 ms to minimize.
[2024-05-28 21:30:00] [INFO ] Deduced a trap composed of 258 places in 375 ms of which 5 ms to minimize.
[2024-05-28 21:30:00] [INFO ] Deduced a trap composed of 227 places in 350 ms of which 6 ms to minimize.
[2024-05-28 21:30:01] [INFO ] Deduced a trap composed of 197 places in 337 ms of which 5 ms to minimize.
[2024-05-28 21:30:01] [INFO ] Deduced a trap composed of 197 places in 268 ms of which 5 ms to minimize.
[2024-05-28 21:30:01] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:30:03] [INFO ] Deduced a trap composed of 208 places in 219 ms of which 4 ms to minimize.
[2024-05-28 21:30:03] [INFO ] Deduced a trap composed of 259 places in 328 ms of which 5 ms to minimize.
[2024-05-28 21:30:04] [INFO ] Deduced a trap composed of 238 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:30:04] [INFO ] Deduced a trap composed of 207 places in 344 ms of which 6 ms to minimize.
[2024-05-28 21:30:04] [INFO ] Deduced a trap composed of 208 places in 344 ms of which 5 ms to minimize.
[2024-05-28 21:30:05] [INFO ] Deduced a trap composed of 197 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:30:05] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:30:05] [INFO ] Deduced a trap composed of 206 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:30:06] [INFO ] Deduced a trap composed of 207 places in 261 ms of which 3 ms to minimize.
[2024-05-28 21:30:06] [INFO ] Deduced a trap composed of 237 places in 238 ms of which 3 ms to minimize.
[2024-05-28 21:30:06] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:30:06] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:30:07] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 3 ms to minimize.
[2024-05-28 21:30:07] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:30:07] [INFO ] Deduced a trap composed of 243 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 212 places in 275 ms of which 6 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 204 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 207 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:30:09] [INFO ] Deduced a trap composed of 208 places in 338 ms of which 5 ms to minimize.
[2024-05-28 21:30:09] [INFO ] Deduced a trap composed of 209 places in 242 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1854 variables, and 172 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:30:30] [INFO ] Deduced a trap composed of 357 places in 316 ms of which 4 ms to minimize.
[2024-05-28 21:30:31] [INFO ] Deduced a trap composed of 244 places in 270 ms of which 4 ms to minimize.
[2024-05-28 21:30:31] [INFO ] Deduced a trap composed of 342 places in 247 ms of which 3 ms to minimize.
[2024-05-28 21:30:31] [INFO ] Deduced a trap composed of 253 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:30:31] [INFO ] Deduced a trap composed of 239 places in 268 ms of which 4 ms to minimize.
[2024-05-28 21:30:32] [INFO ] Deduced a trap composed of 249 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:30:32] [INFO ] Deduced a trap composed of 239 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:30:32] [INFO ] Deduced a trap composed of 235 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:30:33] [INFO ] Deduced a trap composed of 241 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:30:33] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-28 21:30:33] [INFO ] Deduced a trap composed of 252 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:30:33] [INFO ] Deduced a trap composed of 240 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:30:34] [INFO ] Deduced a trap composed of 320 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:30:34] [INFO ] Deduced a trap composed of 261 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:30:34] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-28 21:30:42] [INFO ] Deduced a trap composed of 235 places in 429 ms of which 5 ms to minimize.
[2024-05-28 21:30:42] [INFO ] Deduced a trap composed of 252 places in 406 ms of which 5 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 244 places in 423 ms of which 5 ms to minimize.
SMT process timed out in 62704ms, After SMT, problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 62713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/772 places, 1087/1088 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102534 ms. Remains : 771/772 places, 1087/1088 transitions.
Built C files in :
/tmp/ltsmin15017604159794541589
[2024-05-28 21:30:43] [INFO ] Computing symmetric may disable matrix : 1087 transitions.
[2024-05-28 21:30:43] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:30:43] [INFO ] Computing symmetric may enable matrix : 1087 transitions.
[2024-05-28 21:30:43] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:30:44] [INFO ] Computing Do-Not-Accords matrix : 1087 transitions.
[2024-05-28 21:30:44] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:30:44] [INFO ] Built C files in 361ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15017604159794541589
Running compilation step : cd /tmp/ltsmin15017604159794541589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15017604159794541589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15017604159794541589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 21:30:47] [INFO ] Flatten gal took : 134 ms
[2024-05-28 21:30:47] [INFO ] Flatten gal took : 116 ms
[2024-05-28 21:30:47] [INFO ] Time to serialize gal into /tmp/LTL924458715336651423.gal : 34 ms
[2024-05-28 21:30:47] [INFO ] Time to serialize properties into /tmp/LTL14701675995391248236.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL924458715336651423.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12108856258886624316.hoa' '-atoms' '/tmp/LTL14701675995391248236.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14701675995391248236.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12108856258886624316.hoa
Detected timeout of ITS tools.
[2024-05-28 21:31:03] [INFO ] Flatten gal took : 108 ms
[2024-05-28 21:31:03] [INFO ] Flatten gal took : 95 ms
[2024-05-28 21:31:03] [INFO ] Time to serialize gal into /tmp/LTL1018704726062228972.gal : 20 ms
[2024-05-28 21:31:03] [INFO ] Time to serialize properties into /tmp/LTL10128030911292133526.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1018704726062228972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10128030911292133526.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((place_482_1_4+place_482_1_3)+(place_482_1_5+place_482_1_2))+place_482_1_1)<=cSources)")||(G("(place_518_1>CanInjectEvent)...162
Formula 0 simplified : G(F!"(place_518_1>CanInjectEvent)" & FG!"((((place_482_1_4+place_482_1_3)+(place_482_1_5+place_482_1_2))+place_482_1_1)<=cSources)")
Detected timeout of ITS tools.
[2024-05-28 21:31:18] [INFO ] Flatten gal took : 59 ms
[2024-05-28 21:31:18] [INFO ] Applying decomposition
[2024-05-28 21:31:18] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8108161571607499758.txt' '-o' '/tmp/graph8108161571607499758.bin' '-w' '/tmp/graph8108161571607499758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8108161571607499758.bin' '-l' '-1' '-v' '-w' '/tmp/graph8108161571607499758.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:31:18] [INFO ] Decomposing Gal with order
[2024-05-28 21:31:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:31:19] [INFO ] Removed a total of 380 redundant transitions.
[2024-05-28 21:31:19] [INFO ] Flatten gal took : 741 ms
[2024-05-28 21:31:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 321 labels/synchronizations in 67 ms.
[2024-05-28 21:31:20] [INFO ] Time to serialize gal into /tmp/LTL4848074898508975774.gal : 34 ms
[2024-05-28 21:31:20] [INFO ] Time to serialize properties into /tmp/LTL3265930174934562149.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4848074898508975774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3265930174934562149.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((gu47.place_482_1_4+gu47.place_482_1_3)+(gu47.place_482_1_5+gu47.place_482_1_2))+gu47.place_482_1_1)<=gu47.cSources)")||(G...202
Formula 0 simplified : G(F!"(gu45.place_518_1>gu45.CanInjectEvent)" & FG!"((((gu47.place_482_1_4+gu47.place_482_1_3)+(gu47.place_482_1_5+gu47.place_482_1_2...195
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-07 finished in 382862 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 U p1)||X(F(p1)))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1314/1314 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1249
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 839 transition count 1248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 838 transition count 1248
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 838 transition count 1184
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 774 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 773 transition count 1183
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 773 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 771 transition count 1181
Applied a total of 266 rules in 245 ms. Remains 771 /904 variables (removed 133) and now considering 1181/1314 (removed 133) transitions.
Running 1175 sub problems to find dead transitions.
[2024-05-28 21:31:35] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 771 cols
[2024-05-28 21:31:35] [INFO ] Computed 137 invariants in 40 ms
[2024-05-28 21:31:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 21:31:58] [INFO ] Deduced a trap composed of 14 places in 407 ms of which 6 ms to minimize.
SMT process timed out in 23289ms, After SMT, problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 23323ms
[2024-05-28 21:31:58] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:31:58] [INFO ] Invariant cache hit.
[2024-05-28 21:32:00] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2024-05-28 21:32:00] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:32:00] [INFO ] Invariant cache hit.
[2024-05-28 21:32:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:32:14] [INFO ] Implicit Places using invariants and state equation in 13911 ms returned []
Implicit Place search using SMT with State Equation took 15314 ms to find 0 implicit places.
[2024-05-28 21:32:14] [INFO ] Redundant transitions in 16 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-28 21:32:14] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:32:14] [INFO ] Invariant cache hit.
[2024-05-28 21:32:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD743 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/771 variables, 5/137 constraints. Problems are: Problem set: 94 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/1948 variables, and 137 constraints, problems are : Problem set: 94 solved, 1081 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 94 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 94 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 94 solved, 1081 unsolved
[2024-05-28 21:32:51] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-28 21:32:51] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-28 21:32:58] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 3/135 constraints. Problems are: Problem set: 94 solved, 1081 unsolved
[2024-05-28 21:33:07] [INFO ] Deduced a trap composed of 187 places in 322 ms of which 4 ms to minimize.
[2024-05-28 21:33:07] [INFO ] Deduced a trap composed of 190 places in 291 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 2/137 constraints. Problems are: Problem set: 94 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1948 variables, and 137 constraints, problems are : Problem set: 94 solved, 1081 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 5/5 constraints]
After SMT, in 63343ms problems are : Problem set: 94 solved, 1081 unsolved
Search for dead transitions found 94 dead transitions in 63353ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 771/904 places, 1087/1314 transitions.
Applied a total of 0 rules in 25 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2024-05-28 21:33:17] [INFO ] Redundant transitions in 14 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 102343 ms. Remains : 771/904 places, 1087/1314 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-08
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-08 finished in 102461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G((p1&&X(X(G(p2)))))))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1314/1314 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1313
Applied a total of 2 rules in 60 ms. Remains 903 /904 variables (removed 1) and now considering 1313/1314 (removed 1) transitions.
Running 1307 sub problems to find dead transitions.
[2024-05-28 21:33:17] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
// Phase 1: matrix 1309 rows 903 cols
[2024-05-28 21:33:17] [INFO ] Computed 137 invariants in 17 ms
[2024-05-28 21:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2212 variables, and 131 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(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 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(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 1)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(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 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2212 variables, and 131 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1307 constraints, Known Traps: 0/0 constraints]
After SMT, in 43799ms problems are : Problem set: 0 solved, 1307 unsolved
Search for dead transitions found 0 dead transitions in 43820ms
[2024-05-28 21:34:01] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:34:01] [INFO ] Invariant cache hit.
[2024-05-28 21:34:02] [INFO ] Implicit Places using invariants in 1518 ms returned []
[2024-05-28 21:34:02] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:34:02] [INFO ] Invariant cache hit.
[2024-05-28 21:34:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:34:18] [INFO ] Implicit Places using invariants and state equation in 15181 ms returned []
Implicit Place search using SMT with State Equation took 16701 ms to find 0 implicit places.
Running 1307 sub problems to find dead transitions.
[2024-05-28 21:34:18] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:34:18] [INFO ] Invariant cache hit.
[2024-05-28 21:34:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2212 variables, and 137 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Problem TDEAD347 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 94 solved, 1213 unsolved
[2024-05-28 21:35:15] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 3 ms to minimize.
[2024-05-28 21:35:16] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 2 ms to minimize.
[2024-05-28 21:35:16] [INFO ] Deduced a trap composed of 24 places in 528 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(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 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(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 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(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 1)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(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 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(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)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(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)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 9)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(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 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(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 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(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)
(s345 0)
(s346 1)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(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 0)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s404 1)
(s405 0)
(s406 0)
(s407 1)
(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 1)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 1)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 1)
(s457 1)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 1)
(s486 0)
(s487 1)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(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 0)
(s518 1)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 1)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(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 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 1)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 1)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 1)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2212 variables, and 140 constraints, problems are : Problem set: 94 solved, 1213 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1307 constraints, Known Traps: 3/3 constraints]
After SMT, in 63207ms problems are : Problem set: 94 solved, 1213 unsolved
Search for dead transitions found 94 dead transitions in 63218ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1219/1314 transitions.
Applied a total of 0 rules in 15 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123821 ms. Remains : 903/904 places, 1219/1314 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 331 steps with 24 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-09 finished in 123989 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 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1314/1314 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1248
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1248
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1183
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1182
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1180
Applied a total of 268 rules in 75 ms. Remains 770 /904 variables (removed 134) and now considering 1180/1314 (removed 134) transitions.
Running 1174 sub problems to find dead transitions.
[2024-05-28 21:35:21] [INFO ] Flow matrix only has 1176 transitions (discarded 4 similar events)
// Phase 1: matrix 1176 rows 770 cols
[2024-05-28 21:35:21] [INFO ] Computed 137 invariants in 15 ms
[2024-05-28 21:35:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
[2024-05-28 21:35:44] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 5 ms to minimize.
SMT process timed out in 23213ms, After SMT, problems are : Problem set: 0 solved, 1174 unsolved
Search for dead transitions found 0 dead transitions in 23223ms
[2024-05-28 21:35:44] [INFO ] Flow matrix only has 1176 transitions (discarded 4 similar events)
[2024-05-28 21:35:44] [INFO ] Invariant cache hit.
[2024-05-28 21:35:45] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2024-05-28 21:35:45] [INFO ] Flow matrix only has 1176 transitions (discarded 4 similar events)
[2024-05-28 21:35:45] [INFO ] Invariant cache hit.
[2024-05-28 21:35:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:35:59] [INFO ] Implicit Places using invariants and state equation in 13765 ms returned []
Implicit Place search using SMT with State Equation took 14861 ms to find 0 implicit places.
[2024-05-28 21:35:59] [INFO ] Redundant transitions in 18 ms returned []
Running 1174 sub problems to find dead transitions.
[2024-05-28 21:35:59] [INFO ] Flow matrix only has 1176 transitions (discarded 4 similar events)
[2024-05-28 21:35:59] [INFO ] Invariant cache hit.
[2024-05-28 21:35:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
[2024-05-28 21:36:22] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1946 variables, and 133 constraints, problems are : Problem set: 0 solved, 1174 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1174/1174 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
[2024-05-28 21:36:43] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1946 variables, and 134 constraints, problems are : Problem set: 0 solved, 1174 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1174 constraints, Known Traps: 2/2 constraints]
After SMT, in 63894ms problems are : Problem set: 0 solved, 1174 unsolved
Search for dead transitions found 0 dead transitions in 63911ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1180/1314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102114 ms. Remains : 770/904 places, 1180/1314 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-12 finished in 102224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1314/1314 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1313
Applied a total of 2 rules in 40 ms. Remains 903 /904 variables (removed 1) and now considering 1313/1314 (removed 1) transitions.
Running 1307 sub problems to find dead transitions.
[2024-05-28 21:37:03] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
// Phase 1: matrix 1309 rows 903 cols
[2024-05-28 21:37:03] [INFO ] Computed 137 invariants in 30 ms
[2024-05-28 21:37:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2212 variables, and 131 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
SMT process timed out in 43106ms, After SMT, problems are : Problem set: 0 solved, 1307 unsolved
Search for dead transitions found 0 dead transitions in 43119ms
[2024-05-28 21:37:46] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:37:46] [INFO ] Invariant cache hit.
[2024-05-28 21:37:48] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2024-05-28 21:37:48] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:37:48] [INFO ] Invariant cache hit.
[2024-05-28 21:37:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:38:03] [INFO ] Implicit Places using invariants and state equation in 15541 ms returned []
Implicit Place search using SMT with State Equation took 16871 ms to find 0 implicit places.
Running 1307 sub problems to find dead transitions.
[2024-05-28 21:38:03] [INFO ] Flow matrix only has 1309 transitions (discarded 4 similar events)
[2024-05-28 21:38:03] [INFO ] Invariant cache hit.
[2024-05-28 21:38:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2212 variables, and 131 constraints, problems are : Problem set: 0 solved, 1307 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1307/1307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1307 unsolved
Problem TDEAD347 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 94 solved, 1213 unsolved
[2024-05-28 21:38:59] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:38:59] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-05-28 21:39:00] [INFO ] Deduced a trap composed of 24 places in 398 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2212 variables, and 140 constraints, problems are : Problem set: 94 solved, 1213 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1307 constraints, Known Traps: 3/3 constraints]
After SMT, in 63227ms problems are : Problem set: 94 solved, 1213 unsolved
Search for dead transitions found 94 dead transitions in 63240ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1219/1314 transitions.
Applied a total of 0 rules in 20 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123296 ms. Remains : 903/904 places, 1219/1314 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 349 ms.
Product exploration explored 100000 steps with 33333 reset in 355 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-13 finished in 124184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-28 21:39:08] [INFO ] Flatten gal took : 97 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5530858999140617477
[2024-05-28 21:39:08] [INFO ] Computing symmetric may disable matrix : 1314 transitions.
[2024-05-28 21:39:08] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:39:08] [INFO ] Applying decomposition
[2024-05-28 21:39:08] [INFO ] Computing symmetric may enable matrix : 1314 transitions.
[2024-05-28 21:39:08] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:39:08] [INFO ] Flatten gal took : 117 ms
[2024-05-28 21:39:08] [INFO ] Computing Do-Not-Accords matrix : 1314 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14944876776812521401.txt' '-o' '/tmp/graph14944876776812521401.bin' '-w' '/tmp/graph14944876776812521401.weights'
[2024-05-28 21:39:08] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:39:08] [INFO ] Built C files in 506ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5530858999140617477
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14944876776812521401.bin' '-l' '-1' '-v' '-w' '/tmp/graph14944876776812521401.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin5530858999140617477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 21:39:08] [INFO ] Decomposing Gal with order
[2024-05-28 21:39:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:39:09] [INFO ] Removed a total of 1346 redundant transitions.
[2024-05-28 21:39:09] [INFO ] Flatten gal took : 146 ms
[2024-05-28 21:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 508 labels/synchronizations in 58 ms.
[2024-05-28 21:39:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality14149785102826622561.gal : 19 ms
[2024-05-28 21:39:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality9474773299121152314.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14149785102826622561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9474773299121152314.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((gu106.place_482_1_4+gu106.place_482_1_3)+(gu106.place_482_1_5+gu106.place_482_1_2))+gu106.place_482_1_1)<=gu106.cSources)...206
Formula 0 simplified : G(F!"(gu8.place_518_1>gu8.CanInjectEvent)" & FG!"((((gu106.place_482_1_4+gu106.place_482_1_3)+(gu106.place_482_1_5+gu106.place_482_1...199
Compilation finished in 5652 ms.
Running link step : cd /tmp/ltsmin5530858999140617477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 135 ms.
Running LTSmin : cd /tmp/ltsmin5530858999140617477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 22:06:20] [INFO ] Flatten gal took : 161 ms
[2024-05-28 22:06:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality560269362608533937.gal : 23 ms
[2024-05-28 22:06:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality5633992866433535648.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality560269362608533937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5633992866433535648.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((place_482_1_4+place_482_1_3)+(place_482_1_5+place_482_1_2))+place_482_1_1)<=cSources)")||(G("(place_518_1>CanInjectEvent)...162
Formula 0 simplified : G(F!"(place_518_1>CanInjectEvent)" & FG!"((((place_482_1_4+place_482_1_3)+(place_482_1_5+place_482_1_2))+place_482_1_1)<=cSources)")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J60, 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 r290-tajo-171654447200467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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