Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445900431.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-S10J60, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445900431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 10:55 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:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 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 94K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S10J60-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716882970336

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:56:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 07:56:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:56:11] [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-28 07:56:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:56:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 597 ms
[2024-05-28 07:56:12] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 07:56:12] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 07:56:12] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40023 steps (2280 resets) in 408 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2191 steps (36 resets) in 9 ms. (219 steps per ms) remains 0/1 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 07:56:12] [INFO ] Flatten gal took : 48 ms
[2024-05-28 07:56:12] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 07:56:13] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 436 ms.
[2024-05-28 07:56:13] [INFO ] Unfolded 16 HLPN properties in 5 ms.
[2024-05-28 07:56:13] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 07:56:13] [INFO ] Reduced 9285 identical enabling conditions.
Deduced a syphon composed of 60 places in 25 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2233 resets) in 4005 ms. (9 steps per ms) remains 9/16 properties
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (424 resets) in 4694 ms. (8 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (120 resets) in 3309 ms. (12 steps per ms) remains 8/9 properties
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (163 resets) in 2566 ms. (15 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (417 resets) in 1526 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (353 resets) in 665 ms. (60 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (416 resets) in 383 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (419 resets) in 10044 ms. (3 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (375 resets) in 11059 ms. (3 steps per ms) remains 8/8 properties
[2024-05-28 07:56:24] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-28 07:56:24] [INFO ] Computed 152 invariants in 158 ms
[2024-05-28 07:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-COL-S10J60-ReachabilityFireability-2024-02 is UNSAT
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S10J60-ReachabilityFireability-2024-07 is UNSAT
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1234 variables, 145/145 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem PolyORBNT-COL-S10J60-ReachabilityFireability-2024-03 is UNSAT
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S10J60-ReachabilityFireability-2024-09 is UNSAT
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S10J60-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S10J60-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/1234 variables, 7/152 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1234 variables, 0/152 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2801/4035 variables, 1234/1386 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4035 variables, 1/1387 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4035 variables, 0/1387 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/4035 variables, 0/1387 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4035/4035 variables, and 1387 constraints, problems are : Problem set: 6 solved, 2 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 145/145 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1234/1234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 509/575 variables, 64/64 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 1/65 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 0/65 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 611/1186 variables, 62/127 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1186 variables, 0/127 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/1222 variables, 18/145 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1222 variables, 0/145 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/1232 variables, 6/151 constraints. Problems are: Problem set: 6 solved, 2 unsolved
[2024-05-28 07:56:45] [INFO ] Deduced a trap composed of 619 places in 759 ms of which 102 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1232 variables, 1/152 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1232 variables, 0/152 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/1233 variables, 1/153 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1233 variables, 0/153 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2801/4034 variables, 1233/1386 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4034 variables, 1/1387 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4034 variables, 0/1387 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/4035 variables, 1/1388 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4035 variables, 2/1390 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4035 variables, 0/1390 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/4035 variables, 0/1390 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4035/4035 variables, and 1390 constraints, problems are : Problem set: 6 solved, 2 unsolved in 4726 ms.
Refiners :[Positive P Invariants (semi-flows): 145/145 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1234/1234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 24807ms problems are : Problem set: 6 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 136 ms.
Support contains 66 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 1224 transition count 2746
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 138 place count 1160 transition count 2746
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 138 place count 1160 transition count 2680
Deduced a syphon composed of 66 places in 3 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 270 place count 1094 transition count 2680
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 274 place count 1092 transition count 2678
Applied a total of 274 rules in 545 ms. Remains 1092 /1234 variables (removed 142) and now considering 2678/2810 (removed 132) transitions.
Running 2667 sub problems to find dead transitions.
[2024-05-28 07:56:49] [INFO ] Flow matrix only has 2669 transitions (discarded 9 similar events)
// Phase 1: matrix 2669 rows 1092 cols
[2024-05-28 07:56:49] [INFO ] Computed 142 invariants in 133 ms
[2024-05-28 07:56:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.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 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 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 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 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 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 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 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 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 1.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)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 4.0)
(s380 4.0)
(s381 4.0)
(s382 4.0)
(s383 4.0)
(s384 4.0)
(s385 4.0)
(s386 4.0)
(s387 4.0)
(s388 4.0)
(s389 9.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2667 unsolved
SMT process timed out in 46368ms, After SMT, problems are : Problem set: 0 solved, 2667 unsolved
Search for dead transitions found 0 dead transitions in 46412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46986 ms. Remains : 1092/1234 places, 2678/2810 transitions.
RANDOM walk for 40000 steps (2903 resets) in 1045 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (286 resets) in 437 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (315 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 215363 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 215363 steps, saw 36327 distinct states, run finished after 3005 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-28 07:57:39] [INFO ] Flow matrix only has 2669 transitions (discarded 9 similar events)
[2024-05-28 07:57:39] [INFO ] Invariant cache hit.
[2024-05-28 07:57:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 374/440 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 610/1050 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/1077 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/1089 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1091 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1091 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2669/3760 variables, 1091/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/3760 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3760 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/3761 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3761 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/3761 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3761/3761 variables, and 1235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1664 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1092/1092 constraints, ReadFeed: 1/1 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/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 374/440 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 610/1050 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/1077 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/1089 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1091 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1091 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2669/3760 variables, 1091/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3760 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:57:43] [INFO ] Deduced a trap composed of 475 places in 808 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3760 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3760 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/3761 variables, 1/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3761 variables, 2/1238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3761 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3761 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3761/3761 variables, and 1238 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4092 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1092/1092 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 5820ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 66 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 2678/2678 transitions.
Applied a total of 0 rules in 126 ms. Remains 1092 /1092 variables (removed 0) and now considering 2678/2678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 1092/1092 places, 2678/2678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 2678/2678 transitions.
Applied a total of 0 rules in 100 ms. Remains 1092 /1092 variables (removed 0) and now considering 2678/2678 (removed 0) transitions.
[2024-05-28 07:57:45] [INFO ] Flow matrix only has 2669 transitions (discarded 9 similar events)
[2024-05-28 07:57:45] [INFO ] Invariant cache hit.
[2024-05-28 07:57:46] [INFO ] Implicit Places using invariants in 1258 ms returned []
[2024-05-28 07:57:47] [INFO ] Flow matrix only has 2669 transitions (discarded 9 similar events)
[2024-05-28 07:57:47] [INFO ] Invariant cache hit.
[2024-05-28 07:57:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:57:59] [INFO ] Implicit Places using invariants and state equation in 12256 ms returned []
Implicit Place search using SMT with State Equation took 13522 ms to find 0 implicit places.
[2024-05-28 07:57:59] [INFO ] Redundant transitions in 177 ms returned []
Running 2667 sub problems to find dead transitions.
[2024-05-28 07:57:59] [INFO ] Flow matrix only has 2669 transitions (discarded 9 similar events)
[2024-05-28 07:57:59] [INFO ] Invariant cache hit.
[2024-05-28 07:57:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 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 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 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 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 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 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 1.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)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 4.0)
(s380 4.0)
(s381 4.0)
(s382 4.0)
(s383 4.0)
(s384 4.0)
(s385 4.0)
(s386 4.0)
(s387 4.0)
(s388 4.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.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 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.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 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.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 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.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 1.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2667 unsolved
SMT process timed out in 53128ms, After SMT, problems are : Problem set: 0 solved, 2667 unsolved
Search for dead transitions found 0 dead transitions in 53171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66992 ms. Remains : 1092/1092 places, 2678/2678 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 1092 transition count 2669
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 1092 transition count 2668
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1091 transition count 2668
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1091 transition count 2667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1090 transition count 2667
Applied a total of 13 rules in 320 ms. Remains 1090 /1092 variables (removed 2) and now considering 2667/2678 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2667 rows 1090 cols
[2024-05-28 07:58:53] [INFO ] Computed 142 invariants in 79 ms
[2024-05-28 07:58:53] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2024-05-28 07:58:53] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-28 07:58:53] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 07:58:53] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2024-05-28 07:58:53] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-28 07:58:55] [INFO ] After 1929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 07:58:57] [INFO ] Deduced a trap composed of 171 places in 949 ms of which 7 ms to minimize.
[2024-05-28 07:58:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1269 ms
TRAPS : Iteration 1
[2024-05-28 07:58:58] [INFO ] After 4658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 07:58:58] [INFO ] After 5394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 6144 ms.
[2024-05-28 07:58:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-28 07:58:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1092 places, 2678 transitions and 16788 arcs took 30 ms.
[2024-05-28 07:58:59] [INFO ] Flatten gal took : 351 ms
Total runtime 167587 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J60

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1092
TRANSITIONS: 2678
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.098s, Sys 0.010s]


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


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

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

Process ID: 623
MODEL NAME: /home/mcc/execution/419/model
1092 places, 2678 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 ReachabilityFireability -timeout 360 -rebuildPNML
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-S10J60"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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