Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.5K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 12 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717104573604

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:29:35] [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-05-30 21:29:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:29:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2024-05-30 21:29:35] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 21 ms.
[2024-05-30 21:29:35] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 197 ms.
[2024-05-30 21:29:36] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-30 21:29:36] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-30 21:29:36] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-30 21:29:36] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 40 places in 28 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2240 resets) in 5802 ms. (6 steps per ms) remains 30/36 properties
BEST_FIRST walk for 4003 steps (41 resets) in 305 ms. (13 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (39 resets) in 96 ms. (41 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 118 ms. (33 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 101 ms. (39 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 97 ms. (40 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 98 ms. (40 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 102 ms. (38 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (40 resets) in 98 ms. (40 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 89 ms. (44 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (41 resets) in 87 ms. (45 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 84 ms. (47 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 85 ms. (46 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (38 resets) in 210 ms. (18 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 297 ms. (13 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (41 resets) in 176 ms. (22 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 10/26 properties
BEST_FIRST walk for 4003 steps (40 resets) in 291 ms. (13 steps per ms) remains 10/10 properties
[2024-05-30 21:29:38] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-30 21:29:38] [INFO ] Computed 112 invariants in 127 ms
[2024-05-30 21:29:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 660/807 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/807 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/807 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 42/849 variables, 42/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 5/854 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2221/3075 variables, 854/966 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3075 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 21:29:43] [INFO ] Deduced a trap composed of 415 places in 941 ms of which 62 ms to minimize.
[2024-05-30 21:29:44] [INFO ] Deduced a trap composed of 221 places in 809 ms of which 8 ms to minimize.
SMT process timed out in 6301ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 147 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 100 place count 799 transition count 2185
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 100 place count 799 transition count 2142
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 186 place count 756 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 755 transition count 2141
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 755 transition count 2141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 753 transition count 2139
Applied a total of 192 rules in 410 ms. Remains 753 /854 variables (removed 101) and now considering 2139/2230 (removed 91) transitions.
Running 2128 sub problems to find dead transitions.
[2024-05-30 21:29:45] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 753 cols
[2024-05-30 21:29:45] [INFO ] Computed 102 invariants in 117 ms
[2024-05-30 21:29:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/2883 variables, and 92 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 20099 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/753 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
[2024-05-30 21:30:26] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/2883 variables, and 93 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/753 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1128 constraints, Known Traps: 1/1 constraints]
After SMT, in 57988ms problems are : Problem set: 0 solved, 2128 unsolved
Search for dead transitions found 0 dead transitions in 58022ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58471 ms. Remains : 753/854 places, 2139/2230 transitions.
RANDOM walk for 4000000 steps (261361 resets) in 59606 ms. (67 steps per ms) remains 1/10 properties
BEST_FIRST walk for 4000004 steps (32586 resets) in 10720 ms. (373 steps per ms) remains 1/1 properties
[2024-05-30 21:31:02] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
[2024-05-30 21:31:02] [INFO ] Invariant cache hit.
[2024-05-30 21:31:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/742 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/743 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/751 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/752 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/752 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2130/2882 variables, 752/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2882 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2882 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2883 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2883 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2883 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2883/2883 variables, and 856 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 753/753 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/742 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/743 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/751 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/752 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/752 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2130/2882 variables, 752/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2882 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2882 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2883 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2883 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2883 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2883 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2883/2883 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 753/753 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2468ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 2139/2139 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 753 transition count 2138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 752 transition count 2138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 752 transition count 2136
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 750 transition count 2136
Applied a total of 6 rules in 216 ms. Remains 750 /753 variables (removed 3) and now considering 2136/2139 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 750/753 places, 2136/2139 transitions.
RANDOM walk for 4000000 steps (290346 resets) in 62324 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (33303 resets) in 10588 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 5218679 steps, run timeout after 54001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 5218679 steps, saw 895288 distinct states, run finished after 54022 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-30 21:32:17] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
// Phase 1: matrix 2127 rows 750 cols
[2024-05-30 21:32:17] [INFO ] Computed 102 invariants in 31 ms
[2024-05-30 21:32:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2325ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 80 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 66 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-05-30 21:32:20] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:32:20] [INFO ] Invariant cache hit.
[2024-05-30 21:32:21] [INFO ] Implicit Places using invariants in 998 ms returned []
[2024-05-30 21:32:21] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:32:21] [INFO ] Invariant cache hit.
[2024-05-30 21:32:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:32:28] [INFO ] Implicit Places using invariants and state equation in 6825 ms returned []
Implicit Place search using SMT with State Equation took 7835 ms to find 0 implicit places.
[2024-05-30 21:32:28] [INFO ] Redundant transitions in 119 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-30 21:32:28] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:32:28] [INFO ] Invariant cache hit.
[2024-05-30 21:32:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
[2024-05-30 21:33:23] [INFO ] Deduced a trap composed of 18 places in 415 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 93 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 1/1 constraints]
After SMT, in 81849ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 81877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89913 ms. Remains : 750/750 places, 2136/2136 transitions.
RANDOM walk for 400000 steps (29131 resets) in 7197 ms. (55 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-30 21:33:51] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:33:51] [INFO ] Invariant cache hit.
[2024-05-30 21:33:52] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-30 21:33:52] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-30 21:33:52] [INFO ] After 505ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 21:33:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:33:52] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:33:52] [INFO ] After 141ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:33:52] [INFO ] After 843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:33:52] [INFO ] [Nat]Absence check using 95 positive place invariants in 26 ms returned sat
[2024-05-30 21:33:53] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-30 21:33:53] [INFO ] After 913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 21:33:54] [INFO ] After 333ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:33:54] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 21:33:54] [INFO ] After 1567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (290285 resets) in 62621 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (32909 resets) in 11179 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 5710614 steps, run timeout after 57001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 5710614 steps, saw 982339 distinct states, run finished after 57002 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-30 21:35:10] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:35:10] [INFO ] Invariant cache hit.
[2024-05-30 21:35:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2400ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 61 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 56 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-05-30 21:35:13] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:35:13] [INFO ] Invariant cache hit.
[2024-05-30 21:35:13] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-30 21:35:13] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:35:13] [INFO ] Invariant cache hit.
[2024-05-30 21:35:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:35:20] [INFO ] Implicit Places using invariants and state equation in 7291 ms returned []
Implicit Place search using SMT with State Equation took 7931 ms to find 0 implicit places.
[2024-05-30 21:35:21] [INFO ] Redundant transitions in 165 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-30 21:35:21] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:35:21] [INFO ] Invariant cache hit.
[2024-05-30 21:35:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 2.0 3.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 1.0)
(s129 0.0)
(s130 (/ 2.0 3.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 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 (/ 1.0 3.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 (/ 1.0 3.0))
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.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 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 4.0)
(s259 4.0)
(s260 4.0)
(s261 4.0)
(s262 4.0)
(s263 4.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 9.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.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 0.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 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
[2024-05-30 21:36:16] [INFO ] Deduced a trap composed of 18 places in 506 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 93 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 1/1 constraints]
After SMT, in 82196ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 82229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90402 ms. Remains : 750/750 places, 2136/2136 transitions.
RANDOM walk for 400000 steps (29037 resets) in 6501 ms. (61 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-30 21:36:45] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:36:45] [INFO ] Invariant cache hit.
[2024-05-30 21:36:45] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2024-05-30 21:36:45] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-30 21:36:45] [INFO ] After 567ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 21:36:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:36:45] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:36:46] [INFO ] After 139ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:36:46] [INFO ] After 903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:36:46] [INFO ] [Nat]Absence check using 95 positive place invariants in 30 ms returned sat
[2024-05-30 21:36:46] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-30 21:36:47] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 21:36:47] [INFO ] After 312ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:36:47] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 21:36:47] [INFO ] After 1531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (2921 resets) in 985 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (354 resets) in 427 ms. (93 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 293900 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 293900 steps, saw 47989 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-30 21:36:51] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:36:51] [INFO ] Invariant cache hit.
[2024-05-30 21:36:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2085ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 65 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Running 2125 sub problems to find dead transitions.
[2024-05-30 21:36:53] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:36:53] [INFO ] Invariant cache hit.
[2024-05-30 21:36:53] [INFO ] State equation strengthened by 1 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/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
SMT process timed out in 41213ms, After SMT, problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 41261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41338 ms. Remains : 750/750 places, 2136/2136 transitions.
RANDOM walk for 40000 steps (2918 resets) in 1010 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (329 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 286192 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 286192 steps, saw 46836 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-30 21:37:37] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:37:37] [INFO ] Invariant cache hit.
[2024-05-30 21:37:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2466ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 56 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 50 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-05-30 21:37:40] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:37:40] [INFO ] Invariant cache hit.
[2024-05-30 21:37:41] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2024-05-30 21:37:41] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:37:41] [INFO ] Invariant cache hit.
[2024-05-30 21:37:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:37:49] [INFO ] Implicit Places using invariants and state equation in 7153 ms returned []
Implicit Place search using SMT with State Equation took 8391 ms to find 0 implicit places.
[2024-05-30 21:37:49] [INFO ] Redundant transitions in 43 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-30 21:37:49] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-30 21:37:49] [INFO ] Invariant cache hit.
[2024-05-30 21:37:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
[2024-05-30 21:38:42] [INFO ] Deduced a trap composed of 18 places in 426 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 93 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 1/1 constraints]
After SMT, in 80074ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 80106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88630 ms. Remains : 750/750 places, 2136/2136 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 2127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 2126
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 749 transition count 2126
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 2125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 2125
Applied a total of 13 rules in 212 ms. Remains 748 /750 variables (removed 2) and now considering 2125/2136 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2125 rows 748 cols
[2024-05-30 21:39:09] [INFO ] Computed 102 invariants in 57 ms
[2024-05-30 21:39:09] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2024-05-30 21:39:09] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-30 21:39:09] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:39:09] [INFO ] [Nat]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-05-30 21:39:09] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-30 21:39:11] [INFO ] After 1207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:39:11] [INFO ] After 1332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 21:39:11] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2114 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 576296 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J40

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 48
TRANSITIONS: 38
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 8
COLOR VARS: 26
ARCS: 140
LOADING TIME: 0.241

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 894
TRANSITIONS: 12380
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 114079
UNFOLDING TIME: 1.342

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.402
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 2.16
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 714
MODEL NAME: /home/mcc/execution/model
894 places, 12380 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J40"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S10J40, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654455200262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;