Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 23:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 23:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717218945173

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m160
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:15:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:15:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:15:46] [INFO ] Load time of PNML (sax parser for PT used): 427 ms
[2024-06-01 05:15:46] [INFO ] Transformed 6690 places.
[2024-06-01 05:15:46] [INFO ] Transformed 11934 transitions.
[2024-06-01 05:15:46] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 4305 places in 31 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 11934 rows 2385 cols
[2024-06-01 05:15:47] [INFO ] Computed 5 invariants in 887 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 164, 1, 1, 1]
RANDOM walk for 10000 steps (1529 resets) in 838 ms. (11 steps per ms)
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (162 resets) in 86 ms. (344 steps per ms)
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[164, 1]
[2024-06-01 05:15:48] [INFO ] Invariant cache hit.
[2024-06-01 05:15:49] [INFO ] [Real]Absence check using 2 positive place invariants in 42 ms returned sat
[2024-06-01 05:15:49] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 45 ms returned sat
[2024-06-01 05:15:51] [INFO ] [Real]Absence check using state equation in 2304 ms returned sat
[2024-06-01 05:15:53] [INFO ] State equation strengthened by 9690 read => feed constraints.
[2024-06-01 05:15:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 05:15:54] [INFO ] [Real]Absence check using 2 positive place invariants in 48 ms returned sat
[2024-06-01 05:15:54] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 37 ms returned sat
[2024-06-01 05:15:57] [INFO ] [Real]Absence check using state equation in 2909 ms returned sat
[2024-06-01 05:15:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[164, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[164, 1]
Support contains 2 out of 2385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Graph (complete) has 16557 edges and 2385 vertex of which 2367 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.27 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 2367 transition count 11823
Discarding 1105 places :
Symmetric choice reduction at 1 with 1105 rule applications. Total rules 1217 place count 1262 transition count 2417
Iterating global reduction 1 with 1105 rules applied. Total rules applied 2322 place count 1262 transition count 2417
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 2397 place count 1262 transition count 2342
Discarding 910 places :
Symmetric choice reduction at 2 with 910 rule applications. Total rules 3307 place count 352 transition count 1432
Iterating global reduction 2 with 910 rules applied. Total rules applied 4217 place count 352 transition count 1432
Ensure Unique test removed 863 transitions
Reduce isomorphic transitions removed 863 transitions.
Iterating post reduction 2 with 863 rules applied. Total rules applied 5080 place count 352 transition count 569
Discarding 160 places :
Symmetric choice reduction at 3 with 160 rule applications. Total rules 5240 place count 192 transition count 409
Iterating global reduction 3 with 160 rules applied. Total rules applied 5400 place count 192 transition count 409
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 3 with 122 rules applied. Total rules applied 5522 place count 192 transition count 287
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 5532 place count 182 transition count 249
Iterating global reduction 4 with 10 rules applied. Total rules applied 5542 place count 182 transition count 249
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 5543 place count 181 transition count 248
Iterating global reduction 4 with 1 rules applied. Total rules applied 5544 place count 181 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5545 place count 181 transition count 247
Applied a total of 5545 rules in 631 ms. Remains 181 /2385 variables (removed 2204) and now considering 247/11934 (removed 11687) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 ms. Remains : 181/2385 places, 247/11934 transitions.
// Phase 1: matrix 247 rows 181 cols
[2024-06-01 05:15:59] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[164, 1]
RANDOM walk for 1000000 steps (205477 resets) in 1601 ms. (624 steps per ms)
FORMULA RingSingleMessageInMbox-PT-d1m160-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (55800 resets) in 562 ms. (1776 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[164]
[2024-06-01 05:16:01] [INFO ] Invariant cache hit.
[2024-06-01 05:16:01] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 05:16:01] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 05:16:01] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 05:16:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 05:16:01] [INFO ] [Real]Added 75 Read/Feed constraints in 16 ms returned sat
[2024-06-01 05:16:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:16:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 05:16:02] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 05:16:02] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 05:16:02] [INFO ] [Nat]Added 75 Read/Feed constraints in 11 ms returned sat
[2024-06-01 05:16:02] [INFO ] Computed and/alt/rep : 73/189/73 causal constraints (skipped 173 transitions) in 36 ms.
[2024-06-01 05:16:02] [INFO ] Added : 1 causal constraints over 1 iterations in 79 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[164]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[164]
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 247/247 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 180 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 180 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 179 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 179 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 179 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 178 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 178 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 177 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 177 transition count 228
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 172 transition count 223
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 172 transition count 223
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 172 transition count 218
Applied a total of 24 rules in 33 ms. Remains 172 /181 variables (removed 9) and now considering 218/247 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 172/181 places, 218/247 transitions.
// Phase 1: matrix 218 rows 172 cols
[2024-06-01 05:16:02] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[164]
RANDOM walk for 1000000 steps (210077 resets) in 1363 ms. (733 steps per ms)
BEST_FIRST walk for 1000001 steps (68612 resets) in 528 ms. (1890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[164]
[2024-06-01 05:16:04] [INFO ] Invariant cache hit.
[2024-06-01 05:16:04] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 05:16:04] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 05:16:04] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 05:16:04] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 05:16:04] [INFO ] [Real]Added 54 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:16:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:16:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 05:16:04] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 05:16:04] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-01 05:16:04] [INFO ] [Nat]Added 54 Read/Feed constraints in 7 ms returned sat
[2024-06-01 05:16:04] [INFO ] Computed and/alt/rep : 71/183/71 causal constraints (skipped 146 transitions) in 33 ms.
[2024-06-01 05:16:04] [INFO ] Added : 1 causal constraints over 1 iterations in 70 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[164]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[164]
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 218/218 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 172/172 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-06-01 05:16:04] [INFO ] Invariant cache hit.
[2024-06-01 05:16:04] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 05:16:04] [INFO ] Invariant cache hit.
[2024-06-01 05:16:04] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 05:16:05] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-06-01 05:16:05] [INFO ] Redundant transitions in 8 ms returned []
Running 217 sub problems to find dead transitions.
[2024-06-01 05:16:05] [INFO ] Invariant cache hit.
[2024-06-01 05:16:05] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 05:16:08] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 7 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
[2024-06-01 05:16:08] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 2 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-06-01 05:16:08] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
[2024-06-01 05:16:08] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 205 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 6 (OVERLAPS) 218/390 variables, 172/180 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 54/234 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/234 constraints. Problems are: Problem set: 36 solved, 181 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/234 constraints. Problems are: Problem set: 36 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 234 constraints, problems are : Problem set: 36 solved, 181 unsolved in 9584 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 172/172 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 36 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 11/148 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/2 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 24/172 variables, 2/4 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 4/8 constraints. Problems are: Problem set: 36 solved, 181 unsolved
[2024-06-01 05:16:16] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:16:16] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:16:16] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 3/11 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/11 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 218/390 variables, 172/183 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 54/237 constraints. Problems are: Problem set: 36 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 181/418 constraints. Problems are: Problem set: 36 solved, 181 unsolved
[2024-06-01 05:16:20] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-06-01 05:16:21] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 2 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 2/420 constraints. Problems are: Problem set: 46 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/420 constraints. Problems are: Problem set: 46 solved, 171 unsolved
[2024-06-01 05:16:31] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:16:32] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:16:32] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 3 ms to minimize.
[2024-06-01 05:16:32] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/390 variables, 4/424 constraints. Problems are: Problem set: 46 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/424 constraints. Problems are: Problem set: 46 solved, 171 unsolved
At refinement iteration 15 (OVERLAPS) 0/390 variables, 0/424 constraints. Problems are: Problem set: 46 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 424 constraints, problems are : Problem set: 46 solved, 171 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 172/172 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 181/217 constraints, Known Traps: 13/13 constraints]
After SMT, in 40042ms problems are : Problem set: 46 solved, 171 unsolved
Search for dead transitions found 46 dead transitions in 40052ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 172/172 places, 172/218 transitions.
Graph (complete) has 439 edges and 172 vertex of which 130 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 128 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 126 transition count 152
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 126 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 124 transition count 150
Applied a total of 29 rules in 23 ms. Remains 124 /172 variables (removed 48) and now considering 150/172 (removed 22) transitions.
// Phase 1: matrix 150 rows 124 cols
[2024-06-01 05:16:45] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:16:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 05:16:45] [INFO ] Invariant cache hit.
[2024-06-01 05:16:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:16:45] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 124/172 places, 150/218 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40867 ms. Remains : 124/172 places, 150/218 transitions.
[2024-06-01 05:16:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[164]
RANDOM walk for 1000000 steps (209864 resets) in 1086 ms. (919 steps per ms)
BEST_FIRST walk for 1000000 steps (68696 resets) in 422 ms. (2364 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[164]
[2024-06-01 05:16:47] [INFO ] Invariant cache hit.
[2024-06-01 05:16:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:16:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:16:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:16:47] [INFO ] [Real]Added 50 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:16:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:16:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 05:16:47] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 05:16:47] [INFO ] [Nat]Added 50 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:16:47] [INFO ] Computed and/alt/rep : 41/81/41 causal constraints (skipped 108 transitions) in 22 ms.
[2024-06-01 05:16:47] [INFO ] Added : 1 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[164]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[164]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 124/124 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-06-01 05:16:47] [INFO ] Invariant cache hit.
[2024-06-01 05:16:47] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 05:16:47] [INFO ] Invariant cache hit.
[2024-06-01 05:16:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:16:47] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-06-01 05:16:47] [INFO ] Redundant transitions in 3 ms returned []
Running 149 sub problems to find dead transitions.
[2024-06-01 05:16:47] [INFO ] Invariant cache hit.
[2024-06-01 05:16:47] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/274 variables, 124/125 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 50/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 175 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/274 variables, 124/125 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 50/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 149/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 324 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 11435ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 11438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11718 ms. Remains : 124/124 places, 150/150 transitions.
RANDOM walk for 40000 steps (8450 resets) in 646 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2767 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2789 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 921864 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :0 out of 2
Probabilistic random walk after 921864 steps, saw 400827 distinct states, run finished after 3006 ms. (steps per millisecond=306 ) properties seen :0
[2024-06-01 05:17:02] [INFO ] Invariant cache hit.
[2024-06-01 05:17:02] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/109 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 152/261 variables, 106/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 46/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:17:02] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 11 (OVERLAPS) 13/274 variables, 13/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/274 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 176 constraints, problems are : Problem set: 1 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/109 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 152/261 variables, 106/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 46/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/274 variables, 13/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/274 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 177 constraints, problems are : Problem set: 1 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 278ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 6 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[164]
Starting property specific reduction for RingSingleMessageInMbox-PT-d1m160-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[164]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[164]
[2024-06-01 05:17:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[164]
RANDOM walk for 10000 steps (2160 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (717 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[164]
[2024-06-01 05:17:02] [INFO ] Invariant cache hit.
[2024-06-01 05:17:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:17:02] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:17:02] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:17:02] [INFO ] [Real]Added 50 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:17:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:17:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 05:17:03] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 05:17:03] [INFO ] [Nat]Added 50 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:17:03] [INFO ] Computed and/alt/rep : 41/81/41 causal constraints (skipped 108 transitions) in 11 ms.
[2024-06-01 05:17:03] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[164]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[164]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 150/150 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 124/124 places, 150/150 transitions.
[2024-06-01 05:17:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[164]
RANDOM walk for 1000000 steps (210163 resets) in 1009 ms. (990 steps per ms)
BEST_FIRST walk for 1000001 steps (69099 resets) in 426 ms. (2341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[164]
[2024-06-01 05:17:04] [INFO ] Invariant cache hit.
[2024-06-01 05:17:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:17:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:17:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:17:04] [INFO ] [Real]Added 50 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:17:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:17:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:17:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:17:04] [INFO ] [Nat]Added 50 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:17:04] [INFO ] Computed and/alt/rep : 41/81/41 causal constraints (skipped 108 transitions) in 12 ms.
[2024-06-01 05:17:04] [INFO ] Added : 1 causal constraints over 1 iterations in 50 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[164]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[164]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 150/150 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 124/124 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 150/150 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-06-01 05:17:04] [INFO ] Invariant cache hit.
[2024-06-01 05:17:04] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 05:17:04] [INFO ] Invariant cache hit.
[2024-06-01 05:17:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:17:05] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-06-01 05:17:05] [INFO ] Redundant transitions in 1 ms returned []
Running 149 sub problems to find dead transitions.
[2024-06-01 05:17:05] [INFO ] Invariant cache hit.
[2024-06-01 05:17:05] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/274 variables, 124/125 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 50/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 175 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/274 variables, 124/125 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 50/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 149/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 324 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 11538ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 11540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11817 ms. Remains : 124/124 places, 150/150 transitions.
[2024-06-01 05:17:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[164]
RANDOM walk for 1000000 steps (209679 resets) in 1034 ms. (966 steps per ms)
BEST_FIRST walk for 1000001 steps (69645 resets) in 436 ms. (2288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[164]
[2024-06-01 05:17:18] [INFO ] Invariant cache hit.
[2024-06-01 05:17:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:17:18] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-01 05:17:18] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:17:18] [INFO ] [Real]Added 50 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:17:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:17:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:17:18] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:17:18] [INFO ] [Nat]Added 50 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:17:18] [INFO ] Computed and/alt/rep : 41/81/41 causal constraints (skipped 108 transitions) in 9 ms.
[2024-06-01 05:17:18] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[164]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[164]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 150/150 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 124/124 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 150/150 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-06-01 05:17:18] [INFO ] Invariant cache hit.
[2024-06-01 05:17:18] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 05:17:18] [INFO ] Invariant cache hit.
[2024-06-01 05:17:18] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:17:18] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-06-01 05:17:18] [INFO ] Redundant transitions in 1 ms returned []
Running 149 sub problems to find dead transitions.
[2024-06-01 05:17:18] [INFO ] Invariant cache hit.
[2024-06-01 05:17:18] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/274 variables, 124/125 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 50/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 175 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/274 variables, 124/125 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 50/175 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 149/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 324 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 11364ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 11366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11615 ms. Remains : 124/124 places, 150/150 transitions.
RANDOM walk for 40000 steps (8422 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2855 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2725 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1185928 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 2
Probabilistic random walk after 1185928 steps, saw 515291 distinct states, run finished after 3003 ms. (steps per millisecond=394 ) properties seen :0
[2024-06-01 05:17:33] [INFO ] Invariant cache hit.
[2024-06-01 05:17:33] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/109 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 152/261 variables, 106/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 46/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:17:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 11 (OVERLAPS) 13/274 variables, 13/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/274 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 176 constraints, problems are : Problem set: 1 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/109 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 152/261 variables, 106/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 46/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/274 variables, 13/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/274 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 177 constraints, problems are : Problem set: 1 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 280ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 0 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[164]
Ending property specific reduction for RingSingleMessageInMbox-PT-d1m160-UpperBounds-09 in 30544 ms.
[2024-06-01 05:17:33] [INFO ] Flatten gal took : 62 ms
[2024-06-01 05:17:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 05:17:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 150 transitions and 594 arcs took 4 ms.
Total runtime 107335 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m160-UpperBounds-09

BK_STOP 1717219053861

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name RingSingleMessageInMbox-PT-d1m160-UpperBounds-09
ub formula formula --maxsum=/tmp/715/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="RingSingleMessageInMbox-PT-d1m160"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is RingSingleMessageInMbox-PT-d1m160, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679079600101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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