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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 02:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 02:33 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 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 46K 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 Peterson-COL-6-LTLFireability-00
FORMULA_NAME Peterson-COL-6-LTLFireability-01
FORMULA_NAME Peterson-COL-6-LTLFireability-02
FORMULA_NAME Peterson-COL-6-LTLFireability-03
FORMULA_NAME Peterson-COL-6-LTLFireability-04
FORMULA_NAME Peterson-COL-6-LTLFireability-05
FORMULA_NAME Peterson-COL-6-LTLFireability-06
FORMULA_NAME Peterson-COL-6-LTLFireability-07
FORMULA_NAME Peterson-COL-6-LTLFireability-08
FORMULA_NAME Peterson-COL-6-LTLFireability-09
FORMULA_NAME Peterson-COL-6-LTLFireability-10
FORMULA_NAME Peterson-COL-6-LTLFireability-11
FORMULA_NAME Peterson-COL-6-LTLFireability-12
FORMULA_NAME Peterson-COL-6-LTLFireability-13
FORMULA_NAME Peterson-COL-6-LTLFireability-14
FORMULA_NAME Peterson-COL-6-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717262833524

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:27:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:27:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:27:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:27:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:27:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1139 ms
[2024-06-01 17:27:17] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:27:17] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 9 ms.
[2024-06-01 17:27:17] [INFO ] Skeletonized 15 HLPN properties in 3 ms. Removed 1 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 660 steps (0 resets) in 38 ms. (16 steps per ms) remains 0/11 properties
[2024-06-01 17:27:17] [INFO ] Flatten gal took : 27 ms
[2024-06-01 17:27:17] [INFO ] Flatten gal took : 6 ms
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 17:27:18] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 182 ms.
[2024-06-01 17:27:18] [INFO ] Unfolded 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 42 places in 33 ms
Reduce places removed 42 places and 84 transitions.
FORMULA Peterson-COL-6-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:27:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 17:27:18] [INFO ] Computed 27 invariants in 63 ms
[2024-06-01 17:27:19] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-06-01 17:27:19] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:27:19] [INFO ] Invariant cache hit.
[2024-06-01 17:27:21] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:27:21] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 2576 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 17:27:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:27:21] [INFO ] Invariant cache hit.
[2024-06-01 17:27:21] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31725ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31828ms
Finished structural reductions in LTL mode , in 1 iterations and 34485 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1330 out of 1330 places after structural reductions.
[2024-06-01 17:27:53] [INFO ] Flatten gal took : 356 ms
[2024-06-01 17:27:54] [INFO ] Flatten gal took : 185 ms
[2024-06-01 17:27:54] [INFO ] Input system was already deterministic with 2030 transitions.
Reduction of identical properties reduced properties to check from 21 to 18
RANDOM walk for 40000 steps (8 resets) in 3281 ms. (12 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 785 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 2/2 properties
[2024-06-01 17:27:56] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:27:56] [INFO ] Invariant cache hit.
[2024-06-01 17:27:56] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1218/1288 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1288 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1288 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1820/3108 variables, 1288/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3108 variables, 330/1639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3108 variables, 0/1639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/3150 variables, 42/1681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3150 variables, 6/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/3150 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/3150 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3150/3150 variables, and 1687 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1218/1288 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1288 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1288 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1820/3108 variables, 1288/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3108 variables, 330/1639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3108 variables, 2/1641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3108 variables, 0/1641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/3150 variables, 42/1683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3150 variables, 6/1689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:28:03] [INFO ] Deduced a trap composed of 83 places in 1555 ms of which 184 ms to minimize.
[2024-06-01 17:28:04] [INFO ] Deduced a trap composed of 43 places in 890 ms of which 12 ms to minimize.
[2024-06-01 17:28:05] [INFO ] Deduced a trap composed of 30 places in 1091 ms of which 10 ms to minimize.
SMT process timed out in 9132ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 576 place count 1330 transition count 1454
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 1 with 576 rules applied. Total rules applied 1152 place count 754 transition count 1454
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 293 Pre rules applied. Total rules applied 1152 place count 754 transition count 1161
Deduced a syphon composed of 293 places in 2 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1738 place count 461 transition count 1161
Applied a total of 1738 rules in 237 ms. Remains 461 /1330 variables (removed 869) and now considering 1161/2030 (removed 869) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 461/1330 places, 1161/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 488 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 494 steps, run visited all 2 properties in 35 ms. (steps per millisecond=14 )
Probabilistic random walk after 494 steps, saw 435 distinct states, run finished after 43 ms. (steps per millisecond=11 ) properties seen :2
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' '!((p0 U (X(F((p2&&X(X(F(!p3))))))||p1)))'
Support contains 392 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 160 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:28:06] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:28:06] [INFO ] Invariant cache hit.
[2024-06-01 17:28:07] [INFO ] Implicit Places using invariants in 470 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 477 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 676 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 675 ms :[p3, (AND (NOT p1) p3), (OR (NOT p2) p3), p3, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (AND (NOT p1) p3)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-00
Product exploration explored 100000 steps with 397 reset in 1012 ms.
Stack based approach found an accepted trace after 957 steps with 3 reset with depth 113 and stack size 113 in 7 ms.
FORMULA Peterson-COL-6-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-00 finished in 2511 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(F(p1))))))'
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:28:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:28:08] [INFO ] Invariant cache hit.
[2024-06-01 17:28:09] [INFO ] Implicit Places using invariants in 616 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 618 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 74 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 732 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 1229 ms.
Product exploration explored 100000 steps with 25000 reset in 1025 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 931 steps (0 resets) in 8 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 64 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:28:13] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 17:28:13] [INFO ] Computed 20 invariants in 19 ms
[2024-06-01 17:28:13] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-06-01 17:28:13] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:28:13] [INFO ] Invariant cache hit.
[2024-06-01 17:28:15] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:28:16] [INFO ] Implicit Places using invariants and state equation in 2878 ms returned []
Implicit Place search using SMT with State Equation took 3496 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 17:28:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:28:16] [INFO ] Invariant cache hit.
[2024-06-01 17:28:16] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:28:51] [INFO ] Deduced a trap composed of 75 places in 1191 ms of which 19 ms to minimize.
[2024-06-01 17:28:53] [INFO ] Deduced a trap composed of 55 places in 1745 ms of which 18 ms to minimize.
[2024-06-01 17:28:54] [INFO ] Deduced a trap composed of 44 places in 1286 ms of which 11 ms to minimize.
[2024-06-01 17:28:56] [INFO ] Deduced a trap composed of 21 places in 1447 ms of which 17 ms to minimize.
[2024-06-01 17:28:57] [INFO ] Deduced a trap composed of 92 places in 1147 ms of which 11 ms to minimize.
[2024-06-01 17:28:58] [INFO ] Deduced a trap composed of 27 places in 1079 ms of which 15 ms to minimize.
[2024-06-01 17:29:00] [INFO ] Deduced a trap composed of 63 places in 1259 ms of which 13 ms to minimize.
[2024-06-01 17:29:01] [INFO ] Deduced a trap composed of 21 places in 1214 ms of which 14 ms to minimize.
[2024-06-01 17:29:02] [INFO ] Deduced a trap composed of 71 places in 1518 ms of which 17 ms to minimize.
[2024-06-01 17:29:04] [INFO ] Deduced a trap composed of 50 places in 1518 ms of which 18 ms to minimize.
[2024-06-01 17:29:05] [INFO ] Deduced a trap composed of 52 places in 1426 ms of which 18 ms to minimize.
[2024-06-01 17:29:07] [INFO ] Deduced a trap composed of 65 places in 1661 ms of which 17 ms to minimize.
[2024-06-01 17:29:09] [INFO ] Deduced a trap composed of 37 places in 1608 ms of which 18 ms to minimize.
[2024-06-01 17:29:10] [INFO ] Deduced a trap composed of 78 places in 1262 ms of which 11 ms to minimize.
[2024-06-01 17:29:11] [INFO ] Deduced a trap composed of 21 places in 1146 ms of which 16 ms to minimize.
[2024-06-01 17:29:12] [INFO ] Deduced a trap composed of 37 places in 1023 ms of which 9 ms to minimize.
[2024-06-01 17:29:14] [INFO ] Deduced a trap composed of 36 places in 1244 ms of which 16 ms to minimize.
[2024-06-01 17:29:15] [INFO ] Deduced a trap composed of 108 places in 1162 ms of which 14 ms to minimize.
[2024-06-01 17:29:16] [INFO ] Deduced a trap composed of 68 places in 1004 ms of which 11 ms to minimize.
[2024-06-01 17:29:17] [INFO ] Deduced a trap composed of 31 places in 877 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/3143 variables, and 40 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/2023 constraints, Known Traps: 20/20 constraints]
After SMT, in 61235ms problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 61277ms
Finished structural reductions in LTL mode , in 1 iterations and 64847 ms. Remains : 1323/1323 places, 2030/2030 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1014 steps (0 resets) in 8 ms. (112 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 723 ms.
Product exploration explored 100000 steps with 25000 reset in 550 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 1323 transition count 2030
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 259 Pre rules applied. Total rules applied 329 place count 1323 transition count 2030
Deduced a syphon composed of 588 places in 1 ms
Iterating global reduction 1 with 259 rules applied. Total rules applied 588 place count 1323 transition count 2030
Discarding 330 places :
Symmetric choice reduction at 1 with 330 rule applications. Total rules 918 place count 993 transition count 1700
Deduced a syphon composed of 258 places in 2 ms
Iterating global reduction 1 with 330 rules applied. Total rules applied 1248 place count 993 transition count 1700
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 580 places in 2 ms
Iterating global reduction 1 with 322 rules applied. Total rules applied 1570 place count 993 transition count 1700
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 1862 place count 701 transition count 1408
Deduced a syphon composed of 288 places in 1 ms
Iterating global reduction 1 with 292 rules applied. Total rules applied 2154 place count 701 transition count 1408
Deduced a syphon composed of 288 places in 1 ms
Applied a total of 2154 rules in 536 ms. Remains 701 /1323 variables (removed 622) and now considering 1408/2030 (removed 622) transitions.
[2024-06-01 17:29:21] [INFO ] Redundant transitions in 194 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-06-01 17:29:21] [INFO ] Flow matrix only has 1198 transitions (discarded 210 similar events)
// Phase 1: matrix 1198 rows 701 cols
[2024-06-01 17:29:21] [INFO ] Computed 20 invariants in 8 ms
[2024-06-01 17:29:21] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/1899 variables, and 20 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/701 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 17:29:54] [INFO ] Deduced a trap composed of 15 places in 583 ms of which 8 ms to minimize.
[2024-06-01 17:29:55] [INFO ] Deduced a trap composed of 37 places in 594 ms of which 7 ms to minimize.
[2024-06-01 17:29:56] [INFO ] Deduced a trap composed of 15 places in 718 ms of which 10 ms to minimize.
[2024-06-01 17:29:56] [INFO ] Deduced a trap composed of 15 places in 711 ms of which 9 ms to minimize.
[2024-06-01 17:29:57] [INFO ] Deduced a trap composed of 91 places in 709 ms of which 9 ms to minimize.
[2024-06-01 17:29:58] [INFO ] Deduced a trap composed of 84 places in 734 ms of which 11 ms to minimize.
[2024-06-01 17:29:59] [INFO ] Deduced a trap composed of 15 places in 723 ms of which 9 ms to minimize.
[2024-06-01 17:29:59] [INFO ] Deduced a trap composed of 96 places in 662 ms of which 9 ms to minimize.
[2024-06-01 17:30:00] [INFO ] Deduced a trap composed of 15 places in 710 ms of which 9 ms to minimize.
[2024-06-01 17:30:01] [INFO ] Deduced a trap composed of 15 places in 690 ms of which 9 ms to minimize.
[2024-06-01 17:30:04] [INFO ] Deduced a trap composed of 10 places in 692 ms of which 9 ms to minimize.
[2024-06-01 17:30:04] [INFO ] Deduced a trap composed of 10 places in 655 ms of which 9 ms to minimize.
[2024-06-01 17:30:05] [INFO ] Deduced a trap composed of 10 places in 636 ms of which 8 ms to minimize.
[2024-06-01 17:30:06] [INFO ] Deduced a trap composed of 11 places in 830 ms of which 10 ms to minimize.
[2024-06-01 17:30:08] [INFO ] Deduced a trap composed of 18 places in 575 ms of which 8 ms to minimize.
[2024-06-01 17:30:09] [INFO ] Deduced a trap composed of 18 places in 570 ms of which 8 ms to minimize.
[2024-06-01 17:30:09] [INFO ] Deduced a trap composed of 27 places in 598 ms of which 9 ms to minimize.
[2024-06-01 17:30:10] [INFO ] Deduced a trap composed of 18 places in 623 ms of which 11 ms to minimize.
[2024-06-01 17:30:11] [INFO ] Deduced a trap composed of 28 places in 621 ms of which 8 ms to minimize.
[2024-06-01 17:30:11] [INFO ] Deduced a trap composed of 40 places in 618 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 17:30:13] [INFO ] Deduced a trap composed of 90 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:30:13] [INFO ] Deduced a trap composed of 53 places in 759 ms of which 10 ms to minimize.
[2024-06-01 17:30:14] [INFO ] Deduced a trap composed of 31 places in 738 ms of which 10 ms to minimize.
[2024-06-01 17:30:15] [INFO ] Deduced a trap composed of 47 places in 774 ms of which 10 ms to minimize.
[2024-06-01 17:30:16] [INFO ] Deduced a trap composed of 23 places in 735 ms of which 10 ms to minimize.
[2024-06-01 17:30:16] [INFO ] Deduced a trap composed of 36 places in 713 ms of which 9 ms to minimize.
[2024-06-01 17:30:17] [INFO ] Deduced a trap composed of 44 places in 668 ms of which 9 ms to minimize.
[2024-06-01 17:30:18] [INFO ] Deduced a trap composed of 21 places in 868 ms of which 10 ms to minimize.
[2024-06-01 17:30:19] [INFO ] Deduced a trap composed of 30 places in 696 ms of which 10 ms to minimize.
[2024-06-01 17:30:19] [INFO ] Deduced a trap composed of 12 places in 716 ms of which 9 ms to minimize.
[2024-06-01 17:30:20] [INFO ] Deduced a trap composed of 39 places in 683 ms of which 9 ms to minimize.
[2024-06-01 17:30:21] [INFO ] Deduced a trap composed of 37 places in 673 ms of which 8 ms to minimize.
[2024-06-01 17:30:21] [INFO ] Deduced a trap composed of 36 places in 591 ms of which 8 ms to minimize.
[2024-06-01 17:30:22] [INFO ] Deduced a trap composed of 95 places in 674 ms of which 9 ms to minimize.
SMT process timed out in 61069ms, After SMT, problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 61089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 701/1323 places, 1408/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61845 ms. Remains : 701/1323 places, 1408/2030 transitions.
Support contains 7 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 52 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:30:22] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 17:30:22] [INFO ] Computed 20 invariants in 8 ms
[2024-06-01 17:30:23] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-06-01 17:30:23] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:30:23] [INFO ] Invariant cache hit.
[2024-06-01 17:30:24] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:30:29] [INFO ] Implicit Places using invariants and state equation in 5794 ms returned []
Implicit Place search using SMT with State Equation took 6698 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 17:30:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:30:29] [INFO ] Invariant cache hit.
[2024-06-01 17:30:29] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:31:04] [INFO ] Deduced a trap composed of 75 places in 1484 ms of which 17 ms to minimize.
[2024-06-01 17:31:06] [INFO ] Deduced a trap composed of 55 places in 1602 ms of which 19 ms to minimize.
[2024-06-01 17:31:08] [INFO ] Deduced a trap composed of 44 places in 1491 ms of which 15 ms to minimize.
[2024-06-01 17:31:09] [INFO ] Deduced a trap composed of 21 places in 1424 ms of which 17 ms to minimize.
[2024-06-01 17:31:10] [INFO ] Deduced a trap composed of 92 places in 1268 ms of which 11 ms to minimize.
[2024-06-01 17:31:12] [INFO ] Deduced a trap composed of 27 places in 1238 ms of which 16 ms to minimize.
[2024-06-01 17:31:13] [INFO ] Deduced a trap composed of 63 places in 1409 ms of which 16 ms to minimize.
[2024-06-01 17:31:14] [INFO ] Deduced a trap composed of 21 places in 1191 ms of which 9 ms to minimize.
[2024-06-01 17:31:15] [INFO ] Deduced a trap composed of 71 places in 1043 ms of which 14 ms to minimize.
[2024-06-01 17:31:17] [INFO ] Deduced a trap composed of 50 places in 1435 ms of which 16 ms to minimize.
[2024-06-01 17:31:18] [INFO ] Deduced a trap composed of 52 places in 1496 ms of which 17 ms to minimize.
[2024-06-01 17:31:20] [INFO ] Deduced a trap composed of 65 places in 1596 ms of which 17 ms to minimize.
[2024-06-01 17:31:22] [INFO ] Deduced a trap composed of 37 places in 1590 ms of which 18 ms to minimize.
[2024-06-01 17:31:23] [INFO ] Deduced a trap composed of 78 places in 1498 ms of which 17 ms to minimize.
[2024-06-01 17:31:25] [INFO ] Deduced a trap composed of 21 places in 1437 ms of which 16 ms to minimize.
[2024-06-01 17:31:26] [INFO ] Deduced a trap composed of 37 places in 1375 ms of which 15 ms to minimize.
[2024-06-01 17:31:27] [INFO ] Deduced a trap composed of 36 places in 1082 ms of which 11 ms to minimize.
[2024-06-01 17:31:28] [INFO ] Deduced a trap composed of 108 places in 1307 ms of which 17 ms to minimize.
[2024-06-01 17:31:30] [INFO ] Deduced a trap composed of 68 places in 1235 ms of which 10 ms to minimize.
[2024-06-01 17:31:31] [INFO ] Deduced a trap composed of 31 places in 1155 ms of which 16 ms to minimize.
SMT process timed out in 61985ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 62017ms
Finished structural reductions in LTL mode , in 1 iterations and 68773 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Treatment of property Peterson-COL-6-LTLFireability-01 finished in 203160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 28 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 72 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:31:32] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 17:31:32] [INFO ] Computed 27 invariants in 15 ms
[2024-06-01 17:31:32] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-06-01 17:31:32] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:31:32] [INFO ] Invariant cache hit.
[2024-06-01 17:31:34] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:31:38] [INFO ] Implicit Places using invariants and state equation in 5421 ms returned []
Implicit Place search using SMT with State Equation took 6177 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 17:31:38] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:31:38] [INFO ] Invariant cache hit.
[2024-06-01 17:31:38] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.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 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.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 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 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.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 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30729ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30756ms
Finished structural reductions in LTL mode , in 1 iterations and 37010 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 414 ms.
Stack based approach found an accepted trace after 643 steps with 0 reset with depth 644 and stack size 644 in 7 ms.
FORMULA Peterson-COL-6-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-02 finished in 37633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 140 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2024-06-01 17:32:09] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2024-06-01 17:32:09] [INFO ] Computed 27 invariants in 7 ms
[2024-06-01 17:32:10] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-06-01 17:32:10] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 17:32:10] [INFO ] Invariant cache hit.
[2024-06-01 17:32:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:32:13] [INFO ] Implicit Places using invariants and state equation in 2811 ms returned []
Implicit Place search using SMT with State Equation took 3465 ms to find 0 implicit places.
[2024-06-01 17:32:13] [INFO ] Redundant transitions in 81 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 17:32:13] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 17:32:13] [INFO ] Invariant cache hit.
[2024-06-01 17:32:13] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 17:32:29] [INFO ] Deduced a trap composed of 11 places in 407 ms of which 6 ms to minimize.
[2024-06-01 17:32:30] [INFO ] Deduced a trap composed of 29 places in 457 ms of which 6 ms to minimize.
[2024-06-01 17:32:30] [INFO ] Deduced a trap composed of 27 places in 452 ms of which 6 ms to minimize.
[2024-06-01 17:32:31] [INFO ] Deduced a trap composed of 23 places in 458 ms of which 6 ms to minimize.
[2024-06-01 17:32:31] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 5 ms to minimize.
[2024-06-01 17:32:32] [INFO ] Deduced a trap composed of 25 places in 445 ms of which 6 ms to minimize.
[2024-06-01 17:32:32] [INFO ] Deduced a trap composed of 15 places in 433 ms of which 5 ms to minimize.
[2024-06-01 17:32:32] [INFO ] Deduced a trap composed of 10 places in 449 ms of which 5 ms to minimize.
[2024-06-01 17:32:33] [INFO ] Deduced a trap composed of 96 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:32:33] [INFO ] Deduced a trap composed of 114 places in 468 ms of which 6 ms to minimize.
[2024-06-01 17:32:34] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 4 ms to minimize.
[2024-06-01 17:32:34] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 3 ms to minimize.
[2024-06-01 17:32:34] [INFO ] Deduced a trap composed of 78 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:32:35] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 3 ms to minimize.
[2024-06-01 17:32:35] [INFO ] Deduced a trap composed of 11 places in 366 ms of which 4 ms to minimize.
[2024-06-01 17:32:35] [INFO ] Deduced a trap composed of 46 places in 346 ms of which 5 ms to minimize.
[2024-06-01 17:32:36] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:32:36] [INFO ] Deduced a trap composed of 19 places in 418 ms of which 4 ms to minimize.
[2024-06-01 17:32:36] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 5 ms to minimize.
[2024-06-01 17:32:37] [INFO ] Deduced a trap composed of 30 places in 408 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-06-01 17:32:38] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 5 ms to minimize.
[2024-06-01 17:32:38] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 4 ms to minimize.
[2024-06-01 17:32:38] [INFO ] Deduced a trap composed of 42 places in 375 ms of which 5 ms to minimize.
[2024-06-01 17:32:39] [INFO ] Deduced a trap composed of 75 places in 430 ms of which 6 ms to minimize.
[2024-06-01 17:32:39] [INFO ] Deduced a trap composed of 97 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:32:40] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 5 ms to minimize.
[2024-06-01 17:32:40] [INFO ] Deduced a trap composed of 70 places in 395 ms of which 5 ms to minimize.
[2024-06-01 17:32:41] [INFO ] Deduced a trap composed of 38 places in 405 ms of which 5 ms to minimize.
[2024-06-01 17:32:41] [INFO ] Deduced a trap composed of 19 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:32:42] [INFO ] Deduced a trap composed of 27 places in 438 ms of which 5 ms to minimize.
[2024-06-01 17:32:42] [INFO ] Deduced a trap composed of 14 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:32:42] [INFO ] Deduced a trap composed of 51 places in 422 ms of which 5 ms to minimize.
[2024-06-01 17:32:43] [INFO ] Deduced a trap composed of 76 places in 371 ms of which 5 ms to minimize.
[2024-06-01 17:32:43] [INFO ] Deduced a trap composed of 60 places in 429 ms of which 5 ms to minimize.
[2024-06-01 17:32:44] [INFO ] Deduced a trap composed of 68 places in 414 ms of which 5 ms to minimize.
SMT process timed out in 30849ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30865ms
Starting structural reductions in SI_LTL mode, iteration 1 : 406/1330 places, 1106/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34563 ms. Remains : 406/1330 places, 1106/2030 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 593 ms.
Stack based approach found an accepted trace after 137 steps with 0 reset with depth 138 and stack size 123 in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-03 finished in 35242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 69 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:32:44] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 17:32:45] [INFO ] Computed 27 invariants in 14 ms
[2024-06-01 17:32:45] [INFO ] Implicit Places using invariants in 620 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 624 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 42 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 737 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, p0, p0, p0]
Running random walk in product with property : Peterson-COL-6-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-6-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-04 finished in 905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 511 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:32:45] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:32:45] [INFO ] Invariant cache hit.
[2024-06-01 17:32:46] [INFO ] Implicit Places using invariants in 768 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 771 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 852 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-06
Product exploration explored 100000 steps with 4129 reset in 4166 ms.
Product exploration explored 100000 steps with 4100 reset in 4198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 89 steps (0 resets) in 15 ms. (5 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 17:32:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 17:32:56] [INFO ] Computed 20 invariants in 10 ms
[2024-06-01 17:33:09] [INFO ] [Real]Absence check using 20 positive place invariants in 103 ms returned sat
[2024-06-01 17:33:11] [INFO ] [Real]Absence check using state equation in 2444 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 25 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:33:11] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:33:11] [INFO ] Invariant cache hit.
[2024-06-01 17:33:12] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-01 17:33:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:33:12] [INFO ] Invariant cache hit.
[2024-06-01 17:33:13] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:33:14] [INFO ] Implicit Places using invariants and state equation in 2755 ms returned []
Implicit Place search using SMT with State Equation took 3260 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 17:33:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:33:14] [INFO ] Invariant cache hit.
[2024-06-01 17:33:14] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:33:49] [INFO ] Deduced a trap composed of 75 places in 1278 ms of which 12 ms to minimize.
[2024-06-01 17:33:50] [INFO ] Deduced a trap composed of 55 places in 1182 ms of which 12 ms to minimize.
[2024-06-01 17:33:52] [INFO ] Deduced a trap composed of 44 places in 1076 ms of which 11 ms to minimize.
[2024-06-01 17:33:53] [INFO ] Deduced a trap composed of 21 places in 1211 ms of which 11 ms to minimize.
[2024-06-01 17:33:54] [INFO ] Deduced a trap composed of 92 places in 970 ms of which 10 ms to minimize.
[2024-06-01 17:33:55] [INFO ] Deduced a trap composed of 27 places in 968 ms of which 10 ms to minimize.
[2024-06-01 17:33:56] [INFO ] Deduced a trap composed of 63 places in 751 ms of which 9 ms to minimize.
[2024-06-01 17:33:56] [INFO ] Deduced a trap composed of 21 places in 869 ms of which 9 ms to minimize.
[2024-06-01 17:33:57] [INFO ] Deduced a trap composed of 71 places in 1028 ms of which 11 ms to minimize.
[2024-06-01 17:33:59] [INFO ] Deduced a trap composed of 50 places in 1008 ms of which 11 ms to minimize.
[2024-06-01 17:34:00] [INFO ] Deduced a trap composed of 52 places in 985 ms of which 11 ms to minimize.
[2024-06-01 17:34:01] [INFO ] Deduced a trap composed of 65 places in 1069 ms of which 11 ms to minimize.
[2024-06-01 17:34:02] [INFO ] Deduced a trap composed of 37 places in 969 ms of which 10 ms to minimize.
[2024-06-01 17:34:03] [INFO ] Deduced a trap composed of 78 places in 1072 ms of which 11 ms to minimize.
[2024-06-01 17:34:04] [INFO ] Deduced a trap composed of 21 places in 955 ms of which 10 ms to minimize.
[2024-06-01 17:34:05] [INFO ] Deduced a trap composed of 37 places in 921 ms of which 10 ms to minimize.
[2024-06-01 17:34:06] [INFO ] Deduced a trap composed of 36 places in 902 ms of which 10 ms to minimize.
[2024-06-01 17:34:07] [INFO ] Deduced a trap composed of 108 places in 926 ms of which 10 ms to minimize.
[2024-06-01 17:34:08] [INFO ] Deduced a trap composed of 68 places in 1109 ms of which 16 ms to minimize.
[2024-06-01 17:34:09] [INFO ] Deduced a trap composed of 31 places in 971 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:34:11] [INFO ] Deduced a trap composed of 29 places in 1100 ms of which 15 ms to minimize.
[2024-06-01 17:34:12] [INFO ] Deduced a trap composed of 155 places in 1023 ms of which 11 ms to minimize.
[2024-06-01 17:34:13] [INFO ] Deduced a trap composed of 37 places in 993 ms of which 10 ms to minimize.
[2024-06-01 17:34:14] [INFO ] Deduced a trap composed of 67 places in 1026 ms of which 15 ms to minimize.
[2024-06-01 17:34:15] [INFO ] Deduced a trap composed of 44 places in 1218 ms of which 15 ms to minimize.
[2024-06-01 17:34:16] [INFO ] Deduced a trap composed of 50 places in 1037 ms of which 11 ms to minimize.
SMT process timed out in 61720ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 61747ms
Finished structural reductions in LTL mode , in 1 iterations and 65038 ms. Remains : 1323/1323 places, 2030/2030 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 p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 95 steps (0 resets) in 14 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 17:34:17] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:34:17] [INFO ] Invariant cache hit.
[2024-06-01 17:34:26] [INFO ] [Real]Absence check using 20 positive place invariants in 110 ms returned sat
[2024-06-01 17:34:32] [INFO ] [Real]Absence check using state equation in 5757 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4122 reset in 5948 ms.
Product exploration explored 100000 steps with 4116 reset in 5972 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 1323 transition count 2030
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 265 Pre rules applied. Total rules applied 78 place count 1323 transition count 2030
Deduced a syphon composed of 343 places in 2 ms
Iterating global reduction 1 with 265 rules applied. Total rules applied 343 place count 1323 transition count 2030
Discarding 114 places :
Symmetric choice reduction at 1 with 114 rule applications. Total rules 457 place count 1209 transition count 1916
Deduced a syphon composed of 229 places in 2 ms
Iterating global reduction 1 with 114 rules applied. Total rules applied 571 place count 1209 transition count 1916
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 306 places in 1 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 648 place count 1209 transition count 1916
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 689 place count 1168 transition count 1875
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 730 place count 1168 transition count 1875
Deduced a syphon composed of 265 places in 1 ms
Applied a total of 730 rules in 236 ms. Remains 1168 /1323 variables (removed 155) and now considering 1875/2030 (removed 155) transitions.
[2024-06-01 17:34:45] [INFO ] Redundant transitions in 65 ms returned []
Running 1868 sub problems to find dead transitions.
[2024-06-01 17:34:45] [INFO ] Flow matrix only has 1665 transitions (discarded 210 similar events)
// Phase 1: matrix 1665 rows 1168 cols
[2024-06-01 17:34:45] [INFO ] Computed 20 invariants in 7 ms
[2024-06-01 17:34:45] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.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 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.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 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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1168 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1168/2833 variables, and 20 constraints, problems are : Problem set: 0 solved, 1868 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1168 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1868/1868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1168 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
[2024-06-01 17:35:18] [INFO ] Deduced a trap composed of 50 places in 889 ms of which 10 ms to minimize.
[2024-06-01 17:35:19] [INFO ] Deduced a trap composed of 137 places in 875 ms of which 10 ms to minimize.
[2024-06-01 17:35:20] [INFO ] Deduced a trap composed of 45 places in 963 ms of which 10 ms to minimize.
[2024-06-01 17:35:21] [INFO ] Deduced a trap composed of 117 places in 946 ms of which 10 ms to minimize.
[2024-06-01 17:35:22] [INFO ] Deduced a trap composed of 122 places in 703 ms of which 11 ms to minimize.
[2024-06-01 17:35:23] [INFO ] Deduced a trap composed of 55 places in 896 ms of which 14 ms to minimize.
[2024-06-01 17:35:24] [INFO ] Deduced a trap composed of 84 places in 1061 ms of which 14 ms to minimize.
[2024-06-01 17:35:25] [INFO ] Deduced a trap composed of 72 places in 1087 ms of which 14 ms to minimize.
[2024-06-01 17:35:26] [INFO ] Deduced a trap composed of 21 places in 879 ms of which 10 ms to minimize.
[2024-06-01 17:35:27] [INFO ] Deduced a trap composed of 41 places in 908 ms of which 13 ms to minimize.
[2024-06-01 17:35:28] [INFO ] Deduced a trap composed of 21 places in 1011 ms of which 13 ms to minimize.
[2024-06-01 17:35:29] [INFO ] Deduced a trap composed of 27 places in 988 ms of which 10 ms to minimize.
[2024-06-01 17:35:30] [INFO ] Deduced a trap composed of 37 places in 785 ms of which 9 ms to minimize.
[2024-06-01 17:35:30] [INFO ] Deduced a trap composed of 48 places in 703 ms of which 9 ms to minimize.
[2024-06-01 17:35:31] [INFO ] Deduced a trap composed of 37 places in 799 ms of which 9 ms to minimize.
[2024-06-01 17:35:32] [INFO ] Deduced a trap composed of 37 places in 838 ms of which 9 ms to minimize.
[2024-06-01 17:35:33] [INFO ] Deduced a trap composed of 24 places in 885 ms of which 10 ms to minimize.
[2024-06-01 17:35:34] [INFO ] Deduced a trap composed of 38 places in 845 ms of which 10 ms to minimize.
[2024-06-01 17:35:35] [INFO ] Deduced a trap composed of 31 places in 831 ms of which 9 ms to minimize.
[2024-06-01 17:35:36] [INFO ] Deduced a trap composed of 61 places in 839 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1168 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
[2024-06-01 17:35:37] [INFO ] Deduced a trap composed of 41 places in 841 ms of which 9 ms to minimize.
[2024-06-01 17:35:38] [INFO ] Deduced a trap composed of 17 places in 714 ms of which 8 ms to minimize.
[2024-06-01 17:35:39] [INFO ] Deduced a trap composed of 25 places in 849 ms of which 9 ms to minimize.
[2024-06-01 17:35:40] [INFO ] Deduced a trap composed of 61 places in 880 ms of which 9 ms to minimize.
[2024-06-01 17:35:41] [INFO ] Deduced a trap composed of 41 places in 813 ms of which 9 ms to minimize.
[2024-06-01 17:35:42] [INFO ] Deduced a trap composed of 18 places in 860 ms of which 9 ms to minimize.
[2024-06-01 17:35:42] [INFO ] Deduced a trap composed of 15 places in 787 ms of which 9 ms to minimize.
[2024-06-01 17:35:43] [INFO ] Deduced a trap composed of 135 places in 900 ms of which 10 ms to minimize.
[2024-06-01 17:35:44] [INFO ] Deduced a trap composed of 31 places in 912 ms of which 10 ms to minimize.
[2024-06-01 17:35:45] [INFO ] Deduced a trap composed of 30 places in 913 ms of which 10 ms to minimize.
[2024-06-01 17:35:46] [INFO ] Deduced a trap composed of 38 places in 869 ms of which 10 ms to minimize.
SMT process timed out in 61501ms, After SMT, problems are : Problem set: 0 solved, 1868 unsolved
Search for dead transitions found 0 dead transitions in 61520ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1168/1323 places, 1875/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61832 ms. Remains : 1168/1323 places, 1875/2030 transitions.
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:35:46] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 17:35:46] [INFO ] Computed 20 invariants in 7 ms
[2024-06-01 17:35:47] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-06-01 17:35:47] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:35:47] [INFO ] Invariant cache hit.
[2024-06-01 17:35:48] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:35:49] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 2583 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 17:35:49] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:35:49] [INFO ] Invariant cache hit.
[2024-06-01 17:35:49] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:36:23] [INFO ] Deduced a trap composed of 75 places in 1168 ms of which 12 ms to minimize.
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 55 places in 1116 ms of which 15 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 44 places in 1000 ms of which 11 ms to minimize.
[2024-06-01 17:36:27] [INFO ] Deduced a trap composed of 21 places in 1157 ms of which 16 ms to minimize.
[2024-06-01 17:36:28] [INFO ] Deduced a trap composed of 92 places in 983 ms of which 10 ms to minimize.
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 27 places in 947 ms of which 10 ms to minimize.
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 63 places in 869 ms of which 10 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 21 places in 855 ms of which 10 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 71 places in 1000 ms of which 11 ms to minimize.
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 50 places in 1061 ms of which 11 ms to minimize.
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 52 places in 1010 ms of which 10 ms to minimize.
[2024-06-01 17:36:35] [INFO ] Deduced a trap composed of 65 places in 1203 ms of which 16 ms to minimize.
[2024-06-01 17:36:36] [INFO ] Deduced a trap composed of 37 places in 1161 ms of which 16 ms to minimize.
[2024-06-01 17:36:37] [INFO ] Deduced a trap composed of 78 places in 1143 ms of which 11 ms to minimize.
[2024-06-01 17:36:38] [INFO ] Deduced a trap composed of 21 places in 1234 ms of which 11 ms to minimize.
[2024-06-01 17:36:39] [INFO ] Deduced a trap composed of 37 places in 1029 ms of which 10 ms to minimize.
[2024-06-01 17:36:40] [INFO ] Deduced a trap composed of 36 places in 1069 ms of which 10 ms to minimize.
[2024-06-01 17:36:42] [INFO ] Deduced a trap composed of 108 places in 1007 ms of which 11 ms to minimize.
[2024-06-01 17:36:43] [INFO ] Deduced a trap composed of 68 places in 1173 ms of which 13 ms to minimize.
[2024-06-01 17:36:44] [INFO ] Deduced a trap composed of 31 places in 900 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:36:46] [INFO ] Deduced a trap composed of 29 places in 1068 ms of which 15 ms to minimize.
[2024-06-01 17:36:47] [INFO ] Deduced a trap composed of 155 places in 1090 ms of which 10 ms to minimize.
[2024-06-01 17:36:48] [INFO ] Deduced a trap composed of 37 places in 925 ms of which 10 ms to minimize.
[2024-06-01 17:36:49] [INFO ] Deduced a trap composed of 67 places in 984 ms of which 10 ms to minimize.
[2024-06-01 17:36:50] [INFO ] Deduced a trap composed of 44 places in 957 ms of which 10 ms to minimize.
SMT process timed out in 61087ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 61111ms
Finished structural reductions in LTL mode , in 1 iterations and 63725 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Treatment of property Peterson-COL-6-LTLFireability-06 finished in 244727 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 (X(p2)||p1)))'
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:36:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 17:36:50] [INFO ] Computed 27 invariants in 10 ms
[2024-06-01 17:36:51] [INFO ] Implicit Places using invariants in 674 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 683 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 23 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 733 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, p0]
Running random walk in product with property : Peterson-COL-6-LTLFireability-07
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-07 finished in 890 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 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 259 Pre rules applied. Total rules applied 1176 place count 742 transition count 1183
Deduced a syphon composed of 259 places in 1 ms
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 2 with 518 rules applied. Total rules applied 1694 place count 483 transition count 1183
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1778 place count 441 transition count 1141
Applied a total of 1778 rules in 67 ms. Remains 441 /1330 variables (removed 889) and now considering 1141/2030 (removed 889) transitions.
[2024-06-01 17:36:51] [INFO ] Flow matrix only has 931 transitions (discarded 210 similar events)
// Phase 1: matrix 931 rows 441 cols
[2024-06-01 17:36:51] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 17:36:51] [INFO ] Implicit Places using invariants in 468 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 470 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 434/1330 places, 1141/2030 transitions.
Applied a total of 0 rules in 17 ms. Remains 434 /434 variables (removed 0) and now considering 1141/1141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 434/1330 places, 1141/2030 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-08
Product exploration explored 100000 steps with 4977 reset in 1048 ms.
Stack based approach found an accepted trace after 45 steps with 2 reset with depth 30 and stack size 30 in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-08 finished in 1695 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 91 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 576 place count 1330 transition count 1454
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 1 with 576 rules applied. Total rules applied 1152 place count 754 transition count 1454
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 265 Pre rules applied. Total rules applied 1152 place count 754 transition count 1189
Deduced a syphon composed of 265 places in 1 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 2 with 530 rules applied. Total rules applied 1682 place count 489 transition count 1189
Applied a total of 1682 rules in 53 ms. Remains 489 /1330 variables (removed 841) and now considering 1189/2030 (removed 841) transitions.
[2024-06-01 17:36:53] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
// Phase 1: matrix 979 rows 489 cols
[2024-06-01 17:36:53] [INFO ] Computed 27 invariants in 3 ms
[2024-06-01 17:36:53] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-06-01 17:36:53] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2024-06-01 17:36:53] [INFO ] Invariant cache hit.
[2024-06-01 17:36:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:36:55] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
[2024-06-01 17:36:55] [INFO ] Redundant transitions in 17 ms returned []
Running 1182 sub problems to find dead transitions.
[2024-06-01 17:36:55] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2024-06-01 17:36:55] [INFO ] Invariant cache hit.
[2024-06-01 17:36:55] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 17:37:08] [INFO ] Deduced a trap composed of 85 places in 333 ms of which 5 ms to minimize.
[2024-06-01 17:37:09] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:37:09] [INFO ] Deduced a trap composed of 63 places in 291 ms of which 5 ms to minimize.
[2024-06-01 17:37:09] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 5 ms to minimize.
[2024-06-01 17:37:10] [INFO ] Deduced a trap composed of 30 places in 303 ms of which 5 ms to minimize.
[2024-06-01 17:37:10] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:37:10] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:37:11] [INFO ] Deduced a trap composed of 110 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:37:11] [INFO ] Deduced a trap composed of 86 places in 336 ms of which 4 ms to minimize.
[2024-06-01 17:37:11] [INFO ] Deduced a trap composed of 103 places in 322 ms of which 4 ms to minimize.
[2024-06-01 17:37:12] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:37:12] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 5 ms to minimize.
[2024-06-01 17:37:12] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 3 ms to minimize.
[2024-06-01 17:37:13] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 4 ms to minimize.
[2024-06-01 17:37:13] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 5 ms to minimize.
[2024-06-01 17:37:13] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 5 ms to minimize.
[2024-06-01 17:37:13] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:37:14] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 5 ms to minimize.
[2024-06-01 17:37:14] [INFO ] Deduced a trap composed of 73 places in 348 ms of which 5 ms to minimize.
[2024-06-01 17:37:15] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 17:37:15] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 4 ms to minimize.
[2024-06-01 17:37:16] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 4 ms to minimize.
[2024-06-01 17:37:16] [INFO ] Deduced a trap composed of 67 places in 302 ms of which 5 ms to minimize.
[2024-06-01 17:37:16] [INFO ] Deduced a trap composed of 40 places in 311 ms of which 4 ms to minimize.
[2024-06-01 17:37:17] [INFO ] Deduced a trap composed of 50 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:37:17] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:37:17] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:37:18] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 4 ms to minimize.
[2024-06-01 17:37:18] [INFO ] Deduced a trap composed of 86 places in 302 ms of which 5 ms to minimize.
[2024-06-01 17:37:18] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 5 ms to minimize.
[2024-06-01 17:37:19] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:37:19] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 5 ms to minimize.
[2024-06-01 17:37:19] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 5 ms to minimize.
[2024-06-01 17:37:19] [INFO ] Deduced a trap composed of 84 places in 309 ms of which 5 ms to minimize.
[2024-06-01 17:37:20] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 4 ms to minimize.
[2024-06-01 17:37:20] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 4 ms to minimize.
[2024-06-01 17:37:20] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 5 ms to minimize.
[2024-06-01 17:37:21] [INFO ] Deduced a trap composed of 52 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:37:21] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:37:21] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 4 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/482 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/1468 variables, and 60 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1182/1182 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 17:37:28] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 4 ms to minimize.
[2024-06-01 17:37:28] [INFO ] Deduced a trap composed of 56 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:37:29] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 4 ms to minimize.
[2024-06-01 17:37:29] [INFO ] Deduced a trap composed of 73 places in 283 ms of which 5 ms to minimize.
[2024-06-01 17:37:29] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2024-06-01 17:37:30] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 4 ms to minimize.
[2024-06-01 17:37:30] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:37:30] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 4 ms to minimize.
[2024-06-01 17:37:30] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:37:31] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:37:31] [INFO ] Deduced a trap composed of 131 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:37:31] [INFO ] Deduced a trap composed of 20 places in 286 ms of which 4 ms to minimize.
[2024-06-01 17:37:32] [INFO ] Deduced a trap composed of 56 places in 273 ms of which 4 ms to minimize.
[2024-06-01 17:37:32] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:37:32] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 4 ms to minimize.
[2024-06-01 17:37:32] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:37:33] [INFO ] Deduced a trap composed of 52 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:37:33] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:37:33] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 4 ms to minimize.
[2024-06-01 17:37:34] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 17:37:35] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 5 ms to minimize.
[2024-06-01 17:37:35] [INFO ] Deduced a trap composed of 48 places in 274 ms of which 5 ms to minimize.
[2024-06-01 17:37:35] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:37:35] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 4 ms to minimize.
[2024-06-01 17:37:36] [INFO ] Deduced a trap composed of 103 places in 273 ms of which 4 ms to minimize.
[2024-06-01 17:37:36] [INFO ] Deduced a trap composed of 67 places in 323 ms of which 5 ms to minimize.
[2024-06-01 17:37:36] [INFO ] Deduced a trap composed of 103 places in 235 ms of which 4 ms to minimize.
[2024-06-01 17:37:37] [INFO ] Deduced a trap composed of 89 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:37:37] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 4 ms to minimize.
[2024-06-01 17:37:37] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:37:37] [INFO ] Deduced a trap composed of 71 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:37:38] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:37:38] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:37:38] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:37:39] [INFO ] Deduced a trap composed of 65 places in 316 ms of which 5 ms to minimize.
[2024-06-01 17:37:39] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 4 ms to minimize.
[2024-06-01 17:37:39] [INFO ] Deduced a trap composed of 80 places in 282 ms of which 4 ms to minimize.
[2024-06-01 17:37:39] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 5 ms to minimize.
[2024-06-01 17:37:40] [INFO ] Deduced a trap composed of 92 places in 287 ms of which 11 ms to minimize.
[2024-06-01 17:37:40] [INFO ] Deduced a trap composed of 35 places in 266 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 17:37:41] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 4 ms to minimize.
[2024-06-01 17:37:41] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 5 ms to minimize.
[2024-06-01 17:37:41] [INFO ] Deduced a trap composed of 70 places in 278 ms of which 4 ms to minimize.
[2024-06-01 17:37:42] [INFO ] Deduced a trap composed of 101 places in 265 ms of which 4 ms to minimize.
[2024-06-01 17:37:42] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:37:42] [INFO ] Deduced a trap composed of 54 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:37:43] [INFO ] Deduced a trap composed of 86 places in 300 ms of which 4 ms to minimize.
[2024-06-01 17:37:43] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:37:43] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:37:43] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:37:44] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 4 ms to minimize.
[2024-06-01 17:37:44] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 4 ms to minimize.
[2024-06-01 17:37:44] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 4 ms to minimize.
[2024-06-01 17:37:45] [INFO ] Deduced a trap composed of 81 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:37:45] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 4 ms to minimize.
[2024-06-01 17:37:45] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 4 ms to minimize.
[2024-06-01 17:37:46] [INFO ] Deduced a trap composed of 45 places in 326 ms of which 4 ms to minimize.
[2024-06-01 17:37:46] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:37:46] [INFO ] Deduced a trap composed of 37 places in 321 ms of which 4 ms to minimize.
[2024-06-01 17:37:47] [INFO ] Deduced a trap composed of 22 places in 335 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 17:37:47] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 4 ms to minimize.
[2024-06-01 17:37:48] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-01 17:37:48] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:37:48] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:37:48] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 4 ms to minimize.
[2024-06-01 17:37:48] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 4 ms to minimize.
[2024-06-01 17:37:49] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:37:49] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:37:49] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:37:49] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:37:49] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 3 ms to minimize.
[2024-06-01 17:37:50] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:37:50] [INFO ] Deduced a trap composed of 11 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:37:50] [INFO ] Deduced a trap composed of 37 places in 309 ms of which 4 ms to minimize.
[2024-06-01 17:37:51] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:37:51] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 4 ms to minimize.
[2024-06-01 17:37:51] [INFO ] Deduced a trap composed of 98 places in 217 ms of which 4 ms to minimize.
[2024-06-01 17:37:52] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:37:52] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 4 ms to minimize.
[2024-06-01 17:37:52] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 17:37:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:37:54] [INFO ] Deduced a trap composed of 30 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:37:55] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 4 ms to minimize.
[2024-06-01 17:37:55] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:37:55] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 4 ms to minimize.
[2024-06-01 17:37:55] [INFO ] Deduced a trap composed of 10 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:37:56] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1468 variables, and 147 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1182 constraints, Known Traps: 127/127 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 1182 unsolved
Search for dead transitions found 0 dead transitions in 60494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 489/1330 places, 1189/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63304 ms. Remains : 489/1330 places, 1189/2030 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-09
Product exploration explored 100000 steps with 8047 reset in 683 ms.
Stack based approach found an accepted trace after 155 steps with 12 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-09 finished in 64079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(X(G((p1||X(F(!p2))))))))))'
Support contains 385 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:37:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 17:37:57] [INFO ] Computed 27 invariants in 7 ms
[2024-06-01 17:37:57] [INFO ] Implicit Places using invariants in 678 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 684 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 23 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 733 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-10
Product exploration explored 100000 steps with 11832 reset in 1317 ms.
Product exploration explored 100000 steps with 11705 reset in 1336 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 (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (8 resets) in 1124 ms. (35 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3195 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2395 ms. (16 steps per ms) remains 2/2 properties
[2024-06-01 17:38:03] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 17:38:03] [INFO ] Computed 20 invariants in 5 ms
[2024-06-01 17:38:03] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 931/1316 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:38:05] [INFO ] Deduced a trap composed of 38 places in 945 ms of which 10 ms to minimize.
[2024-06-01 17:38:06] [INFO ] Deduced a trap composed of 46 places in 1049 ms of which 11 ms to minimize.
[2024-06-01 17:38:07] [INFO ] Deduced a trap composed of 117 places in 1116 ms of which 10 ms to minimize.
[2024-06-01 17:38:08] [INFO ] Deduced a trap composed of 62 places in 1059 ms of which 11 ms to minimize.
[2024-06-01 17:38:09] [INFO ] Deduced a trap composed of 117 places in 1043 ms of which 15 ms to minimize.
SMT process timed out in 6762ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 385 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1323 transition count 2025
Reduce places removed 5 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 299 rules applied. Total rules applied 304 place count 1318 transition count 1731
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 598 place count 1024 transition count 1731
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 658 place count 994 transition count 1701
Applied a total of 658 rules in 224 ms. Remains 994 /1323 variables (removed 329) and now considering 1701/2030 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 994/1323 places, 1701/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 2920 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1372 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1861 ms. (21 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1064 steps, run visited all 2 properties in 80 ms. (steps per millisecond=13 )
Probabilistic random walk after 1064 steps, saw 933 distinct states, run finished after 80 ms. (steps per millisecond=13 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 323 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
[2024-06-01 17:38:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:38:13] [INFO ] Invariant cache hit.
[2024-06-01 17:38:15] [INFO ] [Real]Absence check using 20 positive place invariants in 45 ms returned sat
[2024-06-01 17:38:21] [INFO ] [Real]Absence check using state equation in 5231 ms returned sat
[2024-06-01 17:38:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:38:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 41 ms returned sat
[2024-06-01 17:38:28] [INFO ] [Nat]Absence check using state equation in 4215 ms returned sat
[2024-06-01 17:38:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:38:28] [INFO ] [Nat]Added 330 Read/Feed constraints in 442 ms returned sat
[2024-06-01 17:38:29] [INFO ] Deduced a trap composed of 16 places in 745 ms of which 8 ms to minimize.
[2024-06-01 17:38:30] [INFO ] Deduced a trap composed of 215 places in 748 ms of which 9 ms to minimize.
[2024-06-01 17:38:31] [INFO ] Deduced a trap composed of 157 places in 814 ms of which 9 ms to minimize.
[2024-06-01 17:38:32] [INFO ] Deduced a trap composed of 12 places in 1000 ms of which 20 ms to minimize.
[2024-06-01 17:38:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4191 ms
[2024-06-01 17:38:33] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 157 ms.
[2024-06-01 17:38:36] [INFO ] Added : 60 causal constraints over 12 iterations in 3313 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 385 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 28 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:38:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:38:36] [INFO ] Invariant cache hit.
[2024-06-01 17:38:36] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-06-01 17:38:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:38:36] [INFO ] Invariant cache hit.
[2024-06-01 17:38:37] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:38:40] [INFO ] Implicit Places using invariants and state equation in 3804 ms returned []
Implicit Place search using SMT with State Equation took 4416 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 17:38:40] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:38:40] [INFO ] Invariant cache hit.
[2024-06-01 17:38:40] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:39:14] [INFO ] Deduced a trap composed of 75 places in 1146 ms of which 12 ms to minimize.
[2024-06-01 17:39:16] [INFO ] Deduced a trap composed of 55 places in 1039 ms of which 11 ms to minimize.
[2024-06-01 17:39:17] [INFO ] Deduced a trap composed of 44 places in 1067 ms of which 11 ms to minimize.
[2024-06-01 17:39:18] [INFO ] Deduced a trap composed of 21 places in 920 ms of which 11 ms to minimize.
[2024-06-01 17:39:19] [INFO ] Deduced a trap composed of 92 places in 999 ms of which 11 ms to minimize.
[2024-06-01 17:39:20] [INFO ] Deduced a trap composed of 27 places in 997 ms of which 11 ms to minimize.
[2024-06-01 17:39:21] [INFO ] Deduced a trap composed of 63 places in 919 ms of which 10 ms to minimize.
[2024-06-01 17:39:21] [INFO ] Deduced a trap composed of 21 places in 886 ms of which 9 ms to minimize.
[2024-06-01 17:39:23] [INFO ] Deduced a trap composed of 71 places in 1021 ms of which 11 ms to minimize.
[2024-06-01 17:39:24] [INFO ] Deduced a trap composed of 50 places in 1016 ms of which 11 ms to minimize.
[2024-06-01 17:39:25] [INFO ] Deduced a trap composed of 52 places in 1157 ms of which 11 ms to minimize.
[2024-06-01 17:39:26] [INFO ] Deduced a trap composed of 65 places in 1077 ms of which 11 ms to minimize.
[2024-06-01 17:39:27] [INFO ] Deduced a trap composed of 37 places in 1071 ms of which 11 ms to minimize.
[2024-06-01 17:39:28] [INFO ] Deduced a trap composed of 78 places in 1108 ms of which 11 ms to minimize.
[2024-06-01 17:39:29] [INFO ] Deduced a trap composed of 21 places in 1071 ms of which 10 ms to minimize.
[2024-06-01 17:39:30] [INFO ] Deduced a trap composed of 37 places in 987 ms of which 10 ms to minimize.
[2024-06-01 17:39:31] [INFO ] Deduced a trap composed of 36 places in 977 ms of which 10 ms to minimize.
[2024-06-01 17:39:32] [INFO ] Deduced a trap composed of 108 places in 972 ms of which 11 ms to minimize.
[2024-06-01 17:39:33] [INFO ] Deduced a trap composed of 68 places in 996 ms of which 11 ms to minimize.
[2024-06-01 17:39:34] [INFO ] Deduced a trap composed of 31 places in 928 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:39:36] [INFO ] Deduced a trap composed of 29 places in 959 ms of which 10 ms to minimize.
[2024-06-01 17:39:37] [INFO ] Deduced a trap composed of 155 places in 977 ms of which 10 ms to minimize.
[2024-06-01 17:39:38] [INFO ] Deduced a trap composed of 37 places in 926 ms of which 10 ms to minimize.
[2024-06-01 17:39:39] [INFO ] Deduced a trap composed of 67 places in 1028 ms of which 16 ms to minimize.
[2024-06-01 17:39:40] [INFO ] Deduced a trap composed of 44 places in 1049 ms of which 10 ms to minimize.
[2024-06-01 17:39:41] [INFO ] Deduced a trap composed of 50 places in 992 ms of which 10 ms to minimize.
SMT process timed out in 61140ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 61165ms
Finished structural reductions in LTL mode , in 1 iterations and 65616 ms. Remains : 1323/1323 places, 2030/2030 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) p1 (NOT p2)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (8 resets) in 2790 ms. (14 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1770 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2300 ms. (17 steps per ms) remains 2/2 properties
[2024-06-01 17:39:44] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:39:44] [INFO ] Invariant cache hit.
[2024-06-01 17:39:44] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 931/1316 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:39:46] [INFO ] Deduced a trap composed of 76 places in 1046 ms of which 15 ms to minimize.
[2024-06-01 17:39:47] [INFO ] Deduced a trap composed of 98 places in 1148 ms of which 14 ms to minimize.
[2024-06-01 17:39:48] [INFO ] Deduced a trap composed of 22 places in 985 ms of which 10 ms to minimize.
[2024-06-01 17:39:49] [INFO ] Deduced a trap composed of 58 places in 944 ms of which 11 ms to minimize.
[2024-06-01 17:39:50] [INFO ] Deduced a trap composed of 35 places in 935 ms of which 11 ms to minimize.
SMT process timed out in 6508ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 385 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1323 transition count 2025
Reduce places removed 5 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 299 rules applied. Total rules applied 304 place count 1318 transition count 1731
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 598 place count 1024 transition count 1731
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 658 place count 994 transition count 1701
Applied a total of 658 rules in 169 ms. Remains 994 /1323 variables (removed 329) and now considering 1701/2030 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 994/1323 places, 1701/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 2689 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1540 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2079 ms. (19 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1064 steps, run visited all 2 properties in 50 ms. (steps per millisecond=21 )
Probabilistic random walk after 1064 steps, saw 933 distinct states, run finished after 51 ms. (steps per millisecond=20 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
[2024-06-01 17:39:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:39:53] [INFO ] Invariant cache hit.
[2024-06-01 17:39:56] [INFO ] [Real]Absence check using 20 positive place invariants in 52 ms returned sat
[2024-06-01 17:40:01] [INFO ] [Real]Absence check using state equation in 5171 ms returned sat
[2024-06-01 17:40:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:40:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 40 ms returned sat
[2024-06-01 17:40:08] [INFO ] [Nat]Absence check using state equation in 4151 ms returned sat
[2024-06-01 17:40:08] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:40:09] [INFO ] [Nat]Added 330 Read/Feed constraints in 443 ms returned sat
[2024-06-01 17:40:09] [INFO ] Deduced a trap composed of 16 places in 678 ms of which 8 ms to minimize.
[2024-06-01 17:40:10] [INFO ] Deduced a trap composed of 215 places in 750 ms of which 9 ms to minimize.
[2024-06-01 17:40:11] [INFO ] Deduced a trap composed of 157 places in 736 ms of which 8 ms to minimize.
[2024-06-01 17:40:12] [INFO ] Deduced a trap composed of 12 places in 824 ms of which 9 ms to minimize.
[2024-06-01 17:40:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3848 ms
[2024-06-01 17:40:13] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 154 ms.
[2024-06-01 17:40:16] [INFO ] Added : 70 causal constraints over 14 iterations in 3741 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 11774 reset in 1198 ms.
Product exploration explored 100000 steps with 11751 reset in 1214 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, false]
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Support contains 385 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 294 rules applied. Total rules applied 294 place count 1323 transition count 2030
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 329 places in 2 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 329 place count 1323 transition count 2030
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 334 place count 1318 transition count 2025
Deduced a syphon composed of 324 places in 2 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 339 place count 1318 transition count 2025
Deduced a syphon composed of 324 places in 2 ms
Applied a total of 339 rules in 162 ms. Remains 1318 /1323 variables (removed 5) and now considering 2025/2030 (removed 5) transitions.
[2024-06-01 17:40:20] [INFO ] Redundant transitions in 47 ms returned []
Running 2018 sub problems to find dead transitions.
[2024-06-01 17:40:20] [INFO ] Flow matrix only has 1815 transitions (discarded 210 similar events)
// Phase 1: matrix 1815 rows 1318 cols
[2024-06-01 17:40:20] [INFO ] Computed 20 invariants in 5 ms
[2024-06-01 17:40:20] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1318 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1318/3133 variables, and 20 constraints, problems are : Problem set: 0 solved, 2018 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1318 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2018/2018 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2018 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1318 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2018 unsolved
[2024-06-01 17:40:54] [INFO ] Deduced a trap composed of 66 places in 1042 ms of which 12 ms to minimize.
[2024-06-01 17:40:55] [INFO ] Deduced a trap composed of 52 places in 1106 ms of which 11 ms to minimize.
[2024-06-01 17:40:56] [INFO ] Deduced a trap composed of 31 places in 1043 ms of which 11 ms to minimize.
[2024-06-01 17:40:57] [INFO ] Deduced a trap composed of 48 places in 1166 ms of which 16 ms to minimize.
[2024-06-01 17:40:58] [INFO ] Deduced a trap composed of 54 places in 1101 ms of which 11 ms to minimize.
[2024-06-01 17:40:59] [INFO ] Deduced a trap composed of 62 places in 1131 ms of which 11 ms to minimize.
[2024-06-01 17:41:01] [INFO ] Deduced a trap composed of 76 places in 1118 ms of which 11 ms to minimize.
[2024-06-01 17:41:02] [INFO ] Deduced a trap composed of 60 places in 1105 ms of which 11 ms to minimize.
[2024-06-01 17:41:03] [INFO ] Deduced a trap composed of 66 places in 1103 ms of which 12 ms to minimize.
[2024-06-01 17:41:04] [INFO ] Deduced a trap composed of 33 places in 908 ms of which 11 ms to minimize.
[2024-06-01 17:41:05] [INFO ] Deduced a trap composed of 47 places in 1051 ms of which 11 ms to minimize.
[2024-06-01 17:41:06] [INFO ] Deduced a trap composed of 41 places in 1054 ms of which 12 ms to minimize.
[2024-06-01 17:41:07] [INFO ] Deduced a trap composed of 101 places in 1054 ms of which 11 ms to minimize.
[2024-06-01 17:41:08] [INFO ] Deduced a trap composed of 91 places in 1048 ms of which 11 ms to minimize.
[2024-06-01 17:41:09] [INFO ] Deduced a trap composed of 19 places in 1042 ms of which 11 ms to minimize.
[2024-06-01 17:41:10] [INFO ] Deduced a trap composed of 78 places in 1040 ms of which 11 ms to minimize.
[2024-06-01 17:41:11] [INFO ] Deduced a trap composed of 37 places in 1095 ms of which 11 ms to minimize.
[2024-06-01 17:41:12] [INFO ] Deduced a trap composed of 34 places in 1180 ms of which 11 ms to minimize.
[2024-06-01 17:41:14] [INFO ] Deduced a trap composed of 99 places in 1164 ms of which 11 ms to minimize.
[2024-06-01 17:41:15] [INFO ] Deduced a trap composed of 31 places in 1028 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1318 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2018 unsolved
[2024-06-01 17:41:17] [INFO ] Deduced a trap composed of 58 places in 1198 ms of which 16 ms to minimize.
[2024-06-01 17:41:18] [INFO ] Deduced a trap composed of 43 places in 1106 ms of which 12 ms to minimize.
[2024-06-01 17:41:19] [INFO ] Deduced a trap composed of 34 places in 1084 ms of which 11 ms to minimize.
[2024-06-01 17:41:20] [INFO ] Deduced a trap composed of 99 places in 1039 ms of which 11 ms to minimize.
SMT process timed out in 60876ms, After SMT, problems are : Problem set: 0 solved, 2018 unsolved
Search for dead transitions found 0 dead transitions in 60896ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1318/1323 places, 2025/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61115 ms. Remains : 1318/1323 places, 2025/2030 transitions.
Support contains 385 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 27 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:41:20] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 17:41:21] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 17:41:21] [INFO ] Implicit Places using invariants in 951 ms returned []
[2024-06-01 17:41:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:41:21] [INFO ] Invariant cache hit.
[2024-06-01 17:41:23] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:41:26] [INFO ] Implicit Places using invariants and state equation in 4261 ms returned []
Implicit Place search using SMT with State Equation took 5217 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 17:41:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:41:26] [INFO ] Invariant cache hit.
[2024-06-01 17:41:26] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:42:00] [INFO ] Deduced a trap composed of 75 places in 1182 ms of which 13 ms to minimize.
[2024-06-01 17:42:01] [INFO ] Deduced a trap composed of 55 places in 1209 ms of which 12 ms to minimize.
[2024-06-01 17:42:03] [INFO ] Deduced a trap composed of 44 places in 1119 ms of which 11 ms to minimize.
[2024-06-01 17:42:04] [INFO ] Deduced a trap composed of 21 places in 1133 ms of which 11 ms to minimize.
[2024-06-01 17:42:05] [INFO ] Deduced a trap composed of 92 places in 1014 ms of which 10 ms to minimize.
[2024-06-01 17:42:06] [INFO ] Deduced a trap composed of 27 places in 1021 ms of which 11 ms to minimize.
[2024-06-01 17:42:07] [INFO ] Deduced a trap composed of 63 places in 964 ms of which 10 ms to minimize.
[2024-06-01 17:42:08] [INFO ] Deduced a trap composed of 21 places in 944 ms of which 9 ms to minimize.
[2024-06-01 17:42:09] [INFO ] Deduced a trap composed of 71 places in 1097 ms of which 10 ms to minimize.
[2024-06-01 17:42:10] [INFO ] Deduced a trap composed of 50 places in 1087 ms of which 10 ms to minimize.
[2024-06-01 17:42:11] [INFO ] Deduced a trap composed of 52 places in 1057 ms of which 11 ms to minimize.
[2024-06-01 17:42:12] [INFO ] Deduced a trap composed of 65 places in 1077 ms of which 11 ms to minimize.
[2024-06-01 17:42:13] [INFO ] Deduced a trap composed of 37 places in 1108 ms of which 11 ms to minimize.
[2024-06-01 17:42:14] [INFO ] Deduced a trap composed of 78 places in 1079 ms of which 11 ms to minimize.
[2024-06-01 17:42:16] [INFO ] Deduced a trap composed of 21 places in 1102 ms of which 11 ms to minimize.
[2024-06-01 17:42:17] [INFO ] Deduced a trap composed of 37 places in 993 ms of which 10 ms to minimize.
[2024-06-01 17:42:18] [INFO ] Deduced a trap composed of 36 places in 939 ms of which 11 ms to minimize.
[2024-06-01 17:42:19] [INFO ] Deduced a trap composed of 108 places in 981 ms of which 10 ms to minimize.
[2024-06-01 17:42:20] [INFO ] Deduced a trap composed of 68 places in 983 ms of which 10 ms to minimize.
[2024-06-01 17:42:21] [INFO ] Deduced a trap composed of 31 places in 946 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 17:42:23] [INFO ] Deduced a trap composed of 29 places in 888 ms of which 10 ms to minimize.
[2024-06-01 17:42:24] [INFO ] Deduced a trap composed of 155 places in 916 ms of which 10 ms to minimize.
[2024-06-01 17:42:25] [INFO ] Deduced a trap composed of 37 places in 922 ms of which 10 ms to minimize.
[2024-06-01 17:42:25] [INFO ] Deduced a trap composed of 67 places in 874 ms of which 11 ms to minimize.
[2024-06-01 17:42:26] [INFO ] Deduced a trap composed of 44 places in 981 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/3143 variables, and 45 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/2023 constraints, Known Traps: 25/25 constraints]
After SMT, in 60789ms problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 60810ms
Finished structural reductions in LTL mode , in 1 iterations and 66059 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Treatment of property Peterson-COL-6-LTLFireability-10 finished in 269918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 126 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 576 place count 1330 transition count 1454
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 1 with 576 rules applied. Total rules applied 1152 place count 754 transition count 1454
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 265 Pre rules applied. Total rules applied 1152 place count 754 transition count 1189
Deduced a syphon composed of 265 places in 1 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 2 with 530 rules applied. Total rules applied 1682 place count 489 transition count 1189
Applied a total of 1682 rules in 48 ms. Remains 489 /1330 variables (removed 841) and now considering 1189/2030 (removed 841) transitions.
[2024-06-01 17:42:27] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
// Phase 1: matrix 979 rows 489 cols
[2024-06-01 17:42:27] [INFO ] Computed 27 invariants in 3 ms
[2024-06-01 17:42:27] [INFO ] Implicit Places using invariants in 472 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 475 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 482/1330 places, 1189/2030 transitions.
Applied a total of 0 rules in 16 ms. Remains 482 /482 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 540 ms. Remains : 482/1330 places, 1189/2030 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 3219 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-11 finished in 3819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1&&X(p0)))))'
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 25 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:42:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 17:42:30] [INFO ] Computed 27 invariants in 5 ms
[2024-06-01 17:42:31] [INFO ] Implicit Places using invariants in 577 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 582 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 26 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-6-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-12 finished in 848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 126 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:42:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 17:42:31] [INFO ] Invariant cache hit.
[2024-06-01 17:42:32] [INFO ] Implicit Places using invariants in 654 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 656 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 731 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-6-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-13 finished in 877 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(((X(F(p2))&&p1)||p0))))'
Support contains 553 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 504 place count 1078 transition count 1778
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 504 place count 1078 transition count 1694
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 672 place count 994 transition count 1694
Applied a total of 672 rules in 119 ms. Remains 994 /1330 variables (removed 336) and now considering 1694/2030 (removed 336) transitions.
[2024-06-01 17:42:32] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
// Phase 1: matrix 1484 rows 994 cols
[2024-06-01 17:42:32] [INFO ] Computed 27 invariants in 5 ms
[2024-06-01 17:42:33] [INFO ] Implicit Places using invariants in 428 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 432 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 987/1330 places, 1694/2030 transitions.
Applied a total of 0 rules in 25 ms. Remains 987 /987 variables (removed 0) and now considering 1694/1694 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 579 ms. Remains : 987/1330 places, 1694/2030 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-14
Product exploration explored 100000 steps with 33243 reset in 5221 ms.
Product exploration explored 100000 steps with 33330 reset in 4986 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 p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 160 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
RANDOM walk for 40000 steps (8 resets) in 3171 ms. (12 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 776 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1996 ms. (20 steps per ms) remains 3/3 properties
[2024-06-01 17:42:45] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
// Phase 1: matrix 1484 rows 987 cols
[2024-06-01 17:42:45] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 17:42:45] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/945 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/945 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1484/2429 variables, 945/959 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2429 variables, 330/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2429 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 42/2471 variables, 42/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2471 variables, 6/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2471 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2471 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2471/2471 variables, and 1337 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 987/987 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/945 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:42:48] [INFO ] Deduced a trap composed of 82 places in 510 ms of which 7 ms to minimize.
[2024-06-01 17:42:49] [INFO ] Deduced a trap composed of 100 places in 281 ms of which 4 ms to minimize.
[2024-06-01 17:42:49] [INFO ] Deduced a trap composed of 80 places in 385 ms of which 5 ms to minimize.
[2024-06-01 17:42:50] [INFO ] Deduced a trap composed of 64 places in 376 ms of which 5 ms to minimize.
[2024-06-01 17:42:50] [INFO ] Deduced a trap composed of 100 places in 389 ms of which 5 ms to minimize.
[2024-06-01 17:42:50] [INFO ] Deduced a trap composed of 194 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/945 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1484/2429 variables, 945/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2429 variables, 330/1295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2429 variables, 2/1297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:42:52] [INFO ] Deduced a trap composed of 190 places in 277 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 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 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 1)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2429/2471 variables, and 1298 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 14/20 constraints, State Equation: 945/987 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 7343ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 553 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1694/1694 transitions.
Applied a total of 0 rules in 27 ms. Remains 987 /987 variables (removed 0) and now considering 1694/1694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 987/987 places, 1694/1694 transitions.
RANDOM walk for 40000 steps (8 resets) in 2899 ms. (13 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 731 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1839 ms. (21 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 174 steps, run visited all 3 properties in 13 ms. (steps per millisecond=13 )
Probabilistic random walk after 174 steps, saw 155 distinct states, run finished after 13 ms. (steps per millisecond=13 ) properties seen :3
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2 p1))), (F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 467 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
Support contains 553 out of 987 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 987/987 places, 1694/1694 transitions.
Applied a total of 0 rules in 21 ms. Remains 987 /987 variables (removed 0) and now considering 1694/1694 (removed 0) transitions.
[2024-06-01 17:42:55] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
[2024-06-01 17:42:55] [INFO ] Invariant cache hit.
[2024-06-01 17:42:56] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-01 17:42:56] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
[2024-06-01 17:42:56] [INFO ] Invariant cache hit.
[2024-06-01 17:42:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:42:58] [INFO ] Implicit Places using invariants and state equation in 2273 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
[2024-06-01 17:42:58] [INFO ] Redundant transitions in 32 ms returned []
Running 1687 sub problems to find dead transitions.
[2024-06-01 17:42:58] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
[2024-06-01 17:42:58] [INFO ] Invariant cache hit.
[2024-06-01 17:42:58] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/987 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/2471 variables, and 20 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/987 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/987 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 17:43:31] [INFO ] Deduced a trap composed of 19 places in 551 ms of which 6 ms to minimize.
[2024-06-01 17:43:32] [INFO ] Deduced a trap composed of 39 places in 530 ms of which 7 ms to minimize.
[2024-06-01 17:43:32] [INFO ] Deduced a trap composed of 87 places in 567 ms of which 8 ms to minimize.
[2024-06-01 17:43:33] [INFO ] Deduced a trap composed of 22 places in 577 ms of which 7 ms to minimize.
[2024-06-01 17:43:34] [INFO ] Deduced a trap composed of 31 places in 568 ms of which 7 ms to minimize.
[2024-06-01 17:43:34] [INFO ] Deduced a trap composed of 25 places in 659 ms of which 9 ms to minimize.
[2024-06-01 17:43:35] [INFO ] Deduced a trap composed of 31 places in 712 ms of which 8 ms to minimize.
[2024-06-01 17:43:36] [INFO ] Deduced a trap composed of 18 places in 691 ms of which 9 ms to minimize.
[2024-06-01 17:43:36] [INFO ] Deduced a trap composed of 18 places in 684 ms of which 8 ms to minimize.
[2024-06-01 17:43:37] [INFO ] Deduced a trap composed of 32 places in 608 ms of which 8 ms to minimize.
[2024-06-01 17:43:38] [INFO ] Deduced a trap composed of 31 places in 711 ms of which 8 ms to minimize.
[2024-06-01 17:43:38] [INFO ] Deduced a trap composed of 64 places in 706 ms of which 8 ms to minimize.
[2024-06-01 17:43:39] [INFO ] Deduced a trap composed of 31 places in 718 ms of which 8 ms to minimize.
[2024-06-01 17:43:40] [INFO ] Deduced a trap composed of 59 places in 727 ms of which 8 ms to minimize.
[2024-06-01 17:43:41] [INFO ] Deduced a trap composed of 31 places in 569 ms of which 8 ms to minimize.
[2024-06-01 17:43:41] [INFO ] Deduced a trap composed of 137 places in 750 ms of which 8 ms to minimize.
[2024-06-01 17:43:42] [INFO ] Deduced a trap composed of 30 places in 713 ms of which 9 ms to minimize.
[2024-06-01 17:43:43] [INFO ] Deduced a trap composed of 31 places in 695 ms of which 8 ms to minimize.
[2024-06-01 17:43:44] [INFO ] Deduced a trap composed of 59 places in 701 ms of which 9 ms to minimize.
[2024-06-01 17:43:44] [INFO ] Deduced a trap composed of 31 places in 709 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/987 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 17:43:46] [INFO ] Deduced a trap composed of 121 places in 812 ms of which 8 ms to minimize.
[2024-06-01 17:43:47] [INFO ] Deduced a trap composed of 55 places in 709 ms of which 8 ms to minimize.
[2024-06-01 17:43:47] [INFO ] Deduced a trap composed of 31 places in 671 ms of which 8 ms to minimize.
[2024-06-01 17:43:48] [INFO ] Deduced a trap composed of 13 places in 651 ms of which 7 ms to minimize.
[2024-06-01 17:43:49] [INFO ] Deduced a trap composed of 16 places in 688 ms of which 8 ms to minimize.
[2024-06-01 17:43:50] [INFO ] Deduced a trap composed of 79 places in 769 ms of which 8 ms to minimize.
[2024-06-01 17:43:50] [INFO ] Deduced a trap composed of 48 places in 680 ms of which 7 ms to minimize.
[2024-06-01 17:43:51] [INFO ] Deduced a trap composed of 54 places in 653 ms of which 8 ms to minimize.
[2024-06-01 17:43:52] [INFO ] Deduced a trap composed of 69 places in 635 ms of which 8 ms to minimize.
[2024-06-01 17:43:52] [INFO ] Deduced a trap composed of 25 places in 679 ms of which 8 ms to minimize.
[2024-06-01 17:43:53] [INFO ] Deduced a trap composed of 81 places in 821 ms of which 9 ms to minimize.
[2024-06-01 17:43:54] [INFO ] Deduced a trap composed of 67 places in 790 ms of which 9 ms to minimize.
[2024-06-01 17:43:55] [INFO ] Deduced a trap composed of 82 places in 803 ms of which 9 ms to minimize.
[2024-06-01 17:43:55] [INFO ] Deduced a trap composed of 72 places in 707 ms of which 8 ms to minimize.
[2024-06-01 17:43:56] [INFO ] Deduced a trap composed of 68 places in 789 ms of which 12 ms to minimize.
[2024-06-01 17:43:57] [INFO ] Deduced a trap composed of 141 places in 846 ms of which 8 ms to minimize.
[2024-06-01 17:43:58] [INFO ] Deduced a trap composed of 137 places in 799 ms of which 9 ms to minimize.
[2024-06-01 17:43:59] [INFO ] Deduced a trap composed of 91 places in 749 ms of which 8 ms to minimize.
SMT process timed out in 60826ms, After SMT, problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 60843ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63606 ms. Remains : 987/987 places, 1694/1694 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) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 129 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
RANDOM walk for 40000 steps (8 resets) in 2836 ms. (14 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 742 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1984 ms. (20 steps per ms) remains 3/3 properties
[2024-06-01 17:44:01] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
[2024-06-01 17:44:01] [INFO ] Invariant cache hit.
[2024-06-01 17:44:01] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/945 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/945 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1484/2429 variables, 945/959 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2429 variables, 330/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2429 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 42/2471 variables, 42/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2471 variables, 6/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2471 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2471 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2471/2471 variables, and 1337 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1813 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 987/987 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/945 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:44:04] [INFO ] Deduced a trap composed of 82 places in 652 ms of which 7 ms to minimize.
[2024-06-01 17:44:05] [INFO ] Deduced a trap composed of 64 places in 624 ms of which 7 ms to minimize.
[2024-06-01 17:44:05] [INFO ] Deduced a trap composed of 155 places in 388 ms of which 5 ms to minimize.
[2024-06-01 17:44:05] [INFO ] Deduced a trap composed of 208 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:44:06] [INFO ] Deduced a trap composed of 154 places in 282 ms of which 4 ms to minimize.
[2024-06-01 17:44:06] [INFO ] Deduced a trap composed of 143 places in 393 ms of which 5 ms to minimize.
[2024-06-01 17:44:06] [INFO ] Deduced a trap composed of 154 places in 385 ms of which 5 ms to minimize.
[2024-06-01 17:44:07] [INFO ] Deduced a trap composed of 140 places in 299 ms of which 6 ms to minimize.
[2024-06-01 17:44:07] [INFO ] Deduced a trap composed of 191 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/945 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:44:07] [INFO ] Deduced a trap composed of 229 places in 157 ms of which 3 ms to minimize.
[2024-06-01 17:44:08] [INFO ] Deduced a trap composed of 181 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:44:08] [INFO ] Deduced a trap composed of 244 places in 162 ms of which 3 ms to minimize.
SMT process timed out in 7307ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 553 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1694/1694 transitions.
Applied a total of 0 rules in 18 ms. Remains 987 /987 variables (removed 0) and now considering 1694/1694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 987/987 places, 1694/1694 transitions.
RANDOM walk for 40000 steps (8 resets) in 2773 ms. (14 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 729 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1832 ms. (21 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 174 steps, run visited all 3 properties in 13 ms. (steps per millisecond=13 )
Probabilistic random walk after 174 steps, saw 155 distinct states, run finished after 13 ms. (steps per millisecond=13 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2 p1))), (F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 397 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 135 reset in 3491 ms.
Product exploration explored 100000 steps with 127 reset in 3498 ms.
Support contains 553 out of 987 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 987/987 places, 1694/1694 transitions.
Applied a total of 0 rules in 18 ms. Remains 987 /987 variables (removed 0) and now considering 1694/1694 (removed 0) transitions.
[2024-06-01 17:44:18] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
[2024-06-01 17:44:18] [INFO ] Invariant cache hit.
[2024-06-01 17:44:18] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-06-01 17:44:18] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
[2024-06-01 17:44:18] [INFO ] Invariant cache hit.
[2024-06-01 17:44:19] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:44:20] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
[2024-06-01 17:44:20] [INFO ] Redundant transitions in 32 ms returned []
Running 1687 sub problems to find dead transitions.
[2024-06-01 17:44:20] [INFO ] Flow matrix only has 1484 transitions (discarded 210 similar events)
[2024-06-01 17:44:20] [INFO ] Invariant cache hit.
[2024-06-01 17:44:20] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/987 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/2471 variables, and 20 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/987 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/987 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 17:44:53] [INFO ] Deduced a trap composed of 19 places in 550 ms of which 7 ms to minimize.
[2024-06-01 17:44:54] [INFO ] Deduced a trap composed of 39 places in 521 ms of which 7 ms to minimize.
[2024-06-01 17:44:54] [INFO ] Deduced a trap composed of 87 places in 556 ms of which 7 ms to minimize.
[2024-06-01 17:44:55] [INFO ] Deduced a trap composed of 22 places in 572 ms of which 7 ms to minimize.
[2024-06-01 17:44:56] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 6 ms to minimize.
[2024-06-01 17:44:56] [INFO ] Deduced a trap composed of 25 places in 771 ms of which 12 ms to minimize.
[2024-06-01 17:44:57] [INFO ] Deduced a trap composed of 31 places in 858 ms of which 8 ms to minimize.
[2024-06-01 17:44:58] [INFO ] Deduced a trap composed of 18 places in 875 ms of which 8 ms to minimize.
[2024-06-01 17:44:59] [INFO ] Deduced a trap composed of 18 places in 691 ms of which 8 ms to minimize.
[2024-06-01 17:45:00] [INFO ] Deduced a trap composed of 32 places in 726 ms of which 8 ms to minimize.
[2024-06-01 17:45:00] [INFO ] Deduced a trap composed of 31 places in 787 ms of which 11 ms to minimize.
[2024-06-01 17:45:01] [INFO ] Deduced a trap composed of 64 places in 871 ms of which 12 ms to minimize.
[2024-06-01 17:45:02] [INFO ] Deduced a trap composed of 31 places in 858 ms of which 9 ms to minimize.
[2024-06-01 17:45:03] [INFO ] Deduced a trap composed of 59 places in 773 ms of which 11 ms to minimize.
[2024-06-01 17:45:04] [INFO ] Deduced a trap composed of 31 places in 825 ms of which 12 ms to minimize.
[2024-06-01 17:45:05] [INFO ] Deduced a trap composed of 137 places in 861 ms of which 8 ms to minimize.
[2024-06-01 17:45:05] [INFO ] Deduced a trap composed of 30 places in 809 ms of which 8 ms to minimize.
[2024-06-01 17:45:06] [INFO ] Deduced a trap composed of 31 places in 740 ms of which 12 ms to minimize.
[2024-06-01 17:45:07] [INFO ] Deduced a trap composed of 59 places in 872 ms of which 8 ms to minimize.
[2024-06-01 17:45:08] [INFO ] Deduced a trap composed of 31 places in 869 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/987 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
[2024-06-01 17:45:10] [INFO ] Deduced a trap composed of 121 places in 857 ms of which 8 ms to minimize.
[2024-06-01 17:45:10] [INFO ] Deduced a trap composed of 55 places in 685 ms of which 8 ms to minimize.
[2024-06-01 17:45:11] [INFO ] Deduced a trap composed of 31 places in 644 ms of which 7 ms to minimize.
[2024-06-01 17:45:12] [INFO ] Deduced a trap composed of 13 places in 646 ms of which 8 ms to minimize.
[2024-06-01 17:45:13] [INFO ] Deduced a trap composed of 16 places in 666 ms of which 8 ms to minimize.
[2024-06-01 17:45:13] [INFO ] Deduced a trap composed of 79 places in 660 ms of which 8 ms to minimize.
[2024-06-01 17:45:14] [INFO ] Deduced a trap composed of 48 places in 684 ms of which 8 ms to minimize.
[2024-06-01 17:45:15] [INFO ] Deduced a trap composed of 54 places in 732 ms of which 8 ms to minimize.
[2024-06-01 17:45:15] [INFO ] Deduced a trap composed of 69 places in 602 ms of which 7 ms to minimize.
[2024-06-01 17:45:16] [INFO ] Deduced a trap composed of 25 places in 693 ms of which 7 ms to minimize.
[2024-06-01 17:45:17] [INFO ] Deduced a trap composed of 81 places in 844 ms of which 13 ms to minimize.
[2024-06-01 17:45:18] [INFO ] Deduced a trap composed of 67 places in 932 ms of which 13 ms to minimize.
[2024-06-01 17:45:19] [INFO ] Deduced a trap composed of 82 places in 954 ms of which 9 ms to minimize.
[2024-06-01 17:45:20] [INFO ] Deduced a trap composed of 72 places in 774 ms of which 8 ms to minimize.
[2024-06-01 17:45:20] [INFO ] Deduced a trap composed of 68 places in 810 ms of which 9 ms to minimize.
[2024-06-01 17:45:21] [INFO ] Deduced a trap composed of 141 places in 810 ms of which 12 ms to minimize.
SMT process timed out in 60880ms, After SMT, problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63635 ms. Remains : 987/987 places, 1694/1694 transitions.
Treatment of property Peterson-COL-6-LTLFireability-14 finished in 169274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 17:45:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 17:45:21] [INFO ] Computed 27 invariants in 8 ms
[2024-06-01 17:45:22] [INFO ] Implicit Places using invariants in 703 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 705 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 23 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 763 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-15
Product exploration explored 100000 steps with 3295 reset in 1371 ms.
Stack based approach found an accepted trace after 6150 steps with 183 reset with depth 132 and stack size 132 in 84 ms.
FORMULA Peterson-COL-6-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-15 finished in 2360 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(F(p1))))))'
Found a Shortening insensitive property : Peterson-COL-6-LTLFireability-01
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1330 transition count 1695
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 1 with 335 rules applied. Total rules applied 670 place count 995 transition count 1695
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 288 Pre rules applied. Total rules applied 670 place count 995 transition count 1407
Deduced a syphon composed of 288 places in 1 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 2 with 576 rules applied. Total rules applied 1246 place count 707 transition count 1407
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 1316 place count 672 transition count 1372
Applied a total of 1316 rules in 74 ms. Remains 672 /1330 variables (removed 658) and now considering 1372/2030 (removed 658) transitions.
[2024-06-01 17:45:24] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 672 cols
[2024-06-01 17:45:24] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 17:45:25] [INFO ] Implicit Places using invariants in 388 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 389 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 665/1330 places, 1372/2030 transitions.
Applied a total of 0 rules in 14 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 478 ms. Remains : 665/1330 places, 1372/2030 transitions.
Running random walk in product with property : Peterson-COL-6-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 916 ms.
Product exploration explored 100000 steps with 25000 reset in 927 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 675 steps (0 resets) in 6 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 665 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Applied a total of 0 rules in 6 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-06-01 17:45:27] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 665 cols
[2024-06-01 17:45:27] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 17:45:27] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 17:45:27] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-06-01 17:45:27] [INFO ] Invariant cache hit.
[2024-06-01 17:45:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:45:29] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2024-06-01 17:45:29] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-06-01 17:45:29] [INFO ] Invariant cache hit.
[2024-06-01 17:45:29] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-06-01 17:45:47] [INFO ] Deduced a trap composed of 31 places in 487 ms of which 6 ms to minimize.
[2024-06-01 17:45:48] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 6 ms to minimize.
[2024-06-01 17:45:48] [INFO ] Deduced a trap composed of 54 places in 492 ms of which 6 ms to minimize.
[2024-06-01 17:45:49] [INFO ] Deduced a trap composed of 41 places in 485 ms of which 6 ms to minimize.
[2024-06-01 17:45:49] [INFO ] Deduced a trap composed of 40 places in 480 ms of which 6 ms to minimize.
[2024-06-01 17:45:50] [INFO ] Deduced a trap composed of 60 places in 563 ms of which 9 ms to minimize.
[2024-06-01 17:45:51] [INFO ] Deduced a trap composed of 75 places in 543 ms of which 6 ms to minimize.
[2024-06-01 17:45:51] [INFO ] Deduced a trap composed of 59 places in 472 ms of which 5 ms to minimize.
[2024-06-01 17:45:52] [INFO ] Deduced a trap composed of 15 places in 473 ms of which 6 ms to minimize.
[2024-06-01 17:45:52] [INFO ] Deduced a trap composed of 30 places in 477 ms of which 6 ms to minimize.
[2024-06-01 17:45:52] [INFO ] Deduced a trap composed of 17 places in 462 ms of which 6 ms to minimize.
[2024-06-01 17:45:53] [INFO ] Deduced a trap composed of 56 places in 427 ms of which 5 ms to minimize.
[2024-06-01 17:45:53] [INFO ] Deduced a trap composed of 17 places in 435 ms of which 5 ms to minimize.
[2024-06-01 17:45:54] [INFO ] Deduced a trap composed of 27 places in 445 ms of which 6 ms to minimize.
[2024-06-01 17:45:54] [INFO ] Deduced a trap composed of 76 places in 451 ms of which 6 ms to minimize.
[2024-06-01 17:45:55] [INFO ] Deduced a trap composed of 49 places in 479 ms of which 8 ms to minimize.
[2024-06-01 17:45:55] [INFO ] Deduced a trap composed of 64 places in 574 ms of which 6 ms to minimize.
[2024-06-01 17:45:56] [INFO ] Deduced a trap composed of 78 places in 443 ms of which 5 ms to minimize.
[2024-06-01 17:45:56] [INFO ] Deduced a trap composed of 54 places in 454 ms of which 6 ms to minimize.
[2024-06-01 17:45:57] [INFO ] Deduced a trap composed of 21 places in 448 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-06-01 17:45:58] [INFO ] Deduced a trap composed of 30 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:45:58] [INFO ] Deduced a trap composed of 118 places in 457 ms of which 5 ms to minimize.
[2024-06-01 17:45:59] [INFO ] Deduced a trap composed of 108 places in 455 ms of which 5 ms to minimize.
[2024-06-01 17:45:59] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 5 ms to minimize.
SMT process timed out in 30540ms, After SMT, problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 30554ms
Finished structural reductions in LTL mode , in 1 iterations and 32252 ms. Remains : 665/665 places, 1372/1372 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 607 steps (0 resets) in 5 ms. (101 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 463 ms.
Product exploration explored 100000 steps with 25000 reset in 484 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 252 Pre rules applied. Total rules applied 0 place count 665 transition count 1624
Deduced a syphon composed of 252 places in 1 ms
Iterating global reduction 0 with 252 rules applied. Total rules applied 252 place count 665 transition count 1624
Deduced a syphon composed of 252 places in 1 ms
Applied a total of 252 rules in 46 ms. Remains 665 /665 variables (removed 0) and now considering 1624/1372 (removed -252) transitions.
[2024-06-01 17:46:01] [INFO ] Redundant transitions in 33 ms returned []
Running 1617 sub problems to find dead transitions.
[2024-06-01 17:46:01] [INFO ] Flow matrix only has 1414 transitions (discarded 210 similar events)
// Phase 1: matrix 1414 rows 665 cols
[2024-06-01 17:46:01] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 17:46:01] [INFO ] State equation strengthened by 582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
[2024-06-01 17:46:23] [INFO ] Deduced a trap composed of 14 places in 352 ms of which 4 ms to minimize.
[2024-06-01 17:46:23] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:46:23] [INFO ] Deduced a trap composed of 14 places in 365 ms of which 5 ms to minimize.
[2024-06-01 17:46:24] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:46:24] [INFO ] Deduced a trap composed of 36 places in 319 ms of which 4 ms to minimize.
[2024-06-01 17:46:25] [INFO ] Deduced a trap composed of 41 places in 360 ms of which 4 ms to minimize.
[2024-06-01 17:46:25] [INFO ] Deduced a trap composed of 32 places in 437 ms of which 5 ms to minimize.
[2024-06-01 17:46:25] [INFO ] Deduced a trap composed of 29 places in 390 ms of which 5 ms to minimize.
[2024-06-01 17:46:26] [INFO ] Deduced a trap composed of 39 places in 463 ms of which 5 ms to minimize.
[2024-06-01 17:46:26] [INFO ] Deduced a trap composed of 29 places in 417 ms of which 5 ms to minimize.
[2024-06-01 17:46:27] [INFO ] Deduced a trap composed of 110 places in 455 ms of which 6 ms to minimize.
[2024-06-01 17:46:27] [INFO ] Deduced a trap composed of 47 places in 492 ms of which 5 ms to minimize.
[2024-06-01 17:46:28] [INFO ] Deduced a trap composed of 27 places in 485 ms of which 6 ms to minimize.
[2024-06-01 17:46:28] [INFO ] Deduced a trap composed of 28 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:46:29] [INFO ] Deduced a trap composed of 73 places in 381 ms of which 5 ms to minimize.
[2024-06-01 17:46:29] [INFO ] Deduced a trap composed of 28 places in 385 ms of which 5 ms to minimize.
[2024-06-01 17:46:29] [INFO ] Deduced a trap composed of 28 places in 387 ms of which 5 ms to minimize.
[2024-06-01 17:46:30] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 5 ms to minimize.
[2024-06-01 17:46:30] [INFO ] Deduced a trap composed of 23 places in 397 ms of which 5 ms to minimize.
[2024-06-01 17:46:31] [INFO ] Deduced a trap composed of 28 places in 449 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
[2024-06-01 17:46:32] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 4 ms to minimize.
SMT process timed out in 30618ms, After SMT, problems are : Problem set: 0 solved, 1617 unsolved
Search for dead transitions found 0 dead transitions in 30634ms
Starting structural reductions in SI_LTL mode, iteration 1 : 665/665 places, 1624/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30723 ms. Remains : 665/665 places, 1624/1372 transitions.
Support contains 7 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Applied a total of 0 rules in 9 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-06-01 17:46:32] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 665 cols
[2024-06-01 17:46:32] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 17:46:32] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-06-01 17:46:32] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-06-01 17:46:32] [INFO ] Invariant cache hit.
[2024-06-01 17:46:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:46:35] [INFO ] Implicit Places using invariants and state equation in 2797 ms returned []
Implicit Place search using SMT with State Equation took 3342 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2024-06-01 17:46:35] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-06-01 17:46:35] [INFO ] Invariant cache hit.
[2024-06-01 17:46:35] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-06-01 17:46:54] [INFO ] Deduced a trap composed of 31 places in 466 ms of which 6 ms to minimize.
[2024-06-01 17:46:54] [INFO ] Deduced a trap composed of 33 places in 529 ms of which 6 ms to minimize.
[2024-06-01 17:46:55] [INFO ] Deduced a trap composed of 54 places in 512 ms of which 6 ms to minimize.
[2024-06-01 17:46:55] [INFO ] Deduced a trap composed of 41 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:46:56] [INFO ] Deduced a trap composed of 40 places in 582 ms of which 8 ms to minimize.
[2024-06-01 17:46:57] [INFO ] Deduced a trap composed of 60 places in 480 ms of which 6 ms to minimize.
[2024-06-01 17:46:57] [INFO ] Deduced a trap composed of 75 places in 474 ms of which 6 ms to minimize.
[2024-06-01 17:46:58] [INFO ] Deduced a trap composed of 59 places in 497 ms of which 6 ms to minimize.
[2024-06-01 17:46:58] [INFO ] Deduced a trap composed of 15 places in 491 ms of which 6 ms to minimize.
[2024-06-01 17:46:59] [INFO ] Deduced a trap composed of 30 places in 478 ms of which 6 ms to minimize.
[2024-06-01 17:46:59] [INFO ] Deduced a trap composed of 17 places in 439 ms of which 6 ms to minimize.
[2024-06-01 17:46:59] [INFO ] Deduced a trap composed of 56 places in 434 ms of which 6 ms to minimize.
[2024-06-01 17:47:00] [INFO ] Deduced a trap composed of 17 places in 364 ms of which 5 ms to minimize.
[2024-06-01 17:47:00] [INFO ] Deduced a trap composed of 27 places in 325 ms of which 6 ms to minimize.
[2024-06-01 17:47:01] [INFO ] Deduced a trap composed of 76 places in 421 ms of which 5 ms to minimize.
[2024-06-01 17:47:01] [INFO ] Deduced a trap composed of 49 places in 414 ms of which 6 ms to minimize.
[2024-06-01 17:47:01] [INFO ] Deduced a trap composed of 64 places in 414 ms of which 5 ms to minimize.
[2024-06-01 17:47:02] [INFO ] Deduced a trap composed of 78 places in 420 ms of which 6 ms to minimize.
[2024-06-01 17:47:02] [INFO ] Deduced a trap composed of 54 places in 419 ms of which 6 ms to minimize.
[2024-06-01 17:47:03] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-06-01 17:47:04] [INFO ] Deduced a trap composed of 30 places in 495 ms of which 5 ms to minimize.
[2024-06-01 17:47:04] [INFO ] Deduced a trap composed of 118 places in 450 ms of which 5 ms to minimize.
[2024-06-01 17:47:05] [INFO ] Deduced a trap composed of 108 places in 448 ms of which 6 ms to minimize.
[2024-06-01 17:47:05] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 5 ms to minimize.
[2024-06-01 17:47:06] [INFO ] Deduced a trap composed of 64 places in 423 ms of which 5 ms to minimize.
SMT process timed out in 30538ms, After SMT, problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 30551ms
Finished structural reductions in LTL mode , in 1 iterations and 33905 ms. Remains : 665/665 places, 1372/1372 transitions.
Treatment of property Peterson-COL-6-LTLFireability-01 finished in 102108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Found a Shortening insensitive property : Peterson-COL-6-LTLFireability-06
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 511 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1330 transition count 1910
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 1210 transition count 1910
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 240 place count 1210 transition count 1652
Deduced a syphon composed of 258 places in 1 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 756 place count 952 transition count 1652
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 840 place count 910 transition count 1610
Applied a total of 840 rules in 98 ms. Remains 910 /1330 variables (removed 420) and now considering 1610/2030 (removed 420) transitions.
[2024-06-01 17:47:06] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
// Phase 1: matrix 1400 rows 910 cols
[2024-06-01 17:47:06] [INFO ] Computed 27 invariants in 10 ms
[2024-06-01 17:47:07] [INFO ] Implicit Places using invariants in 440 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 442 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 903/1330 places, 1610/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 553 ms. Remains : 903/1330 places, 1610/2030 transitions.
Running random walk in product with property : Peterson-COL-6-LTLFireability-06
Product exploration explored 100000 steps with 4471 reset in 3979 ms.
Product exploration explored 100000 steps with 4436 reset in 3888 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 108 steps (0 resets) in 22 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 17:47:15] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
// Phase 1: matrix 1400 rows 903 cols
[2024-06-01 17:47:15] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 17:47:24] [INFO ] [Real]Absence check using 20 positive place invariants in 82 ms returned sat
[2024-06-01 17:47:30] [INFO ] [Real]Absence check using state equation in 5804 ms returned sat
[2024-06-01 17:47:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:47:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 58 ms returned sat
[2024-06-01 17:47:42] [INFO ] [Nat]Absence check using state equation in 3654 ms returned sat
[2024-06-01 17:47:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:47:42] [INFO ] [Nat]Added 330 Read/Feed constraints in 251 ms returned sat
[2024-06-01 17:47:43] [INFO ] Deduced a trap composed of 33 places in 740 ms of which 8 ms to minimize.
[2024-06-01 17:47:44] [INFO ] Deduced a trap composed of 15 places in 748 ms of which 8 ms to minimize.
[2024-06-01 17:47:45] [INFO ] Deduced a trap composed of 160 places in 544 ms of which 6 ms to minimize.
[2024-06-01 17:47:45] [INFO ] Deduced a trap composed of 131 places in 549 ms of which 10 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 17:47:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 10 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-06-01 17:47:45] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 17:47:45] [INFO ] Invariant cache hit.
[2024-06-01 17:47:46] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-06-01 17:47:46] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 17:47:46] [INFO ] Invariant cache hit.
[2024-06-01 17:47:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:47:47] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-06-01 17:47:48] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 17:47:48] [INFO ] Invariant cache hit.
[2024-06-01 17:47:48] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-06-01 17:48:16] [INFO ] Deduced a trap composed of 42 places in 556 ms of which 7 ms to minimize.
[2024-06-01 17:48:16] [INFO ] Deduced a trap composed of 66 places in 733 ms of which 11 ms to minimize.
[2024-06-01 17:48:17] [INFO ] Deduced a trap composed of 60 places in 814 ms of which 8 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 49 places in 841 ms of which 8 ms to minimize.
SMT process timed out in 30499ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 30515ms
Finished structural reductions in LTL mode , in 1 iterations and 32750 ms. Remains : 903/903 places, 1610/1610 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 p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 76 steps (0 resets) in 16 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 17:48:19] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 17:48:19] [INFO ] Invariant cache hit.
[2024-06-01 17:48:27] [INFO ] [Real]Absence check using 20 positive place invariants in 85 ms returned sat
[2024-06-01 17:48:34] [INFO ] [Real]Absence check using state equation in 6367 ms returned sat
[2024-06-01 17:48:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:48:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 59 ms returned sat
[2024-06-01 17:48:45] [INFO ] [Nat]Absence check using state equation in 3069 ms returned sat
[2024-06-01 17:48:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:48:45] [INFO ] [Nat]Added 330 Read/Feed constraints in 284 ms returned sat
[2024-06-01 17:48:46] [INFO ] Deduced a trap composed of 51 places in 764 ms of which 9 ms to minimize.
[2024-06-01 17:48:47] [INFO ] Deduced a trap composed of 62 places in 764 ms of which 7 ms to minimize.
[2024-06-01 17:48:48] [INFO ] Deduced a trap composed of 56 places in 628 ms of which 8 ms to minimize.
[2024-06-01 17:48:48] [INFO ] Deduced a trap composed of 38 places in 430 ms of which 5 ms to minimize.
[2024-06-01 17:48:49] [INFO ] Deduced a trap composed of 28 places in 717 ms of which 8 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 17:48:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4429 reset in 5985 ms.
Product exploration explored 100000 steps with 4478 reset in 5872 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 15 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-06-01 17:49:01] [INFO ] Redundant transitions in 27 ms returned []
Running 1603 sub problems to find dead transitions.
[2024-06-01 17:49:01] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 17:49:01] [INFO ] Invariant cache hit.
[2024-06-01 17:49:01] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-06-01 17:49:29] [INFO ] Deduced a trap composed of 42 places in 723 ms of which 8 ms to minimize.
[2024-06-01 17:49:30] [INFO ] Deduced a trap composed of 66 places in 641 ms of which 7 ms to minimize.
[2024-06-01 17:49:31] [INFO ] Deduced a trap composed of 60 places in 665 ms of which 8 ms to minimize.
[2024-06-01 17:49:31] [INFO ] Deduced a trap composed of 49 places in 658 ms of which 8 ms to minimize.
[2024-06-01 17:49:32] [INFO ] Deduced a trap composed of 61 places in 654 ms of which 8 ms to minimize.
SMT process timed out in 30574ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 30590ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30642 ms. Remains : 903/903 places, 1610/1610 transitions.
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 7 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-06-01 17:49:32] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 17:49:32] [INFO ] Invariant cache hit.
[2024-06-01 17:49:32] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-01 17:49:32] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 17:49:32] [INFO ] Invariant cache hit.
[2024-06-01 17:49:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 17:49:34] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-06-01 17:49:34] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 17:49:34] [INFO ] Invariant cache hit.
[2024-06-01 17:49:34] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-06-01 17:50:03] [INFO ] Deduced a trap composed of 42 places in 724 ms of which 11 ms to minimize.
[2024-06-01 17:50:04] [INFO ] Deduced a trap composed of 66 places in 870 ms of which 8 ms to minimize.
[2024-06-01 17:50:04] [INFO ] Deduced a trap composed of 60 places in 689 ms of which 8 ms to minimize.
[2024-06-01 17:50:05] [INFO ] Deduced a trap composed of 49 places in 695 ms of which 8 ms to minimize.
SMT process timed out in 30851ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 30867ms
Finished structural reductions in LTL mode , in 1 iterations and 32999 ms. Remains : 903/903 places, 1610/1610 transitions.
Treatment of property Peterson-COL-6-LTLFireability-06 finished in 179250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(X(G((p1||X(F(!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(((X(F(p2))&&p1)||p0))))'
[2024-06-01 17:50:06] [INFO ] Flatten gal took : 94 ms
[2024-06-01 17:50:06] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 19 ms.
[2024-06-01 17:50:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 20 ms.
Total runtime 1370167 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Peterson-COL-6-LTLFireability-01
Could not compute solution for formula : Peterson-COL-6-LTLFireability-06
Could not compute solution for formula : Peterson-COL-6-LTLFireability-10
Could not compute solution for formula : Peterson-COL-6-LTLFireability-14

BK_STOP 1717266107439

--------------------
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
mcc2024
ltl formula name Peterson-COL-6-LTLFireability-01
ltl formula formula --ltl=/tmp/4141/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1330 places, 2030 transitions and 6272 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.070 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4141/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4141/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4141/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4141/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name Peterson-COL-6-LTLFireability-06
ltl formula formula --ltl=/tmp/4141/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1330 places, 2030 transitions and 6272 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.060 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4141/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4141/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4141/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4141/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name Peterson-COL-6-LTLFireability-10
ltl formula formula --ltl=/tmp/4141/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1330 places, 2030 transitions and 6272 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4141/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4141/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4141/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.660 real 0.090 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4141/ltl_2_
ltl formula name Peterson-COL-6-LTLFireability-14
ltl formula formula --ltl=/tmp/4141/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1330 places, 2030 transitions and 6272 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.070 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4141/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4141/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4141/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4141/ltl_3_

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="Peterson-COL-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-COL-6, 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 r512-smll-171654407200236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;