Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r333-tall-171679078400428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SafeBus-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078400428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K Apr 12 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 12 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 605K Apr 12 15:01 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 8.4K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Apr 12 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 989K Apr 12 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 SafeBus-PT-10-LTLFireability-00
FORMULA_NAME SafeBus-PT-10-LTLFireability-01
FORMULA_NAME SafeBus-PT-10-LTLFireability-02
FORMULA_NAME SafeBus-PT-10-LTLFireability-03
FORMULA_NAME SafeBus-PT-10-LTLFireability-04
FORMULA_NAME SafeBus-PT-10-LTLFireability-05
FORMULA_NAME SafeBus-PT-10-LTLFireability-06
FORMULA_NAME SafeBus-PT-10-LTLFireability-07
FORMULA_NAME SafeBus-PT-10-LTLFireability-08
FORMULA_NAME SafeBus-PT-10-LTLFireability-09
FORMULA_NAME SafeBus-PT-10-LTLFireability-10
FORMULA_NAME SafeBus-PT-10-LTLFireability-11
FORMULA_NAME SafeBus-PT-10-LTLFireability-12
FORMULA_NAME SafeBus-PT-10-LTLFireability-13
FORMULA_NAME SafeBus-PT-10-LTLFireability-14
FORMULA_NAME SafeBus-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716857668116

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:54:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 00:54:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:54:29] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-28 00:54:29] [INFO ] Transformed 316 places.
[2024-05-28 00:54:29] [INFO ] Transformed 1631 transitions.
[2024-05-28 00:54:29] [INFO ] Found NUPN structural information;
[2024-05-28 00:54:29] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA SafeBus-PT-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 203 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 26 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-28 00:54:30] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-28 00:54:30] [INFO ] Computed 45 invariants in 46 ms
[2024-05-28 00:54:30] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-05-28 00:54:30] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-28 00:54:30] [INFO ] Invariant cache hit.
[2024-05-28 00:54:30] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 00:54:31] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-05-28 00:54:31] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-28 00:54:31] [INFO ] Invariant cache hit.
[2024-05-28 00:54:31] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-28 00:54:48] [INFO ] Deduced a trap composed of 41 places in 349 ms of which 28 ms to minimize.
[2024-05-28 00:54:59] [INFO ] Deduced a trap composed of 21 places in 430 ms of which 3 ms to minimize.
[2024-05-28 00:54:59] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 2 ms to minimize.
[2024-05-28 00:54:59] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 12 ms to minimize.
[2024-05-28 00:54:59] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 11 ms to minimize.
[2024-05-28 00:55:00] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 3 ms to minimize.
[2024-05-28 00:55:00] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 2 ms to minimize.
[2024-05-28 00:55:00] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 2 ms to minimize.
[2024-05-28 00:55:01] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 2 ms to minimize.
[2024-05-28 00:55:01] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 2 ms to minimize.
[2024-05-28 00:55:02] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
[2024-05-28 00:55:02] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 2 ms to minimize.
[2024-05-28 00:55:02] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 2 ms to minimize.
[2024-05-28 00:55:03] [INFO ] Deduced a trap composed of 49 places in 262 ms of which 2 ms to minimize.
[2024-05-28 00:55:03] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 2 ms to minimize.
[2024-05-28 00:55:06] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
SMT process timed out in 35304ms, After SMT, problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 35361ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 19 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36660 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 203 out of 306 places after structural reductions.
[2024-05-28 00:55:07] [INFO ] Flatten gal took : 438 ms
[2024-05-28 00:55:08] [INFO ] Flatten gal took : 222 ms
[2024-05-28 00:55:08] [INFO ] Input system was already deterministic with 1531 transitions.
Reduction of identical properties reduced properties to check from 30 to 25
RANDOM walk for 20524 steps (4 resets) in 1578 ms. (12 steps per ms) remains 0/25 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 30 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 00:55:10] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-28 00:55:10] [INFO ] Computed 45 invariants in 12 ms
[2024-05-28 00:55:11] [INFO ] Implicit Places using invariants in 1391 ms returned []
[2024-05-28 00:55:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:55:11] [INFO ] Invariant cache hit.
[2024-05-28 00:55:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 00:55:14] [INFO ] Implicit Places using invariants and state equation in 2472 ms returned []
Implicit Place search using SMT with State Equation took 3870 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-28 00:55:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:55:14] [INFO ] Invariant cache hit.
[2024-05-28 00:55:14] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 00:55:29] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 2 ms to minimize.
[2024-05-28 00:55:38] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2024-05-28 00:55:39] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-28 00:55:39] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 2 ms to minimize.
[2024-05-28 00:55:42] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 2 ms to minimize.
[2024-05-28 00:55:42] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-05-28 00:55:42] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 2 ms to minimize.
[2024-05-28 00:55:43] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-28 00:55:43] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 2 ms to minimize.
[2024-05-28 00:55:43] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 2 ms to minimize.
[2024-05-28 00:55:43] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 1 ms to minimize.
[2024-05-28 00:55:44] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 2 ms to minimize.
[2024-05-28 00:55:44] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 2 ms to minimize.
[2024-05-28 00:55:44] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-28 00:55:44] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-28 00:55:44] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-05-28 00:55:44] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-28 00:55:45] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 4 ms to minimize.
[2024-05-28 00:55:45] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 6 ms to minimize.
[2024-05-28 00:55:45] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30064 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 00:56:04] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-05-28 00:56:04] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-05-28 00:56:04] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2024-05-28 00:56:05] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 2 ms to minimize.
[2024-05-28 00:56:05] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 2 ms to minimize.
[2024-05-28 00:56:05] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-05-28 00:56:05] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 2 ms to minimize.
[2024-05-28 00:56:06] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 2 ms to minimize.
[2024-05-28 00:56:07] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-05-28 00:56:08] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2024-05-28 00:56:08] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-28 00:56:08] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-28 00:56:13] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 2 ms to minimize.
[2024-05-28 00:56:14] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-05-28 00:56:14] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-05-28 00:56:14] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-05-28 00:56:14] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 1 ms to minimize.
[2024-05-28 00:56:17] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 2 ms to minimize.
[2024-05-28 00:56:18] [INFO ] Deduced a trap composed of 84 places in 199 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30053 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64650ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64667ms
Finished structural reductions in LTL mode , in 1 iterations and 68574 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 872 reset in 1227 ms.
Product exploration explored 100000 steps with 831 reset in 973 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 311 steps (0 resets) in 18 ms. (16 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 373 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 00:56:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:56:22] [INFO ] Invariant cache hit.
[2024-05-28 00:56:23] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2024-05-28 00:56:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:56:23] [INFO ] Invariant cache hit.
[2024-05-28 00:56:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 00:56:25] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 3585 ms to find 0 implicit places.
[2024-05-28 00:56:26] [INFO ] Redundant transitions in 87 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-28 00:56:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:56:26] [INFO ] Invariant cache hit.
[2024-05-28 00:56:26] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 00:56:40] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 2 ms to minimize.
[2024-05-28 00:56:49] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 9 ms to minimize.
[2024-05-28 00:56:50] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-05-28 00:56:50] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2024-05-28 00:56:53] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 2 ms to minimize.
[2024-05-28 00:56:53] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 2 ms to minimize.
[2024-05-28 00:56:53] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 2 ms to minimize.
[2024-05-28 00:56:53] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-05-28 00:56:54] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 2 ms to minimize.
[2024-05-28 00:56:54] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2024-05-28 00:56:54] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 2 ms to minimize.
[2024-05-28 00:56:54] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 2 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 2 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 1 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-05-28 00:56:55] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
[2024-05-28 00:56:56] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2024-05-28 00:56:56] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30035 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 00:57:14] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 2 ms to minimize.
[2024-05-28 00:57:15] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-05-28 00:57:15] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-28 00:57:15] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-05-28 00:57:15] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2024-05-28 00:57:16] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 1 ms to minimize.
[2024-05-28 00:57:16] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 2 ms to minimize.
[2024-05-28 00:57:16] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 2 ms to minimize.
[2024-05-28 00:57:18] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2024-05-28 00:57:18] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-28 00:57:18] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-05-28 00:57:18] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-28 00:57:23] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2024-05-28 00:57:24] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 2 ms to minimize.
[2024-05-28 00:57:24] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-05-28 00:57:24] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-05-28 00:57:25] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 2 ms to minimize.
[2024-05-28 00:57:27] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 2 ms to minimize.
[2024-05-28 00:57:28] [INFO ] Deduced a trap composed of 84 places in 198 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30039 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64360ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68442 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 259 steps (0 resets) in 12 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 300 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 838 reset in 904 ms.
Product exploration explored 100000 steps with 885 reset in 915 ms.
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 199 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 00:57:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:57:33] [INFO ] Invariant cache hit.
[2024-05-28 00:57:34] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2024-05-28 00:57:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:57:34] [INFO ] Invariant cache hit.
[2024-05-28 00:57:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 00:57:36] [INFO ] Implicit Places using invariants and state equation in 2288 ms returned []
Implicit Place search using SMT with State Equation took 3422 ms to find 0 implicit places.
[2024-05-28 00:57:36] [INFO ] Redundant transitions in 38 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-28 00:57:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:57:36] [INFO ] Invariant cache hit.
[2024-05-28 00:57:36] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 00:57:50] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 2 ms to minimize.
[2024-05-28 00:58:00] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
[2024-05-28 00:58:00] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-05-28 00:58:00] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2024-05-28 00:58:03] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 2 ms to minimize.
[2024-05-28 00:58:03] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-28 00:58:04] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 2 ms to minimize.
[2024-05-28 00:58:04] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 2 ms to minimize.
[2024-05-28 00:58:04] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 2 ms to minimize.
[2024-05-28 00:58:04] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 1 ms to minimize.
[2024-05-28 00:58:05] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 2 ms to minimize.
[2024-05-28 00:58:05] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 2 ms to minimize.
[2024-05-28 00:58:05] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 2 ms to minimize.
[2024-05-28 00:58:05] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 1 ms to minimize.
[2024-05-28 00:58:06] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 1 ms to minimize.
[2024-05-28 00:58:06] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2024-05-28 00:58:06] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-28 00:58:06] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 1 ms to minimize.
[2024-05-28 00:58:06] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2024-05-28 00:58:07] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 00:58:26] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2024-05-28 00:58:26] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-05-28 00:58:26] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 1 ms to minimize.
[2024-05-28 00:58:26] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-05-28 00:58:27] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 2 ms to minimize.
[2024-05-28 00:58:27] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 2 ms to minimize.
[2024-05-28 00:58:27] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 2 ms to minimize.
[2024-05-28 00:58:27] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-05-28 00:58:29] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-28 00:58:29] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-05-28 00:58:29] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-28 00:58:29] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-05-28 00:58:35] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
[2024-05-28 00:58:35] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-05-28 00:58:35] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 1 ms to minimize.
[2024-05-28 00:58:36] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 2 ms to minimize.
[2024-05-28 00:58:36] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 1 ms to minimize.
[2024-05-28 00:58:39] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 2 ms to minimize.
[2024-05-28 00:58:39] [INFO ] Deduced a trap composed of 84 places in 213 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30033 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64232ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64247ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67914 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-00 finished in 211291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F((G(p0)||X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))))'
Support contains 32 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 00:58:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:58:41] [INFO ] Invariant cache hit.
[2024-05-28 00:58:42] [INFO ] Implicit Places using invariants in 1180 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1189 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1223 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 385 ms.
Product exploration explored 100000 steps with 33333 reset in 389 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLFireability-01 finished in 2335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 00:58:43] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:58:43] [INFO ] Invariant cache hit.
[2024-05-28 00:58:45] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2024-05-28 00:58:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:58:45] [INFO ] Invariant cache hit.
[2024-05-28 00:58:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 00:58:47] [INFO ] Implicit Places using invariants and state equation in 2553 ms returned []
Implicit Place search using SMT with State Equation took 3705 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-28 00:58:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:58:47] [INFO ] Invariant cache hit.
[2024-05-28 00:58:47] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 00:59:01] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 1 ms to minimize.
[2024-05-28 00:59:10] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
[2024-05-28 00:59:10] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 2 ms to minimize.
[2024-05-28 00:59:10] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-05-28 00:59:13] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 2 ms to minimize.
[2024-05-28 00:59:13] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2024-05-28 00:59:14] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 2 ms to minimize.
[2024-05-28 00:59:14] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 2 ms to minimize.
[2024-05-28 00:59:14] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 2 ms to minimize.
[2024-05-28 00:59:14] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2024-05-28 00:59:15] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 2 ms to minimize.
[2024-05-28 00:59:15] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 2 ms to minimize.
[2024-05-28 00:59:15] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 1 ms to minimize.
[2024-05-28 00:59:15] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2024-05-28 00:59:15] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 1 ms to minimize.
[2024-05-28 00:59:16] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-28 00:59:16] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-05-28 00:59:16] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2024-05-28 00:59:16] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2024-05-28 00:59:16] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 00:59:36] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 2 ms to minimize.
[2024-05-28 00:59:36] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-05-28 00:59:36] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 2 ms to minimize.
[2024-05-28 00:59:36] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
[2024-05-28 00:59:37] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 2 ms to minimize.
[2024-05-28 00:59:37] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 2 ms to minimize.
[2024-05-28 00:59:37] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 2 ms to minimize.
[2024-05-28 00:59:37] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 2 ms to minimize.
[2024-05-28 00:59:39] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 1 ms to minimize.
[2024-05-28 00:59:39] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2024-05-28 00:59:39] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-28 00:59:40] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 1 ms to minimize.
[2024-05-28 00:59:45] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 2 ms to minimize.
[2024-05-28 00:59:45] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 2 ms to minimize.
[2024-05-28 00:59:46] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
[2024-05-28 00:59:46] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-28 00:59:46] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 2 ms to minimize.
[2024-05-28 00:59:49] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 2 ms to minimize.
[2024-05-28 00:59:49] [INFO ] Deduced a trap composed of 84 places in 201 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64163ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64177ms
Finished structural reductions in LTL mode , in 1 iterations and 67891 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-02 finished in 67983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1))||F(G(p1)))))'
Support contains 40 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 12 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 00:59:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:59:51] [INFO ] Invariant cache hit.
[2024-05-28 00:59:52] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-28 00:59:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:59:52] [INFO ] Invariant cache hit.
[2024-05-28 00:59:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 00:59:55] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 3124 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-28 00:59:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 00:59:55] [INFO ] Invariant cache hit.
[2024-05-28 00:59:55] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:00:08] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 2 ms to minimize.
[2024-05-28 01:00:17] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 2 ms to minimize.
[2024-05-28 01:00:18] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 2 ms to minimize.
[2024-05-28 01:00:18] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 2 ms to minimize.
[2024-05-28 01:00:21] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 2 ms to minimize.
[2024-05-28 01:00:21] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2024-05-28 01:00:21] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 2 ms to minimize.
[2024-05-28 01:00:21] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:00:22] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 2 ms to minimize.
[2024-05-28 01:00:22] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 1 ms to minimize.
[2024-05-28 01:00:22] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:00:22] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 1 ms to minimize.
[2024-05-28 01:00:23] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:00:23] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:00:23] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-28 01:00:23] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2024-05-28 01:00:23] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 1 ms to minimize.
[2024-05-28 01:00:24] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 1 ms to minimize.
[2024-05-28 01:00:24] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-28 01:00:24] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.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 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.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 0.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 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.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 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30043 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:00:43] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 2 ms to minimize.
[2024-05-28 01:00:43] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 1 ms to minimize.
[2024-05-28 01:00:44] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 2 ms to minimize.
[2024-05-28 01:00:44] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-05-28 01:00:44] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 2 ms to minimize.
[2024-05-28 01:00:44] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-05-28 01:00:45] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 2 ms to minimize.
[2024-05-28 01:00:45] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-05-28 01:00:47] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 1 ms to minimize.
[2024-05-28 01:00:47] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2024-05-28 01:00:47] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 1 ms to minimize.
[2024-05-28 01:00:47] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:00:52] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2024-05-28 01:00:53] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 2 ms to minimize.
[2024-05-28 01:00:53] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2024-05-28 01:00:53] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-28 01:00:54] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
[2024-05-28 01:00:56] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 2 ms to minimize.
[2024-05-28 01:00:57] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30034 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64144ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64158ms
Finished structural reductions in LTL mode , in 1 iterations and 67298 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 547 ms.
Stack based approach found an accepted trace after 450 steps with 0 reset with depth 451 and stack size 451 in 4 ms.
FORMULA SafeBus-PT-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-03 finished in 68078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&((!p1 U (p2||G(!p1))) U G(p1)))))'
Support contains 134 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:00:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:00:59] [INFO ] Invariant cache hit.
[2024-05-28 01:01:00] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-28 01:01:00] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:01:00] [INFO ] Invariant cache hit.
[2024-05-28 01:01:00] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:01:02] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-28 01:01:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:01:02] [INFO ] Invariant cache hit.
[2024-05-28 01:01:02] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:01:15] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 1 ms to minimize.
[2024-05-28 01:01:25] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 2 ms to minimize.
[2024-05-28 01:01:25] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-05-28 01:01:25] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 2 ms to minimize.
[2024-05-28 01:01:28] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:01:28] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 2 ms to minimize.
[2024-05-28 01:01:29] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:01:29] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:01:29] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:01:29] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 2 ms to minimize.
[2024-05-28 01:01:30] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 2 ms to minimize.
[2024-05-28 01:01:30] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:01:30] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:01:30] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:01:31] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2024-05-28 01:01:31] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 1 ms to minimize.
[2024-05-28 01:01:31] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-05-28 01:01:31] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2024-05-28 01:01:31] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 4 ms to minimize.
[2024-05-28 01:01:31] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:01:50] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 2 ms to minimize.
[2024-05-28 01:01:50] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:01:51] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:01:51] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 2 ms to minimize.
[2024-05-28 01:01:51] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:01:51] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 2 ms to minimize.
[2024-05-28 01:01:52] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:01:52] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-05-28 01:01:54] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2024-05-28 01:01:54] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 1 ms to minimize.
[2024-05-28 01:01:54] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-05-28 01:01:54] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:01:59] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 1 ms to minimize.
[2024-05-28 01:02:00] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 2 ms to minimize.
[2024-05-28 01:02:00] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:02:00] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-05-28 01:02:01] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 2 ms to minimize.
[2024-05-28 01:02:04] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 3 ms to minimize.
[2024-05-28 01:02:04] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63887ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63902ms
Finished structural reductions in LTL mode , in 1 iterations and 66260 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND p1 (NOT p2)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-04 finished in 66546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 121 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:02:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:02:06] [INFO ] Invariant cache hit.
[2024-05-28 01:02:06] [INFO ] Implicit Places using invariants in 387 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 389 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 3 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-06 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(!p1)))||G(p0)))'
Support contains 141 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:02:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:02:07] [INFO ] Invariant cache hit.
[2024-05-28 01:02:07] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-28 01:02:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:02:07] [INFO ] Invariant cache hit.
[2024-05-28 01:02:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:02:08] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-28 01:02:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:02:08] [INFO ] Invariant cache hit.
[2024-05-28 01:02:08] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:02:22] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 2 ms to minimize.
[2024-05-28 01:02:32] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 2 ms to minimize.
[2024-05-28 01:02:32] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-05-28 01:02:32] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 2 ms to minimize.
[2024-05-28 01:02:35] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 5 ms to minimize.
[2024-05-28 01:02:35] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 5 ms to minimize.
[2024-05-28 01:02:36] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 2 ms to minimize.
[2024-05-28 01:02:36] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-05-28 01:02:36] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:02:36] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-05-28 01:02:37] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 2 ms to minimize.
[2024-05-28 01:02:37] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 2 ms to minimize.
[2024-05-28 01:02:37] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 2 ms to minimize.
[2024-05-28 01:02:37] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-05-28 01:02:37] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:02:38] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-05-28 01:02:38] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-05-28 01:02:38] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2024-05-28 01:02:38] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-05-28 01:02:38] [INFO ] Deduced a trap composed of 34 places in 247 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30072 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:02:57] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 2 ms to minimize.
[2024-05-28 01:02:57] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 2 ms to minimize.
[2024-05-28 01:02:58] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-05-28 01:02:58] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 2 ms to minimize.
[2024-05-28 01:02:58] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 2 ms to minimize.
[2024-05-28 01:02:59] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-05-28 01:02:59] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 2 ms to minimize.
[2024-05-28 01:02:59] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-05-28 01:03:01] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-28 01:03:01] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:03:01] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:03:01] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:03:07] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:03:07] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 2 ms to minimize.
[2024-05-28 01:03:08] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 1 ms to minimize.
[2024-05-28 01:03:08] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 1 ms to minimize.
[2024-05-28 01:03:08] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:03:11] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 1 ms to minimize.
[2024-05-28 01:03:11] [INFO ] Deduced a trap composed of 84 places in 199 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30035 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64413ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64428ms
Finished structural reductions in LTL mode , in 1 iterations and 65750 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 212 ms :[p1, (AND (NOT p0) p1), true, (OR (NOT p0) p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-07 finished in 65993 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||(F(p1)&&G(p2)))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:03:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:03:13] [INFO ] Invariant cache hit.
[2024-05-28 01:03:14] [INFO ] Implicit Places using invariants in 1173 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1176 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1202 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-08 finished in 1374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 91 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:03:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:03:14] [INFO ] Invariant cache hit.
[2024-05-28 01:03:15] [INFO ] Implicit Places using invariants in 1318 ms returned [266, 267, 268, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1335 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 297/306 places, 1531/1531 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 297 transition count 1522
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 288 transition count 1522
Applied a total of 18 rules in 155 ms. Remains 288 /297 variables (removed 9) and now considering 1522/1531 (removed 9) transitions.
[2024-05-28 01:03:15] [INFO ] Flow matrix only has 633 transitions (discarded 889 similar events)
// Phase 1: matrix 633 rows 288 cols
[2024-05-28 01:03:15] [INFO ] Computed 36 invariants in 7 ms
[2024-05-28 01:03:17] [INFO ] Implicit Places using invariants in 1614 ms returned []
[2024-05-28 01:03:17] [INFO ] Flow matrix only has 633 transitions (discarded 889 similar events)
[2024-05-28 01:03:17] [INFO ] Invariant cache hit.
[2024-05-28 01:03:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:03:19] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 3704 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 288/306 places, 1522/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5300 ms. Remains : 288/306 places, 1522/1531 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 560 reset in 475 ms.
Stack based approach found an accepted trace after 1820 steps with 12 reset with depth 371 and stack size 371 in 10 ms.
FORMULA SafeBus-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-09 finished in 5834 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 X(p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:03:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-28 01:03:20] [INFO ] Computed 45 invariants in 11 ms
[2024-05-28 01:03:21] [INFO ] Implicit Places using invariants in 1267 ms returned [267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1269 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 297 /297 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1284 ms. Remains : 297/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-10 finished in 1479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 92 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:03:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:03:21] [INFO ] Invariant cache hit.
[2024-05-28 01:03:23] [INFO ] Implicit Places using invariants in 1313 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1316 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 92 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-28 01:03:23] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-28 01:03:23] [INFO ] Computed 35 invariants in 4 ms
[2024-05-28 01:03:24] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2024-05-28 01:03:24] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:03:24] [INFO ] Invariant cache hit.
[2024-05-28 01:03:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:03:26] [INFO ] Implicit Places using invariants and state equation in 2286 ms returned []
Implicit Place search using SMT with State Equation took 3371 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4871 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 509 ms.
Stack based approach found an accepted trace after 673 steps with 0 reset with depth 674 and stack size 672 in 4 ms.
FORMULA SafeBus-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-11 finished in 5478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p0)&&((!p0||X(!p1)) U (G((!p0||X(!p1)))||((!p0||X(!p1))&&p2))))))'
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 11 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:03:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-28 01:03:27] [INFO ] Computed 45 invariants in 5 ms
[2024-05-28 01:03:28] [INFO ] Implicit Places using invariants in 1170 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1171 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1190 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 155 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 316 reset in 478 ms.
Product exploration explored 100000 steps with 315 reset in 490 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 131 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 587 ms. (68 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
[2024-05-28 01:03:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-28 01:03:30] [INFO ] Computed 35 invariants in 10 ms
[2024-05-28 01:03:30] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 177/180 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 177/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/252 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 72/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/292 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 40/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/294 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 641/935 variables, 294/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/935 variables, 110/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/935 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/938 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/938 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/938 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/938 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/938 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/938 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 177/180 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 177/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/252 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 72/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 292/938 variables, and 284 constraints, problems are : Problem set: 1 solved, 0 unsolved in 137 ms.
Refiners :[Domain max(s): 252/296 constraints, Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 588ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 14 factoid took 308 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:03:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:03:31] [INFO ] Invariant cache hit.
[2024-05-28 01:03:32] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2024-05-28 01:03:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:03:32] [INFO ] Invariant cache hit.
[2024-05-28 01:03:32] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:03:34] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 3293 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-28 01:03:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:03:34] [INFO ] Invariant cache hit.
[2024-05-28 01:03:34] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:03:48] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 2 ms to minimize.
[2024-05-28 01:03:48] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 2 ms to minimize.
[2024-05-28 01:03:48] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 2 ms to minimize.
[2024-05-28 01:03:49] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 1 ms to minimize.
[2024-05-28 01:03:49] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-05-28 01:03:58] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:03:58] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 2 ms to minimize.
[2024-05-28 01:03:58] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2024-05-28 01:03:58] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 2 ms to minimize.
[2024-05-28 01:03:59] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 2 ms to minimize.
[2024-05-28 01:04:00] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 4 ms to minimize.
[2024-05-28 01:04:00] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 2 ms to minimize.
[2024-05-28 01:04:00] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 2 ms to minimize.
[2024-05-28 01:04:00] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
[2024-05-28 01:04:01] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 2 ms to minimize.
[2024-05-28 01:04:03] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 2 ms to minimize.
[2024-05-28 01:04:04] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 2 ms to minimize.
[2024-05-28 01:04:04] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 3 ms to minimize.
[2024-05-28 01:04:04] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-05-28 01:04:04] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30042 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 20/20 constraints]
After SMT, in 64644ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64661ms
Finished structural reductions in LTL mode , in 1 iterations and 67969 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 7787 steps (0 resets) in 112 ms. (68 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 173 reset in 458 ms.
Product exploration explored 100000 steps with 161 reset in 485 ms.
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:04:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:04:41] [INFO ] Invariant cache hit.
[2024-05-28 01:04:42] [INFO ] Implicit Places using invariants in 964 ms returned []
[2024-05-28 01:04:42] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:04:42] [INFO ] Invariant cache hit.
[2024-05-28 01:04:42] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:04:44] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 3212 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-28 01:04:44] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:04:44] [INFO ] Invariant cache hit.
[2024-05-28 01:04:44] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:04:57] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 2 ms to minimize.
[2024-05-28 01:04:57] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:04:57] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 2 ms to minimize.
[2024-05-28 01:04:58] [INFO ] Deduced a trap composed of 74 places in 213 ms of which 2 ms to minimize.
[2024-05-28 01:04:58] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-28 01:05:07] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:05:07] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:05:07] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-05-28 01:05:07] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:05:09] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 1 ms to minimize.
[2024-05-28 01:05:09] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-28 01:05:09] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 2 ms to minimize.
[2024-05-28 01:05:09] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-05-28 01:05:09] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-05-28 01:05:10] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 2 ms to minimize.
[2024-05-28 01:05:13] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 2 ms to minimize.
[2024-05-28 01:05:13] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 2 ms to minimize.
[2024-05-28 01:05:13] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 2 ms to minimize.
[2024-05-28 01:05:13] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:05:13] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(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 0)
(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 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 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 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 0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 20/20 constraints]
After SMT, in 63892ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63906ms
Finished structural reductions in LTL mode , in 1 iterations and 67133 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-12 finished in 141728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X(X((p2&&G(p3))))||p1)))))'
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:05:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-28 01:05:48] [INFO ] Computed 45 invariants in 11 ms
[2024-05-28 01:05:50] [INFO ] Implicit Places using invariants in 1185 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1189 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1202 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLFireability-13 finished in 2032 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 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 91 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:05:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:05:51] [INFO ] Invariant cache hit.
[2024-05-28 01:05:52] [INFO ] Implicit Places using invariants in 1228 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1230 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 93 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-28 01:05:52] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-28 01:05:52] [INFO ] Computed 35 invariants in 8 ms
[2024-05-28 01:05:53] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2024-05-28 01:05:53] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:05:53] [INFO ] Invariant cache hit.
[2024-05-28 01:05:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:05:55] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 3530 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4944 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 151 reset in 483 ms.
Product exploration explored 100000 steps with 164 reset in 493 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 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 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-05-28 01:05:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:05:57] [INFO ] Invariant cache hit.
[2024-05-28 01:05:58] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2024-05-28 01:05:58] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 316 ms returned sat
[2024-05-28 01:05:59] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2024-05-28 01:05:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:05:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-28 01:05:59] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 134 ms returned sat
[2024-05-28 01:06:00] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2024-05-28 01:06:00] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:06:00] [INFO ] [Nat]Added 111 Read/Feed constraints in 105 ms returned sat
[2024-05-28 01:06:00] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 1 ms to minimize.
[2024-05-28 01:06:00] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 1 ms to minimize.
[2024-05-28 01:06:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2024-05-28 01:06:01] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 93 ms.
[2024-05-28 01:06:01] [INFO ] Added : 0 causal constraints over 0 iterations in 165 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 83 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-28 01:06:01] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:06:01] [INFO ] Invariant cache hit.
[2024-05-28 01:06:02] [INFO ] Implicit Places using invariants in 1162 ms returned []
[2024-05-28 01:06:02] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:06:02] [INFO ] Invariant cache hit.
[2024-05-28 01:06:02] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:06:04] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 3662 ms to find 0 implicit places.
[2024-05-28 01:06:04] [INFO ] Redundant transitions in 25 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-28 01:06:04] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:06:04] [INFO ] Invariant cache hit.
[2024-05-28 01:06:04] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-28 01:06:17] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:06:17] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-28 01:06:17] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-28 01:06:17] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-28 01:06:17] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-28 01:06:26] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2024-05-28 01:06:26] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:06:26] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:06:26] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 2 ms to minimize.
[2024-05-28 01:06:27] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-05-28 01:06:27] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:06:27] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
[2024-05-28 01:06:28] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-05-28 01:06:28] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 2 ms to minimize.
[2024-05-28 01:06:31] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 2 ms to minimize.
[2024-05-28 01:06:31] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-05-28 01:06:32] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 2 ms to minimize.
[2024-05-28 01:06:32] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 2 ms to minimize.
[2024-05-28 01:06:32] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 2 ms to minimize.
[2024-05-28 01:06:32] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.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 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.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 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 341 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30028 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-28 01:06:51] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-28 01:06:52] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2024-05-28 01:06:52] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2024-05-28 01:06:53] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2024-05-28 01:06:58] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-28 01:07:00] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 2 ms to minimize.
[2024-05-28 01:07:01] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-28 01:07:02] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-05-28 01:07:03] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2024-05-28 01:07:08] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:07:08] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 352 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30029 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 31/31 constraints]
After SMT, in 63855ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 63871ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67649 ms. Remains : 286/286 places, 1521/1521 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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 111 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 78 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2024-05-28 01:07:09] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:07:09] [INFO ] Invariant cache hit.
[2024-05-28 01:07:09] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned sat
[2024-05-28 01:07:10] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 297 ms returned sat
[2024-05-28 01:07:10] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2024-05-28 01:07:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:07:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-28 01:07:11] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 135 ms returned sat
[2024-05-28 01:07:12] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2024-05-28 01:07:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:07:12] [INFO ] [Nat]Added 111 Read/Feed constraints in 91 ms returned sat
[2024-05-28 01:07:12] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:07:12] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:07:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2024-05-28 01:07:12] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 73 ms.
[2024-05-28 01:07:12] [INFO ] Added : 0 causal constraints over 0 iterations in 144 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 171 reset in 467 ms.
Product exploration explored 100000 steps with 166 reset in 479 ms.
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 79 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-28 01:07:13] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:07:13] [INFO ] Invariant cache hit.
[2024-05-28 01:07:15] [INFO ] Implicit Places using invariants in 1196 ms returned []
[2024-05-28 01:07:15] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:07:15] [INFO ] Invariant cache hit.
[2024-05-28 01:07:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:07:17] [INFO ] Implicit Places using invariants and state equation in 2460 ms returned []
Implicit Place search using SMT with State Equation took 3671 ms to find 0 implicit places.
[2024-05-28 01:07:17] [INFO ] Redundant transitions in 19 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-05-28 01:07:17] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-28 01:07:17] [INFO ] Invariant cache hit.
[2024-05-28 01:07:17] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-28 01:07:29] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-28 01:07:29] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2024-05-28 01:07:29] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2024-05-28 01:07:29] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-05-28 01:07:30] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-28 01:07:38] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:07:38] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-05-28 01:07:39] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 1 ms to minimize.
[2024-05-28 01:07:39] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-05-28 01:07:39] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:07:39] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 2 ms to minimize.
[2024-05-28 01:07:40] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 2 ms to minimize.
[2024-05-28 01:07:41] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-05-28 01:07:41] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2024-05-28 01:07:43] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-05-28 01:07:44] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 2 ms to minimize.
[2024-05-28 01:07:44] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 2 ms to minimize.
[2024-05-28 01:07:44] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 2 ms to minimize.
[2024-05-28 01:07:44] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 2 ms to minimize.
[2024-05-28 01:07:44] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 341 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30033 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-05-28 01:08:04] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:08:04] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2024-05-28 01:08:05] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2024-05-28 01:08:06] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 1 ms to minimize.
[2024-05-28 01:08:10] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-05-28 01:08:13] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2024-05-28 01:08:14] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2024-05-28 01:08:14] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-28 01:08:15] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 1 ms to minimize.
[2024-05-28 01:08:21] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 1 ms to minimize.
[2024-05-28 01:08:21] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 352 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30028 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 31/31 constraints]
After SMT, in 63725ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 63738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67521 ms. Remains : 286/286 places, 1521/1521 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-14 finished in 150607 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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||((!p0 U (p1||G(!p0)))&&(!p2||X(X(!p2)))))))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 11 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:08:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-28 01:08:21] [INFO ] Computed 45 invariants in 9 ms
[2024-05-28 01:08:22] [INFO ] Implicit Places using invariants in 1394 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1397 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1415 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 12 reset in 498 ms.
Stack based approach found an accepted trace after 1533 steps with 0 reset with depth 1534 and stack size 1526 in 8 ms.
FORMULA SafeBus-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-15 finished in 2294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Found a Lengthening insensitive property : SafeBus-PT-10-LTLFireability-00
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 37 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:08:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:08:24] [INFO ] Invariant cache hit.
[2024-05-28 01:08:25] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2024-05-28 01:08:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:08:25] [INFO ] Invariant cache hit.
[2024-05-28 01:08:25] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:08:27] [INFO ] Implicit Places using invariants and state equation in 2340 ms returned []
Implicit Place search using SMT with State Equation took 3506 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-28 01:08:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:08:27] [INFO ] Invariant cache hit.
[2024-05-28 01:08:27] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:08:41] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:08:51] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 2 ms to minimize.
[2024-05-28 01:08:51] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-05-28 01:08:51] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 2 ms to minimize.
[2024-05-28 01:08:54] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 2 ms to minimize.
[2024-05-28 01:08:54] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-05-28 01:08:54] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 3 ms to minimize.
[2024-05-28 01:08:55] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-05-28 01:08:55] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 2 ms to minimize.
[2024-05-28 01:08:55] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 2 ms to minimize.
[2024-05-28 01:08:56] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 2 ms to minimize.
[2024-05-28 01:08:56] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 2 ms to minimize.
[2024-05-28 01:08:56] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:08:56] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:08:56] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2024-05-28 01:08:57] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-28 01:08:57] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-05-28 01:08:57] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2024-05-28 01:08:57] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-05-28 01:08:57] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:09:16] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:09:17] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 2 ms to minimize.
[2024-05-28 01:09:17] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:09:17] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 2 ms to minimize.
[2024-05-28 01:09:17] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 2 ms to minimize.
[2024-05-28 01:09:18] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 2 ms to minimize.
[2024-05-28 01:09:18] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 2 ms to minimize.
[2024-05-28 01:09:18] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 2 ms to minimize.
[2024-05-28 01:09:20] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 1 ms to minimize.
[2024-05-28 01:09:20] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-28 01:09:20] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-28 01:09:20] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:09:26] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:09:26] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:09:27] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 2 ms to minimize.
[2024-05-28 01:09:27] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 1 ms to minimize.
[2024-05-28 01:09:27] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2024-05-28 01:09:30] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:09:30] [INFO ] Deduced a trap composed of 84 places in 219 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30046 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64025ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64039ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 67588 ms. Remains : 306/306 places, 1531/1531 transitions.
Running random walk in product with property : SafeBus-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 804 reset in 1016 ms.
Product exploration explored 100000 steps with 840 reset in 1037 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 148 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 134 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:09:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:09:34] [INFO ] Invariant cache hit.
[2024-05-28 01:09:35] [INFO ] Implicit Places using invariants in 1143 ms returned []
[2024-05-28 01:09:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:09:35] [INFO ] Invariant cache hit.
[2024-05-28 01:09:35] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:09:38] [INFO ] Implicit Places using invariants and state equation in 2366 ms returned []
Implicit Place search using SMT with State Equation took 3512 ms to find 0 implicit places.
[2024-05-28 01:09:38] [INFO ] Redundant transitions in 27 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-28 01:09:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:09:38] [INFO ] Invariant cache hit.
[2024-05-28 01:09:38] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:09:52] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 2 ms to minimize.
[2024-05-28 01:10:01] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 2 ms to minimize.
[2024-05-28 01:10:02] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:10:02] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 2 ms to minimize.
[2024-05-28 01:10:06] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 2 ms to minimize.
[2024-05-28 01:10:06] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 2 ms to minimize.
[2024-05-28 01:10:06] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 2 ms to minimize.
[2024-05-28 01:10:06] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 2 ms to minimize.
[2024-05-28 01:10:07] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 2 ms to minimize.
[2024-05-28 01:10:07] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 2 ms to minimize.
[2024-05-28 01:10:07] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 2 ms to minimize.
[2024-05-28 01:10:07] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 2 ms to minimize.
[2024-05-28 01:10:08] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 1 ms to minimize.
[2024-05-28 01:10:08] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2024-05-28 01:10:08] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-28 01:10:08] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 1 ms to minimize.
[2024-05-28 01:10:08] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-05-28 01:10:08] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-28 01:10:09] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2024-05-28 01:10:09] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:10:27] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:10:27] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-05-28 01:10:28] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-05-28 01:10:28] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:10:28] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 2 ms to minimize.
[2024-05-28 01:10:28] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
[2024-05-28 01:10:29] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 2 ms to minimize.
[2024-05-28 01:10:29] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-05-28 01:10:31] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 1 ms to minimize.
[2024-05-28 01:10:31] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-05-28 01:10:31] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-28 01:10:31] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-05-28 01:10:37] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:10:37] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 3 ms to minimize.
[2024-05-28 01:10:37] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 1 ms to minimize.
[2024-05-28 01:10:38] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-05-28 01:10:38] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:10:41] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 2 ms to minimize.
[2024-05-28 01:10:41] [INFO ] Deduced a trap composed of 84 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30049 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63988ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64005ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67692 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 299 steps (0 resets) in 12 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 851 reset in 1011 ms.
Product exploration explored 100000 steps with 864 reset in 1031 ms.
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 123 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 01:10:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:10:45] [INFO ] Invariant cache hit.
[2024-05-28 01:10:46] [INFO ] Implicit Places using invariants in 1185 ms returned []
[2024-05-28 01:10:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:10:46] [INFO ] Invariant cache hit.
[2024-05-28 01:10:46] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 01:10:48] [INFO ] Implicit Places using invariants and state equation in 2398 ms returned []
Implicit Place search using SMT with State Equation took 3586 ms to find 0 implicit places.
[2024-05-28 01:10:48] [INFO ] Redundant transitions in 23 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-28 01:10:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-28 01:10:48] [INFO ] Invariant cache hit.
[2024-05-28 01:10:48] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:11:02] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 2 ms to minimize.
[2024-05-28 01:11:12] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 2 ms to minimize.
[2024-05-28 01:11:12] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:11:12] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:11:15] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:11:15] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 2 ms to minimize.
[2024-05-28 01:11:16] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 2 ms to minimize.
[2024-05-28 01:11:16] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 2 ms to minimize.
[2024-05-28 01:11:16] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 2 ms to minimize.
[2024-05-28 01:11:16] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 2 ms to minimize.
[2024-05-28 01:11:17] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 2 ms to minimize.
[2024-05-28 01:11:17] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 2 ms to minimize.
[2024-05-28 01:11:17] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:11:17] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:11:18] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-28 01:11:18] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-28 01:11:18] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-28 01:11:18] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2024-05-28 01:11:18] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 1 ms to minimize.
[2024-05-28 01:11:18] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30036 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-28 01:11:37] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 2 ms to minimize.
[2024-05-28 01:11:37] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:11:38] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-05-28 01:11:38] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 2 ms to minimize.
[2024-05-28 01:11:38] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 2 ms to minimize.
[2024-05-28 01:11:38] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 2 ms to minimize.
[2024-05-28 01:11:39] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 2 ms to minimize.
[2024-05-28 01:11:39] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 2 ms to minimize.
[2024-05-28 01:11:41] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 1 ms to minimize.
[2024-05-28 01:11:41] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-05-28 01:11:41] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2024-05-28 01:11:41] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 1 ms to minimize.
[2024-05-28 01:11:47] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:11:47] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 2 ms to minimize.
[2024-05-28 01:11:48] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:11:48] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-28 01:11:48] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-28 01:11:51] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 2 ms to minimize.
[2024-05-28 01:11:52] [INFO ] Deduced a trap composed of 84 places in 217 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30037 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63980ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63996ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67738 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-00 finished in 209008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p0)&&((!p0||X(!p1)) U (G((!p0||X(!p1)))||((!p0||X(!p1))&&p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 01:11:53] [INFO ] Flatten gal took : 117 ms
[2024-05-28 01:11:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-28 01:11:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 14 ms.
Total runtime 1043971 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 306
TRANSITIONS: 1531
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.048s, Sys 0.003s]


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


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

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

Process ID: 3225
MODEL NAME: /home/mcc/execution/416/model
306 places, 1531 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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