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.r553-tall-171734901400309.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 FireWire-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 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 FireWire-PT-18-UpperBounds-00
FORMULA_NAME FireWire-PT-18-UpperBounds-01
FORMULA_NAME FireWire-PT-18-UpperBounds-02
FORMULA_NAME FireWire-PT-18-UpperBounds-03
FORMULA_NAME FireWire-PT-18-UpperBounds-04
FORMULA_NAME FireWire-PT-18-UpperBounds-05
FORMULA_NAME FireWire-PT-18-UpperBounds-06
FORMULA_NAME FireWire-PT-18-UpperBounds-07
FORMULA_NAME FireWire-PT-18-UpperBounds-08
FORMULA_NAME FireWire-PT-18-UpperBounds-09
FORMULA_NAME FireWire-PT-18-UpperBounds-10
FORMULA_NAME FireWire-PT-18-UpperBounds-11
FORMULA_NAME FireWire-PT-18-UpperBounds-12
FORMULA_NAME FireWire-PT-18-UpperBounds-13
FORMULA_NAME FireWire-PT-18-UpperBounds-14
FORMULA_NAME FireWire-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717357516192

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:45:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:45:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:45:17] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-02 19:45:17] [INFO ] Transformed 437 places.
[2024-06-02 19:45:17] [INFO ] Transformed 707 transitions.
[2024-06-02 19:45:17] [INFO ] Found NUPN structural information;
[2024-06-02 19:45:17] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 707 rows 437 cols
[2024-06-02 19:45:17] [INFO ] Computed 9 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120000 steps (45 resets) in 227 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:45:17] [INFO ] Invariant cache hit.
[2024-06-02 19:45:18] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2024-06-02 19:45:18] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 13 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:45:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:45:18] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-06-02 19:45:19] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-06-02 19:45:19] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 61 ms.
[2024-06-02 19:45:23] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:45:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-02 19:45:23] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 19:45:23] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 3 ms to minimize.
[2024-06-02 19:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:45:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:45:24] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 3 ms to minimize.
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 3 ms to minimize.
[2024-06-02 19:45:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 573 ms
[2024-06-02 19:45:25] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 41 ms.
[2024-06-02 19:45:29] [INFO ] Added : 450 causal constraints over 90 iterations in 4166 ms. Result :unknown
[2024-06-02 19:45:29] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:45:29] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-02 19:45:29] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 45 ms.
[2024-06-02 19:45:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:45:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:45:29] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-06-02 19:45:29] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 39 ms.
[2024-06-02 19:45:34] [INFO ] Added : 463 causal constraints over 93 iterations in 4504 ms. Result :sat
Minimization took 238 ms.
[2024-06-02 19:45:34] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:45:34] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-06-02 19:45:35] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:45:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:45:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:45:35] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-06-02 19:45:35] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 3 ms to minimize.
[2024-06-02 19:45:35] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-06-02 19:45:35] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 3 ms to minimize.
[2024-06-02 19:45:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 548 ms
[2024-06-02 19:45:36] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 39 ms.
[2024-06-02 19:45:40] [INFO ] Added : 465 causal constraints over 93 iterations in 4211 ms. Result :unknown
[2024-06-02 19:45:40] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:45:40] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-02 19:45:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:45:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:45:40] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-02 19:45:40] [INFO ] Deduced a trap composed of 247 places in 176 ms of which 3 ms to minimize.
[2024-06-02 19:45:41] [INFO ] Deduced a trap composed of 204 places in 151 ms of which 3 ms to minimize.
[2024-06-02 19:45:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2024-06-02 19:45:41] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 35 ms.
[2024-06-02 19:45:45] [INFO ] Added : 460 causal constraints over 92 iterations in 4310 ms. Result :unknown
[2024-06-02 19:45:45] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:45:45] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-06-02 19:45:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:45:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:45:45] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-06-02 19:45:46] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 3 ms to minimize.
[2024-06-02 19:45:46] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-06-02 19:45:46] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 3 ms to minimize.
[2024-06-02 19:45:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 501 ms
[2024-06-02 19:45:46] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 34 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-02 19:45:50] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:45:51] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-06-02 19:45:51] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 3 ms to minimize.
[2024-06-02 19:45:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:45:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:45:51] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-06-02 19:45:51] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 2 ms to minimize.
[2024-06-02 19:45:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-06-02 19:45:51] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 38 ms.
[2024-06-02 19:45:56] [INFO ] Added : 464 causal constraints over 94 iterations in 4599 ms. Result :unknown
[2024-06-02 19:45:56] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:45:56] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-06-02 19:45:56] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-06-02 19:45:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:45:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:45:57] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-06-02 19:45:57] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:45:57] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
[2024-06-02 19:45:57] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 3 ms to minimize.
[2024-06-02 19:45:57] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:45:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 665 ms
[2024-06-02 19:45:57] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 34 ms.
[2024-06-02 19:46:01] [INFO ] Added : 460 causal constraints over 92 iterations in 4088 ms. Result :unknown
[2024-06-02 19:46:01] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:46:02] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-06-02 19:46:02] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-06-02 19:46:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:46:02] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-06-02 19:46:02] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-06-02 19:46:02] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 2 ms to minimize.
[2024-06-02 19:46:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2024-06-02 19:46:02] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 38 ms.
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 128 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-06-02 19:46:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-02 19:46:07] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:46:07] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-06-02 19:46:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:46:07] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 4 ms to minimize.
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 2 ms to minimize.
[2024-06-02 19:46:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 516 ms
[2024-06-02 19:46:08] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 35 ms.
[2024-06-02 19:46:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-02 19:46:12] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:46:12] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-06-02 19:46:13] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-06-02 19:46:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:46:13] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-06-02 19:46:13] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2024-06-02 19:46:13] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 2 ms to minimize.
[2024-06-02 19:46:13] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 5 ms to minimize.
[2024-06-02 19:46:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 486 ms
[2024-06-02 19:46:13] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 35 ms.
[2024-06-02 19:46:17] [INFO ] Added : 442 causal constraints over 89 iterations in 4082 ms. Result :sat
Minimization took 197 ms.
[2024-06-02 19:46:18] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:46:18] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-02 19:46:18] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-06-02 19:46:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:46:18] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-06-02 19:46:19] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-06-02 19:46:19] [INFO ] Deduced a trap composed of 183 places in 141 ms of which 2 ms to minimize.
[2024-06-02 19:46:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2024-06-02 19:46:19] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 39 ms.
[2024-06-02 19:46:23] [INFO ] Added : 460 causal constraints over 92 iterations in 4425 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 314 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 4 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 418 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 418 transition count 609
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 334 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 333 transition count 607
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 174 place count 333 transition count 596
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 196 place count 322 transition count 596
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 255 place count 263 transition count 533
Iterating global reduction 3 with 59 rules applied. Total rules applied 314 place count 263 transition count 533
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 316 place count 263 transition count 531
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 316 place count 263 transition count 527
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 324 place count 259 transition count 527
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 340 place count 243 transition count 450
Iterating global reduction 4 with 16 rules applied. Total rules applied 356 place count 243 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 358 place count 243 transition count 448
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 363 place count 238 transition count 439
Iterating global reduction 5 with 5 rules applied. Total rules applied 368 place count 238 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 370 place count 238 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 371 place count 237 transition count 437
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 373 place count 235 transition count 431
Iterating global reduction 7 with 2 rules applied. Total rules applied 375 place count 235 transition count 431
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 377 place count 233 transition count 427
Iterating global reduction 7 with 2 rules applied. Total rules applied 379 place count 233 transition count 427
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 381 place count 231 transition count 421
Iterating global reduction 7 with 2 rules applied. Total rules applied 383 place count 231 transition count 421
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 385 place count 229 transition count 417
Iterating global reduction 7 with 2 rules applied. Total rules applied 387 place count 229 transition count 417
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 389 place count 227 transition count 411
Iterating global reduction 7 with 2 rules applied. Total rules applied 391 place count 227 transition count 411
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 393 place count 225 transition count 407
Iterating global reduction 7 with 2 rules applied. Total rules applied 395 place count 225 transition count 407
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 397 place count 223 transition count 401
Iterating global reduction 7 with 2 rules applied. Total rules applied 399 place count 223 transition count 401
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 401 place count 221 transition count 397
Iterating global reduction 7 with 2 rules applied. Total rules applied 403 place count 221 transition count 397
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 405 place count 219 transition count 391
Iterating global reduction 7 with 2 rules applied. Total rules applied 407 place count 219 transition count 391
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 409 place count 217 transition count 387
Iterating global reduction 7 with 2 rules applied. Total rules applied 411 place count 217 transition count 387
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 413 place count 215 transition count 383
Iterating global reduction 7 with 2 rules applied. Total rules applied 415 place count 215 transition count 383
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 417 place count 213 transition count 379
Iterating global reduction 7 with 2 rules applied. Total rules applied 419 place count 213 transition count 379
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 489 place count 178 transition count 344
Performed 29 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 547 place count 149 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 549 place count 149 transition count 403
Free-agglomeration rule applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 567 place count 149 transition count 385
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 590 place count 131 transition count 380
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 594 place count 127 transition count 376
Iterating global reduction 8 with 4 rules applied. Total rules applied 598 place count 127 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 604 place count 127 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 621 place count 127 transition count 353
Applied a total of 621 rules in 232 ms. Remains 127 /437 variables (removed 310) and now considering 353/707 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 127/437 places, 353/707 transitions.
[2024-06-02 19:46:25] [INFO ] Flow matrix only has 347 transitions (discarded 6 similar events)
// Phase 1: matrix 347 rows 127 cols
[2024-06-02 19:46:25] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (49798 resets) in 1394 ms. (716 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (49673 resets) in 1751 ms. (2283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 19:46:29] [INFO ] Flow matrix only has 347 transitions (discarded 6 similar events)
[2024-06-02 19:46:29] [INFO ] Invariant cache hit.
[2024-06-02 19:46:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:29] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 19:46:29] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 19:46:29] [INFO ] [Real]Added 63 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:46:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:46:29] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 19:46:29] [INFO ] [Nat]Added 63 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:46:29] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-06-02 19:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 19:46:29] [INFO ] Computed and/alt/rep : 155/858/155 causal constraints (skipped 188 transitions) in 19 ms.
[2024-06-02 19:46:29] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:46:29] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:46:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2024-06-02 19:46:29] [INFO ] Added : 46 causal constraints over 10 iterations in 406 ms. Result :sat
Minimization took 199 ms.
[2024-06-02 19:46:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:30] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 19:46:30] [INFO ] [Real]Added 63 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:46:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:30] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 19:46:30] [INFO ] [Nat]Added 63 Read/Feed constraints in 24 ms returned sat
[2024-06-02 19:46:30] [INFO ] Computed and/alt/rep : 155/858/155 causal constraints (skipped 188 transitions) in 23 ms.
[2024-06-02 19:46:30] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:46:30] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:46:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2024-06-02 19:46:30] [INFO ] Added : 35 causal constraints over 8 iterations in 342 ms. Result :sat
Minimization took 196 ms.
[2024-06-02 19:46:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:30] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 19:46:30] [INFO ] [Real]Added 63 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:46:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:31] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 19:46:31] [INFO ] [Nat]Added 63 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:46:31] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-02 19:46:31] [INFO ] Computed and/alt/rep : 155/858/155 causal constraints (skipped 188 transitions) in 18 ms.
[2024-06-02 19:46:31] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:46:31] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:46:31] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:46:31] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:46:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 353 ms
[2024-06-02 19:46:31] [INFO ] Added : 50 causal constraints over 13 iterations in 630 ms. Result :sat
Minimization took 213 ms.
[2024-06-02 19:46:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:32] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 19:46:32] [INFO ] [Real]Added 63 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:46:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:32] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 19:46:32] [INFO ] [Nat]Added 63 Read/Feed constraints in 27 ms returned sat
[2024-06-02 19:46:32] [INFO ] Computed and/alt/rep : 155/858/155 causal constraints (skipped 188 transitions) in 19 ms.
[2024-06-02 19:46:32] [INFO ] Added : 42 causal constraints over 10 iterations in 213 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 353/353 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 127 transition count 351
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 126 transition count 351
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 124 transition count 349
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 124 transition count 349
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 123 transition count 348
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 122 transition count 344
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 122 transition count 344
Applied a total of 16 rules in 32 ms. Remains 122 /127 variables (removed 5) and now considering 344/353 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 122/127 places, 344/353 transitions.
[2024-06-02 19:46:32] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
// Phase 1: matrix 338 rows 122 cols
[2024-06-02 19:46:32] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (49815 resets) in 1210 ms. (825 steps per ms)
BEST_FIRST walk for 4000003 steps (49741 resets) in 1694 ms. (2359 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 19:46:35] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
[2024-06-02 19:46:35] [INFO ] Invariant cache hit.
[2024-06-02 19:46:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:35] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 19:46:35] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 19:46:35] [INFO ] [Real]Added 62 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:46:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:46:35] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 19:46:35] [INFO ] [Nat]Added 62 Read/Feed constraints in 31 ms returned sat
[2024-06-02 19:46:36] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-06-02 19:46:36] [INFO ] Computed and/alt/rep : 146/837/146 causal constraints (skipped 188 transitions) in 17 ms.
[2024-06-02 19:46:36] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 19:46:36] [INFO ] Added : 27 causal constraints over 6 iterations in 213 ms. Result :sat
Minimization took 115 ms.
[2024-06-02 19:46:36] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:36] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 19:46:36] [INFO ] [Real]Added 62 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:46:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:36] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 19:46:36] [INFO ] [Nat]Added 62 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:46:36] [INFO ] Computed and/alt/rep : 146/837/146 causal constraints (skipped 188 transitions) in 18 ms.
[2024-06-02 19:46:36] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:46:37] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:46:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2024-06-02 19:46:37] [INFO ] Added : 42 causal constraints over 11 iterations in 418 ms. Result :sat
Minimization took 127 ms.
[2024-06-02 19:46:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:37] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 19:46:37] [INFO ] [Real]Added 62 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:46:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:37] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 19:46:37] [INFO ] [Nat]Added 62 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:46:37] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:46:37] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:46:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-06-02 19:46:37] [INFO ] Computed and/alt/rep : 146/837/146 causal constraints (skipped 188 transitions) in 24 ms.
[2024-06-02 19:46:37] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:46:37] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:46:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2024-06-02 19:46:37] [INFO ] Added : 28 causal constraints over 7 iterations in 331 ms. Result :sat
Minimization took 122 ms.
[2024-06-02 19:46:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:46:38] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 19:46:38] [INFO ] [Real]Added 62 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:46:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:46:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:46:38] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 19:46:38] [INFO ] [Nat]Added 62 Read/Feed constraints in 35 ms returned sat
[2024-06-02 19:46:38] [INFO ] Computed and/alt/rep : 146/837/146 causal constraints (skipped 188 transitions) in 19 ms.
[2024-06-02 19:46:38] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:46:38] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:46:38] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:46:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2024-06-02 19:46:38] [INFO ] Added : 32 causal constraints over 10 iterations in 453 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 344/344 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 122/122 places, 344/344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 344/344 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2024-06-02 19:46:38] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
[2024-06-02 19:46:38] [INFO ] Invariant cache hit.
[2024-06-02 19:46:39] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 19:46:39] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
[2024-06-02 19:46:39] [INFO ] Invariant cache hit.
[2024-06-02 19:46:39] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 19:46:39] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-02 19:46:39] [INFO ] Redundant transitions in 19 ms returned []
Running 340 sub problems to find dead transitions.
[2024-06-02 19:46:39] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
[2024-06-02 19:46:39] [INFO ] Invariant cache hit.
[2024-06-02 19:46:39] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-02 19:46:41] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:46:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:46:41] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:46:41] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:46:42] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:46:42] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 338/460 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 62/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 197 constraints, problems are : Problem set: 0 solved, 340 unsolved in 10006 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 338/460 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 62/197 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 340/537 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-02 19:46:55] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-02 19:47:12] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/460 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 539 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 8/8 constraints]
After SMT, in 40389ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 40401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40785 ms. Remains : 122/122 places, 344/344 transitions.
RANDOM walk for 40000 steps (1999 resets) in 1123 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (519 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (498 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (499 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (493 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (488 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (501 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (491 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (493 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 572132 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :4 out of 8
Probabilistic random walk after 572132 steps, saw 158787 distinct states, run finished after 3006 ms. (steps per millisecond=190 ) properties seen :4
[2024-06-02 19:47:23] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
[2024-06-02 19:47:23] [INFO ] Invariant cache hit.
[2024-06-02 19:47:23] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 71/114 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:47:23] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:47:23] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 338/452 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 62/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/460 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/460 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 193 constraints, problems are : Problem set: 0 solved, 4 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 71/114 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:47:23] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 338/452 variables, 114/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 62/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:47:24] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/460 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/460 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 199 constraints, problems are : Problem set: 0 solved, 4 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 413 ms.
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 344/344 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 118 transition count 337
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 118 transition count 337
Applied a total of 8 rules in 9 ms. Remains 118 /122 variables (removed 4) and now considering 337/344 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 118/122 places, 337/344 transitions.
RANDOM walk for 40000 steps (2016 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (489 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (499 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (483 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (482 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 609609 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 4
Probabilistic random walk after 609609 steps, saw 167551 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
[2024-06-02 19:47:28] [INFO ] Flow matrix only has 331 transitions (discarded 6 similar events)
// Phase 1: matrix 331 rows 118 cols
[2024-06-02 19:47:28] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:47:28] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 67/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 331/441 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 61/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/449 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/449 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 67/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:47:28] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:47:28] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 331/441 variables, 110/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 61/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/449 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/449 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 192 constraints, problems are : Problem set: 0 solved, 4 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 620ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 236 ms.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 337/337 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 337/337 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 118/118 places, 337/337 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 337/337 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 337/337 (removed 0) transitions.
[2024-06-02 19:47:28] [INFO ] Flow matrix only has 331 transitions (discarded 6 similar events)
[2024-06-02 19:47:28] [INFO ] Invariant cache hit.
[2024-06-02 19:47:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 19:47:28] [INFO ] Flow matrix only has 331 transitions (discarded 6 similar events)
[2024-06-02 19:47:28] [INFO ] Invariant cache hit.
[2024-06-02 19:47:29] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:47:29] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-02 19:47:29] [INFO ] Redundant transitions in 6 ms returned []
Running 333 sub problems to find dead transitions.
[2024-06-02 19:47:29] [INFO ] Flow matrix only has 331 transitions (discarded 6 similar events)
[2024-06-02 19:47:29] [INFO ] Invariant cache hit.
[2024-06-02 19:47:29] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 19:47:31] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:47:31] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:47:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:47:31] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:47:31] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:47:31] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 19:47:32] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 331/449 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 19:47:37] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (OVERLAPS) 0/449 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 194 constraints, problems are : Problem set: 0 solved, 333 unsolved in 14226 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 331/449 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 61/194 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 333/527 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 19:47:57] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/449 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 528 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 9/9 constraints]
After SMT, in 44523ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 44528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44847 ms. Remains : 118/118 places, 337/337 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 78 edges and 118 vertex of which 22 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 102 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 98 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 98 transition count 217
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 13 place count 98 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 97 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 97 transition count 194
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 97 transition count 191
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 94 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 94 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 93 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 92 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 92 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 91 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 90 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 90 transition count 161
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 90 transition count 158
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 54 place count 87 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 58 place count 87 transition count 153
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 87 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 85 transition count 151
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 66 place count 85 transition count 151
Applied a total of 66 rules in 34 ms. Remains 85 /118 variables (removed 33) and now considering 151/337 (removed 186) transitions.
Running SMT prover for 4 properties.
[2024-06-02 19:48:13] [INFO ] Flow matrix only has 149 transitions (discarded 2 similar events)
// Phase 1: matrix 149 rows 85 cols
[2024-06-02 19:48:13] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:48:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:48:13] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 19:48:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:48:13] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 19:48:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 19:48:13] [INFO ] After 18ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 19:48:13] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 19:48:14] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 285 ms.
FORMULA FireWire-PT-18-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for FireWire-PT-18-UpperBounds-00
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:48:14] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
// Phase 1: matrix 338 rows 122 cols
[2024-06-02 19:48:14] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (506 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (125 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:48:14] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
[2024-06-02 19:48:14] [INFO ] Invariant cache hit.
[2024-06-02 19:48:14] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:48:14] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 19:48:14] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 19:48:14] [INFO ] [Real]Added 62 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:48:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:48:14] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 19:48:14] [INFO ] [Nat]Added 62 Read/Feed constraints in 31 ms returned sat
[2024-06-02 19:48:14] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 19:48:14] [INFO ] Computed and/alt/rep : 146/837/146 causal constraints (skipped 188 transitions) in 22 ms.
[2024-06-02 19:48:14] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 19:48:14] [INFO ] Added : 27 causal constraints over 6 iterations in 249 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 122 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p338) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 342/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 341
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 0 with 4 rules applied. Total rules applied 6 place count 119 transition count 339
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 117 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 334
Applied a total of 10 rules in 11 ms. Remains 117 /122 variables (removed 5) and now considering 334/342 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 117/122 places, 334/342 transitions.
[2024-06-02 19:48:14] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
// Phase 1: matrix 328 rows 117 cols
[2024-06-02 19:48:14] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (49911 resets) in 1238 ms. (807 steps per ms)
BEST_FIRST walk for 1000001 steps (12450 resets) in 433 ms. (2304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:48:16] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:48:16] [INFO ] Invariant cache hit.
[2024-06-02 19:48:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:48:16] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 19:48:16] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:48:16] [INFO ] [Real]Added 61 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:48:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:48:16] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 19:48:16] [INFO ] [Nat]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:48:16] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-02 19:48:16] [INFO ] Computed and/alt/rep : 140/819/140 causal constraints (skipped 184 transitions) in 18 ms.
[2024-06-02 19:48:17] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-02 19:48:17] [INFO ] Added : 74 causal constraints over 16 iterations in 434 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 117/117 places, 334/334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-06-02 19:48:17] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:48:17] [INFO ] Invariant cache hit.
[2024-06-02 19:48:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:48:17] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:48:17] [INFO ] Invariant cache hit.
[2024-06-02 19:48:17] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:48:17] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-06-02 19:48:17] [INFO ] Redundant transitions in 5 ms returned []
Running 330 sub problems to find dead transitions.
[2024-06-02 19:48:17] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:48:17] [INFO ] Invariant cache hit.
[2024-06-02 19:48:17] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 2/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:48:19] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:48:19] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:48:19] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:48:19] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:48:19] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:48:19] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:48:20] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 328/445 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 192 constraints, problems are : Problem set: 0 solved, 330 unsolved in 9246 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 2/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 328/445 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 330/522 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 522 constraints, problems are : Problem set: 0 solved, 330 unsolved in 26188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 7/7 constraints]
After SMT, in 35696ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 35699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35958 ms. Remains : 117/117 places, 334/334 transitions.
RANDOM walk for 40000 steps (1999 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (485 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (483 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 841922 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 2
Probabilistic random walk after 841922 steps, saw 223576 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2024-06-02 19:48:56] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:48:56] [INFO ] Invariant cache hit.
[2024-06-02 19:48:56] [INFO ] State equation strengthened by 61 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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/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) 328/437 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 61/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/445 variables, 8/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/445 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 187 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/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) 328/437 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 61/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/445 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/445 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 514ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 117/117 places, 334/334 transitions.
RANDOM walk for 40000 steps (2015 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (504 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (487 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 793337 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 2
Probabilistic random walk after 793337 steps, saw 209472 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2024-06-02 19:49:00] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:49:00] [INFO ] Invariant cache hit.
[2024-06-02 19:49:00] [INFO ] State equation strengthened by 61 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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:49:00] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:49:00] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/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) 328/437 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 61/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/445 variables, 8/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/445 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 187 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/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) 328/437 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 61/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/445 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/445 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 117/117 places, 334/334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-06-02 19:49:00] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:49:00] [INFO ] Invariant cache hit.
[2024-06-02 19:49:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:49:00] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:49:00] [INFO ] Invariant cache hit.
[2024-06-02 19:49:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:49:00] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-06-02 19:49:00] [INFO ] Redundant transitions in 2 ms returned []
Running 330 sub problems to find dead transitions.
[2024-06-02 19:49:00] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:49:00] [INFO ] Invariant cache hit.
[2024-06-02 19:49:00] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 2/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:49:02] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:49:02] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:49:02] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:49:02] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:49:03] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:49:03] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:49:03] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 328/445 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 192 constraints, problems are : Problem set: 0 solved, 330 unsolved in 9303 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 2/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 328/445 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 330/522 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 522 constraints, problems are : Problem set: 0 solved, 330 unsolved in 25438 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 7/7 constraints]
After SMT, in 35023ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 35028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35299 ms. Remains : 117/117 places, 334/334 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 78 edges and 117 vertex of which 22 / 117 are part of one of the 4 SCC in 1 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 102 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 97 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 97 transition count 214
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 13 place count 97 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 96 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 96 transition count 191
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 96 transition count 188
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 93 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 93 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 92 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 91 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 91 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 90 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 89 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 89 transition count 159
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 89 transition count 156
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 54 place count 86 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 58 place count 86 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 86 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 84 transition count 149
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 66 place count 84 transition count 149
Applied a total of 66 rules in 42 ms. Remains 84 /117 variables (removed 33) and now considering 149/334 (removed 185) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:49:35] [INFO ] Flow matrix only has 147 transitions (discarded 2 similar events)
// Phase 1: matrix 147 rows 84 cols
[2024-06-02 19:49:35] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:49:35] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:49:36] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-02 19:49:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 19:49:36] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:49:36] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:49:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:49:36] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 19:49:36] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:49:36] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:49:36] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 236 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-18-UpperBounds-00 in 82123 ms.
Starting property specific reduction for FireWire-PT-18-UpperBounds-03
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:49:36] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
// Phase 1: matrix 338 rows 122 cols
[2024-06-02 19:49:36] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (504 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (124 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:49:36] [INFO ] Flow matrix only has 338 transitions (discarded 6 similar events)
[2024-06-02 19:49:36] [INFO ] Invariant cache hit.
[2024-06-02 19:49:36] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:49:36] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 19:49:36] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 19:49:36] [INFO ] [Real]Added 62 Read/Feed constraints in 19 ms returned sat
[2024-06-02 19:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:49:36] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-02 19:49:36] [INFO ] [Nat]Added 62 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:49:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2024-06-02 19:49:36] [INFO ] Computed and/alt/rep : 146/837/146 causal constraints (skipped 188 transitions) in 21 ms.
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:49:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2024-06-02 19:49:36] [INFO ] Added : 28 causal constraints over 7 iterations in 366 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 122 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p254) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 343/343 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 341
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 0 with 4 rules applied. Total rules applied 6 place count 119 transition count 339
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 117 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 334
Applied a total of 10 rules in 9 ms. Remains 117 /122 variables (removed 5) and now considering 334/343 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 117/122 places, 334/343 transitions.
[2024-06-02 19:49:37] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
// Phase 1: matrix 328 rows 117 cols
[2024-06-02 19:49:37] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (49885 resets) in 1247 ms. (801 steps per ms)
BEST_FIRST walk for 1000000 steps (12415 resets) in 445 ms. (2242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:49:38] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:49:38] [INFO ] Invariant cache hit.
[2024-06-02 19:49:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:49:38] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-02 19:49:38] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:49:38] [INFO ] [Real]Added 61 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:49:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:49:39] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 19:49:39] [INFO ] [Nat]Added 61 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2024-06-02 19:49:39] [INFO ] Computed and/alt/rep : 140/821/140 causal constraints (skipped 184 transitions) in 18 ms.
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-06-02 19:49:39] [INFO ] Added : 55 causal constraints over 14 iterations in 398 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 23 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 117/117 places, 334/334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-06-02 19:49:39] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:49:39] [INFO ] Invariant cache hit.
[2024-06-02 19:49:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 19:49:40] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:49:40] [INFO ] Invariant cache hit.
[2024-06-02 19:49:40] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:49:40] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-06-02 19:49:40] [INFO ] Redundant transitions in 2 ms returned []
Running 330 sub problems to find dead transitions.
[2024-06-02 19:49:40] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:49:40] [INFO ] Invariant cache hit.
[2024-06-02 19:49:40] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:49:43] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 328/444 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 1/445 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 10 (OVERLAPS) 0/445 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 193 constraints, problems are : Problem set: 0 solved, 330 unsolved in 12233 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 328/444 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 323/515 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 1/445 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 7/523 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 523 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 8/8 constraints]
After SMT, in 42507ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 42512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42811 ms. Remains : 117/117 places, 334/334 transitions.
RANDOM walk for 40000 steps (1965 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (486 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (506 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 936513 steps, run timeout after 3005 ms. (steps per millisecond=311 ) properties seen :0 out of 2
Probabilistic random walk after 936513 steps, saw 247778 distinct states, run finished after 3005 ms. (steps per millisecond=311 ) properties seen :0
[2024-06-02 19:50:25] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:50:25] [INFO ] Invariant cache hit.
[2024-06-02 19:50:25] [INFO ] State equation strengthened by 61 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/19 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 103/125 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:50:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 318/443 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 61/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/445 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/445 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 186 constraints, problems are : Problem set: 0 solved, 2 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/19 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 103/125 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 318/443 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 61/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:50:26] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/445 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/445 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/445 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 486ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 117/117 places, 334/334 transitions.
RANDOM walk for 40000 steps (1981 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (488 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (489 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 907634 steps, run timeout after 3002 ms. (steps per millisecond=302 ) properties seen :0 out of 2
Probabilistic random walk after 907634 steps, saw 238625 distinct states, run finished after 3003 ms. (steps per millisecond=302 ) properties seen :0
[2024-06-02 19:50:29] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:50:29] [INFO ] Invariant cache hit.
[2024-06-02 19:50:29] [INFO ] State equation strengthened by 61 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/19 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 103/125 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 318/443 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 61/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/445 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/445 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 186 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/19 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 103/125 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 318/443 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 61/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:50:30] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/445 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/445 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/445 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 510ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 117/117 places, 334/334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 334/334 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-06-02 19:50:30] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:50:30] [INFO ] Invariant cache hit.
[2024-06-02 19:50:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 19:50:30] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:50:30] [INFO ] Invariant cache hit.
[2024-06-02 19:50:30] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:50:30] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 19:50:30] [INFO ] Redundant transitions in 2 ms returned []
Running 330 sub problems to find dead transitions.
[2024-06-02 19:50:30] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 19:50:30] [INFO ] Invariant cache hit.
[2024-06-02 19:50:30] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 328/444 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 1/445 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 10 (OVERLAPS) 0/445 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 193 constraints, problems are : Problem set: 0 solved, 330 unsolved in 12431 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 328/444 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 323/515 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 1/445 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 7/523 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 523 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 8/8 constraints]
After SMT, in 42697ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 42701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42984 ms. Remains : 117/117 places, 334/334 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 78 edges and 117 vertex of which 22 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 102 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 97 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 97 transition count 214
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 13 place count 97 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 96 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 96 transition count 191
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 96 transition count 188
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 93 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 93 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 92 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 91 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 91 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 90 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 89 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 89 transition count 159
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 89 transition count 156
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 54 place count 86 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 58 place count 86 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 86 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 84 transition count 149
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 66 place count 84 transition count 149
Applied a total of 66 rules in 22 ms. Remains 84 /117 variables (removed 33) and now considering 149/334 (removed 185) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:51:13] [INFO ] Flow matrix only has 147 transitions (discarded 2 similar events)
// Phase 1: matrix 147 rows 84 cols
[2024-06-02 19:51:13] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 19:51:13] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:51:13] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-02 19:51:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 19:51:13] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:51:13] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:51:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:51:13] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 19:51:13] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:51:13] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:51:13] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 209 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-18-UpperBounds-03 in 97206 ms.
[2024-06-02 19:51:13] [INFO ] Flatten gal took : 61 ms
[2024-06-02 19:51:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-02 19:51:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 344 transitions and 1371 arcs took 4 ms.
Total runtime 356213 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 : FireWire-PT-18-UpperBounds-00
Could not compute solution for formula : FireWire-PT-18-UpperBounds-03

BK_STOP 1717357873794

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name FireWire-PT-18-UpperBounds-00
ub formula formula --maxsum=/tmp/1239/ub_0_
ub formula name FireWire-PT-18-UpperBounds-03
ub formula formula --maxsum=/tmp/1239/ub_1_
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="FireWire-PT-18"
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 FireWire-PT-18, 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 r553-tall-171734901400309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 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 ;