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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 247K 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-20-UpperBounds-00
FORMULA_NAME FireWire-PT-20-UpperBounds-01
FORMULA_NAME FireWire-PT-20-UpperBounds-02
FORMULA_NAME FireWire-PT-20-UpperBounds-03
FORMULA_NAME FireWire-PT-20-UpperBounds-04
FORMULA_NAME FireWire-PT-20-UpperBounds-05
FORMULA_NAME FireWire-PT-20-UpperBounds-06
FORMULA_NAME FireWire-PT-20-UpperBounds-07
FORMULA_NAME FireWire-PT-20-UpperBounds-08
FORMULA_NAME FireWire-PT-20-UpperBounds-09
FORMULA_NAME FireWire-PT-20-UpperBounds-10
FORMULA_NAME FireWire-PT-20-UpperBounds-11
FORMULA_NAME FireWire-PT-20-UpperBounds-12
FORMULA_NAME FireWire-PT-20-UpperBounds-13
FORMULA_NAME FireWire-PT-20-UpperBounds-14
FORMULA_NAME FireWire-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717358299162

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:58:20] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-02 19:58:20] [INFO ] Transformed 626 places.
[2024-06-02 19:58:20] [INFO ] Transformed 1031 transitions.
[2024-06-02 19:58:20] [INFO ] Found NUPN structural information;
[2024-06-02 19:58:20] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 1031 rows 626 cols
[2024-06-02 19:58:20] [INFO ] Computed 13 invariants in 19 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 (4 resets) in 62 ms. (158 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90002 steps (59 resets) in 155 ms. (576 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:58:20] [INFO ] Invariant cache hit.
[2024-06-02 19:58:21] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-06-02 19:58:21] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-06-02 19:58:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:58:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:58:21] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-06-02 19:58:22] [INFO ] Deduced a trap composed of 280 places in 273 ms of which 36 ms to minimize.
[2024-06-02 19:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2024-06-02 19:58:22] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 76 ms.
[2024-06-02 19:58:26] [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.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:58:26] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:58:26] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-06-02 19:58:27] [INFO ] Deduced a trap composed of 123 places in 219 ms of which 4 ms to minimize.
[2024-06-02 19:58:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:58:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-06-02 19:58:27] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-06-02 19:58:27] [INFO ] Deduced a trap composed of 123 places in 250 ms of which 4 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 78 places in 228 ms of which 4 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 117 places in 228 ms of which 4 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 98 places in 214 ms of which 4 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 133 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 133 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 132 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 4 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1695 ms
[2024-06-02 19:58:29] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 69 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-02 19:58:32] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:58:32] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-06-02 19:58:32] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 4 ms to minimize.
[2024-06-02 19:58:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:58:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:58:33] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-06-02 19:58:33] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 4 ms to minimize.
[2024-06-02 19:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2024-06-02 19:58:33] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 48 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-02 19:58:38] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:58:38] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-06-02 19:58:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:58:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-06-02 19:58:38] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-06-02 19:58:38] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 56 ms.
[2024-06-02 19:58:43] [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 3
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:58:43] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-06-02 19:58:43] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 4 ms to minimize.
[2024-06-02 19:58:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:58:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-02 19:58:44] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 4 ms to minimize.
[2024-06-02 19:58:45] [INFO ] Deduced a trap composed of 129 places in 237 ms of which 4 ms to minimize.
[2024-06-02 19:58:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 575 ms
[2024-06-02 19:58:45] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 56 ms.
[2024-06-02 19:58:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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:58:49] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:58:49] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-06-02 19:58:49] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 58 ms.
[2024-06-02 19:58:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:58:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-02 19:58:50] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-06-02 19:58:50] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 55 ms.
[2024-06-02 19:58:54] [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 5
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:58:54] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:58:55] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-06-02 19:58:55] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 57 ms.
[2024-06-02 19:58:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:58:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:58:55] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-06-02 19:58:55] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 56 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-02 19:59:00] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:59:00] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-06-02 19:59:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-02 19:59:01] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 129 places in 202 ms of which 4 ms to minimize.
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 3 ms to minimize.
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 70 places in 208 ms of which 3 ms to minimize.
[2024-06-02 19:59:02] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 4 ms to minimize.
[2024-06-02 19:59:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 986 ms
[2024-06-02 19:59:02] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 56 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-02 19:59:05] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:59:06] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-06-02 19:59:06] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 70 ms.
[2024-06-02 19:59:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:59:06] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-06-02 19:59:06] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 62 ms.
[2024-06-02 19:59:11] [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.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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
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 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Graph (trivial) has 446 edges and 626 vertex of which 12 / 626 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 1871 edges and 617 vertex of which 603 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.3 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 603 transition count 899
Reduce places removed 117 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 119 rules applied. Total rules applied 240 place count 486 transition count 897
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 485 transition count 896
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 484 transition count 896
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 243 place count 484 transition count 880
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 275 place count 468 transition count 880
Discarding 88 places :
Symmetric choice reduction at 4 with 88 rule applications. Total rules 363 place count 380 transition count 786
Iterating global reduction 4 with 88 rules applied. Total rules applied 451 place count 380 transition count 786
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 454 place count 380 transition count 783
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 454 place count 380 transition count 775
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 470 place count 372 transition count 775
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 499 place count 343 transition count 648
Iterating global reduction 5 with 29 rules applied. Total rules applied 528 place count 343 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 530 place count 343 transition count 646
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 537 place count 336 transition count 635
Iterating global reduction 6 with 7 rules applied. Total rules applied 544 place count 336 transition count 635
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 6 with 6 rules applied. Total rules applied 550 place count 336 transition count 629
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 553 place count 333 transition count 629
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 554 place count 332 transition count 626
Iterating global reduction 8 with 1 rules applied. Total rules applied 555 place count 332 transition count 626
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 556 place count 331 transition count 624
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 331 transition count 624
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 558 place count 330 transition count 621
Iterating global reduction 8 with 1 rules applied. Total rules applied 559 place count 330 transition count 621
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 560 place count 329 transition count 619
Iterating global reduction 8 with 1 rules applied. Total rules applied 561 place count 329 transition count 619
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 562 place count 328 transition count 616
Iterating global reduction 8 with 1 rules applied. Total rules applied 563 place count 328 transition count 616
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 564 place count 327 transition count 614
Iterating global reduction 8 with 1 rules applied. Total rules applied 565 place count 327 transition count 614
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 566 place count 326 transition count 611
Iterating global reduction 8 with 1 rules applied. Total rules applied 567 place count 326 transition count 611
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 568 place count 325 transition count 609
Iterating global reduction 8 with 1 rules applied. Total rules applied 569 place count 325 transition count 609
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 570 place count 324 transition count 606
Iterating global reduction 8 with 1 rules applied. Total rules applied 571 place count 324 transition count 606
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 572 place count 323 transition count 604
Iterating global reduction 8 with 1 rules applied. Total rules applied 573 place count 323 transition count 604
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 574 place count 322 transition count 602
Iterating global reduction 8 with 1 rules applied. Total rules applied 575 place count 322 transition count 602
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 576 place count 321 transition count 600
Iterating global reduction 8 with 1 rules applied. Total rules applied 577 place count 321 transition count 600
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 673 place count 273 transition count 552
Performed 43 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 759 place count 230 transition count 645
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 762 place count 230 transition count 642
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 785 place count 230 transition count 619
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 816 place count 207 transition count 611
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 822 place count 201 transition count 605
Iterating global reduction 9 with 6 rules applied. Total rules applied 828 place count 201 transition count 605
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 837 place count 201 transition count 596
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 863 place count 201 transition count 570
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 867 place count 201 transition count 570
Applied a total of 867 rules in 641 ms. Remains 201 /626 variables (removed 425) and now considering 570/1031 (removed 461) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 201/626 places, 570/1031 transitions.
[2024-06-02 19:59:12] [INFO ] Flow matrix only has 560 transitions (discarded 10 similar events)
// Phase 1: matrix 560 rows 201 cols
[2024-06-02 19:59:12] [INFO ] Computed 10 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 (33454 resets) in 2095 ms. (477 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000001 steps (19435 resets) in 1662 ms. (1803 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:59:15] [INFO ] Flow matrix only has 560 transitions (discarded 10 similar events)
[2024-06-02 19:59:15] [INFO ] Invariant cache hit.
[2024-06-02 19:59:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:59:16] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-06-02 19:59:16] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-02 19:59:16] [INFO ] [Real]Added 100 Read/Feed constraints in 45 ms returned sat
[2024-06-02 19:59:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-02 19:59:16] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-02 19:59:16] [INFO ] [Nat]Added 100 Read/Feed constraints in 78 ms returned sat
[2024-06-02 19:59:16] [INFO ] Computed and/alt/rep : 177/758/177 causal constraints (skipped 375 transitions) in 36 ms.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2024-06-02 19:59:17] [INFO ] Added : 29 causal constraints over 6 iterations in 532 ms. Result :sat
Minimization took 557 ms.
[2024-06-02 19:59:17] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:59:17] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-02 19:59:17] [INFO ] [Real]Added 100 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:59:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:59:17] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-02 19:59:17] [INFO ] [Nat]Added 100 Read/Feed constraints in 59 ms returned sat
[2024-06-02 19:59:18] [INFO ] Computed and/alt/rep : 177/758/177 causal constraints (skipped 375 transitions) in 51 ms.
[2024-06-02 19:59:18] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:59:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-06-02 19:59:18] [INFO ] Added : 34 causal constraints over 8 iterations in 473 ms. Result :sat
Minimization took 496 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 570/570 transitions.
Graph (complete) has 1007 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 200 transition count 566
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 197 transition count 566
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 2 with 2 rules applied. Total rules applied 10 place count 196 transition count 565
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 195 transition count 563
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 195 transition count 563
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 2 with 4 rules applied. Total rules applied 16 place count 193 transition count 565
Applied a total of 16 rules in 36 ms. Remains 193 /201 variables (removed 8) and now considering 565/570 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 193/201 places, 565/570 transitions.
[2024-06-02 19:59:19] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
// Phase 1: matrix 555 rows 193 cols
[2024-06-02 19:59:19] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (33507 resets) in 1881 ms. (531 steps per ms)
BEST_FIRST walk for 2000002 steps (13134 resets) in 1062 ms. (1881 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:59:22] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 19:59:22] [INFO ] Invariant cache hit.
[2024-06-02 19:59:22] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:59:22] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-02 19:59:22] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 19:59:22] [INFO ] [Real]Added 103 Read/Feed constraints in 43 ms returned sat
[2024-06-02 19:59:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:59:22] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-02 19:59:22] [INFO ] [Nat]Added 103 Read/Feed constraints in 67 ms returned sat
[2024-06-02 19:59:22] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-06-02 19:59:22] [INFO ] Computed and/alt/rep : 168/751/168 causal constraints (skipped 379 transitions) in 53 ms.
[2024-06-02 19:59:22] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-06-02 19:59:23] [INFO ] Added : 19 causal constraints over 5 iterations in 341 ms. Result :sat
Minimization took 485 ms.
[2024-06-02 19:59:23] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:59:23] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-02 19:59:23] [INFO ] [Real]Added 103 Read/Feed constraints in 33 ms returned sat
[2024-06-02 19:59:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:59:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:59:23] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-02 19:59:23] [INFO ] [Nat]Added 103 Read/Feed constraints in 56 ms returned sat
[2024-06-02 19:59:23] [INFO ] Computed and/alt/rep : 168/751/168 causal constraints (skipped 379 transitions) in 45 ms.
[2024-06-02 19:59:24] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:59:24] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:59:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2024-06-02 19:59:24] [INFO ] Added : 4 causal constraints over 3 iterations in 409 ms. Result :sat
Minimization took 445 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 565/565 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 193/193 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 565/565 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2024-06-02 19:59:24] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 19:59:24] [INFO ] Invariant cache hit.
[2024-06-02 19:59:25] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 19:59:25] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 19:59:25] [INFO ] Invariant cache hit.
[2024-06-02 19:59:25] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 19:59:25] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2024-06-02 19:59:25] [INFO ] Redundant transitions in 32 ms returned []
Running 557 sub problems to find dead transitions.
[2024-06-02 19:59:25] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 19:59:25] [INFO ] Invariant cache hit.
[2024-06-02 19:59:25] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-02 19:59:30] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:59:30] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:59:30] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:59:30] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:59:30] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:59:30] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:59:31] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:59:32] [INFO ] Deduced a trap composed of 146 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (OVERLAPS) 555/748 variables, 193/211 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 103/314 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 7 (OVERLAPS) 0/748 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 557 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/748 variables, and 314 constraints, problems are : Problem set: 0 solved, 557 unsolved in 24497 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (OVERLAPS) 555/748 variables, 193/211 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 103/314 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 557/871 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-02 20:00:05] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/748 variables, and 872 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 9/9 constraints]
After SMT, in 55418ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 55435ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56333 ms. Remains : 193/193 places, 565/565 transitions.
RANDOM walk for 40000 steps (1340 resets) in 1024 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (261 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (261 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (265 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (261 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 478031 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 4
Probabilistic random walk after 478031 steps, saw 148315 distinct states, run finished after 3004 ms. (steps per millisecond=159 ) properties seen :0
[2024-06-02 20:00:24] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 20:00:24] [INFO ] Invariant cache hit.
[2024-06-02 20:00:24] [INFO ] State equation strengthened by 103 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) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:00:24] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 123/181 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:00:25] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 555/736 variables, 181/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 103/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/748 variables, 12/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/748 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/748 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/748 variables, and 308 constraints, problems are : Problem set: 0 solved, 4 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 103/103 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) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 123/181 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:00:25] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 555/736 variables, 181/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 103/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/736 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/736 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 12/748 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/748 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/748 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 748/748 variables, and 313 constraints, problems are : Problem set: 0 solved, 4 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1024ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 334 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 565/565 transitions.
Applied a total of 0 rules in 20 ms. Remains 193 /193 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 193/193 places, 565/565 transitions.
RANDOM walk for 40000 steps (1314 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (264 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (255 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (275 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (258 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 463570 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 4
Probabilistic random walk after 463570 steps, saw 144340 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-06-02 20:00:29] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 20:00:29] [INFO ] Invariant cache hit.
[2024-06-02 20:00:29] [INFO ] State equation strengthened by 103 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) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:00:29] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 123/181 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:00:29] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 555/736 variables, 181/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 103/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/748 variables, 12/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/748 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/748 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/748 variables, and 308 constraints, problems are : Problem set: 0 solved, 4 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 103/103 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) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 123/181 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:00:30] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 555/736 variables, 181/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 103/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/736 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/736 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 12/748 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/748 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/748 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 748/748 variables, and 313 constraints, problems are : Problem set: 0 solved, 4 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1013ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 308 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 565/565 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 193/193 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 565/565 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2024-06-02 20:00:30] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 20:00:30] [INFO ] Invariant cache hit.
[2024-06-02 20:00:30] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 20:00:30] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 20:00:30] [INFO ] Invariant cache hit.
[2024-06-02 20:00:31] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 20:00:31] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2024-06-02 20:00:31] [INFO ] Redundant transitions in 13 ms returned []
Running 557 sub problems to find dead transitions.
[2024-06-02 20:00:31] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 20:00:31] [INFO ] Invariant cache hit.
[2024-06-02 20:00:31] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 1 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:00:37] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:00:38] [INFO ] Deduced a trap composed of 146 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (OVERLAPS) 555/748 variables, 193/211 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 103/314 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 7 (OVERLAPS) 0/748 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 557 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/748 variables, and 314 constraints, problems are : Problem set: 0 solved, 557 unsolved in 24713 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (OVERLAPS) 555/748 variables, 193/211 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 103/314 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 557/871 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-02 20:01:10] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/748 variables, and 872 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 9/9 constraints]
After SMT, in 55487ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 55494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56327 ms. Remains : 193/193 places, 565/565 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 124 edges and 193 vertex of which 31 / 193 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 151 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 176 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 164 transition count 386
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 164 transition count 386
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 20 place count 164 transition count 373
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 22 place count 163 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 46 place count 163 transition count 348
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 163 transition count 343
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 58 place count 158 transition count 341
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 158 transition count 339
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 156 transition count 339
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 64 place count 155 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 69 place count 155 transition count 333
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 71 place count 154 transition count 332
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 153 transition count 287
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 153 transition count 287
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 153 transition count 283
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 82 place count 149 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 88 place count 149 transition count 276
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 149 transition count 273
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 94 place count 146 transition count 273
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 100 place count 146 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 146 transition count 272
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 102 place count 145 transition count 271
Iterating global reduction 6 with 1 rules applied. Total rules applied 103 place count 145 transition count 271
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 104 place count 145 transition count 271
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 105 place count 144 transition count 269
Iterating global reduction 6 with 1 rules applied. Total rules applied 106 place count 144 transition count 269
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 107 place count 143 transition count 267
Iterating global reduction 6 with 1 rules applied. Total rules applied 108 place count 143 transition count 267
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 109 place count 142 transition count 265
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 142 transition count 265
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 111 place count 141 transition count 263
Iterating global reduction 6 with 1 rules applied. Total rules applied 112 place count 141 transition count 263
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 140 transition count 261
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 140 transition count 261
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 115 place count 139 transition count 259
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 139 transition count 259
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 117 place count 138 transition count 257
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 138 transition count 257
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 119 place count 137 transition count 255
Iterating global reduction 6 with 1 rules applied. Total rules applied 120 place count 137 transition count 255
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 121 place count 136 transition count 253
Iterating global reduction 6 with 1 rules applied. Total rules applied 122 place count 136 transition count 253
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 123 place count 135 transition count 251
Iterating global reduction 6 with 1 rules applied. Total rules applied 124 place count 135 transition count 251
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 125 place count 134 transition count 250
Iterating global reduction 6 with 1 rules applied. Total rules applied 126 place count 134 transition count 250
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 133 transition count 248
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 133 transition count 248
Applied a total of 128 rules in 139 ms. Remains 133 /193 variables (removed 60) and now considering 248/565 (removed 317) transitions.
Running SMT prover for 4 properties.
[2024-06-02 20:01:27] [INFO ] Flow matrix only has 244 transitions (discarded 4 similar events)
// Phase 1: matrix 244 rows 133 cols
[2024-06-02 20:01:27] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:01:27] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 20:01:27] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 20:01:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 20:01:27] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 20:01:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 20:01:27] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 20:01:27] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 1
[2024-06-02 20:01:27] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 20:01:27] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 623 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for FireWire-PT-20-UpperBounds-06
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 20:01:27] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
// Phase 1: matrix 555 rows 193 cols
[2024-06-02 20:01:27] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (334 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10000 steps (74 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 20:01:27] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 20:01:27] [INFO ] Invariant cache hit.
[2024-06-02 20:01:27] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-06-02 20:01:27] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-02 20:01:27] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 20:01:27] [INFO ] [Real]Added 103 Read/Feed constraints in 41 ms returned sat
[2024-06-02 20:01:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:01:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 20:01:28] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-02 20:01:28] [INFO ] [Nat]Added 103 Read/Feed constraints in 67 ms returned sat
[2024-06-02 20:01:28] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:01:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-06-02 20:01:28] [INFO ] Computed and/alt/rep : 168/751/168 causal constraints (skipped 379 transitions) in 33 ms.
[2024-06-02 20:01:28] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:01:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-06-02 20:01:28] [INFO ] Added : 19 causal constraints over 5 iterations in 332 ms. Result :sat
Minimization took 382 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 193 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p137) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 559/559 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 558
Applied a total of 2 rules in 12 ms. Remains 192 /193 variables (removed 1) and now considering 558/559 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 192/193 places, 558/559 transitions.
[2024-06-02 20:01:29] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
// Phase 1: matrix 548 rows 192 cols
[2024-06-02 20:01:29] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33488 resets) in 1868 ms. (535 steps per ms)
BEST_FIRST walk for 1000001 steps (6454 resets) in 550 ms. (1814 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 20:01:31] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:01:31] [INFO ] Invariant cache hit.
[2024-06-02 20:01:31] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 20:01:31] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-02 20:01:31] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-02 20:01:31] [INFO ] [Real]Added 101 Read/Feed constraints in 46 ms returned sat
[2024-06-02 20:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:01:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 20:01:31] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-02 20:01:31] [INFO ] [Nat]Added 101 Read/Feed constraints in 39 ms returned sat
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-06-02 20:01:32] [INFO ] Computed and/alt/rep : 163/735/163 causal constraints (skipped 377 transitions) in 34 ms.
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-06-02 20:01:32] [INFO ] Added : 16 causal constraints over 7 iterations in 420 ms. Result :sat
Minimization took 420 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 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 558/558 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 558/558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 558/558 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-06-02 20:01:32] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:01:32] [INFO ] Invariant cache hit.
[2024-06-02 20:01:33] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 20:01:33] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:01:33] [INFO ] Invariant cache hit.
[2024-06-02 20:01:33] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-02 20:01:33] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-06-02 20:01:33] [INFO ] Redundant transitions in 7 ms returned []
Running 550 sub problems to find dead transitions.
[2024-06-02 20:01:33] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:01:33] [INFO ] Invariant cache hit.
[2024-06-02 20:01:33] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 2/192 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:01:39] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:01:40] [INFO ] Deduced a trap composed of 146 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 548/740 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 101/311 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 7 (OVERLAPS) 0/740 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 550 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 311 constraints, problems are : Problem set: 0 solved, 550 unsolved in 23569 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 2/192 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 548/740 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 101/311 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 550/861 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-02 20:02:12] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/740 variables, and 862 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 9/9 constraints]
After SMT, in 54270ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 54275ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55027 ms. Remains : 192/192 places, 558/558 transitions.
RANDOM walk for 40000 steps (1329 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (261 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (261 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 638603 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 2
Probabilistic random walk after 638603 steps, saw 193905 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
[2024-06-02 20:02:31] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:02:31] [INFO ] Invariant cache hit.
[2024-06-02 20:02:31] [INFO ] State equation strengthened by 101 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 127/180 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:02:31] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-06-02 20:02:31] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:02:31] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:02:31] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 548/728 variables, 180/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 101/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/740 variables, 12/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/740 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 127/180 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:02:31] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 548/728 variables, 180/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 101/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/728 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/728 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/740 variables, 12/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/740 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/740 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1029ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 558/558 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 192/192 places, 558/558 transitions.
RANDOM walk for 40000 steps (1363 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (253 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (258 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 643070 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 2
Probabilistic random walk after 643070 steps, saw 195448 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2024-06-02 20:02:35] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:02:35] [INFO ] Invariant cache hit.
[2024-06-02 20:02:35] [INFO ] State equation strengthened by 101 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 127/180 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:02:35] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:02:35] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:02:35] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:02:35] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 548/728 variables, 180/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 101/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/740 variables, 12/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/740 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 127/180 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:02:35] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 548/728 variables, 180/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 101/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/728 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/728 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/740 variables, 12/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/740 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/740 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 984ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 558/558 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 558/558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 558/558 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-06-02 20:02:36] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:02:36] [INFO ] Invariant cache hit.
[2024-06-02 20:02:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 20:02:36] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:02:36] [INFO ] Invariant cache hit.
[2024-06-02 20:02:36] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-02 20:02:37] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-06-02 20:02:37] [INFO ] Redundant transitions in 6 ms returned []
Running 550 sub problems to find dead transitions.
[2024-06-02 20:02:37] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-06-02 20:02:37] [INFO ] Invariant cache hit.
[2024-06-02 20:02:37] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 2/192 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-02 20:02:41] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:02:41] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:02:41] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:02:41] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:02:41] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:02:41] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:02:42] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-02 20:02:43] [INFO ] Deduced a trap composed of 146 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 548/740 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 101/311 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 7 (OVERLAPS) 0/740 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 550 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 311 constraints, problems are : Problem set: 0 solved, 550 unsolved in 23908 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 2/192 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 548/740 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 101/311 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 550/861 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-02 20:03:15] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/740 variables, and 862 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 9/9 constraints]
After SMT, in 54631ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 54637ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55415 ms. Remains : 192/192 places, 558/558 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 124 edges and 192 vertex of which 31 / 192 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 151 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 176 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 163 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 163 transition count 379
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 20 place count 163 transition count 366
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 22 place count 162 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 1 with 23 rules applied. Total rules applied 45 place count 162 transition count 342
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 162 transition count 337
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 57 place count 157 transition count 335
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 57 place count 157 transition count 333
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 155 transition count 333
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 63 place count 154 transition count 332
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 66 place count 154 transition count 329
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 68 place count 153 transition count 328
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 152 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 152 transition count 284
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 152 transition count 280
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 79 place count 148 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 148 transition count 273
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 88 place count 148 transition count 270
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 91 place count 145 transition count 270
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 97 place count 145 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 145 transition count 269
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 99 place count 144 transition count 268
Iterating global reduction 6 with 1 rules applied. Total rules applied 100 place count 144 transition count 268
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 101 place count 144 transition count 268
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 102 place count 143 transition count 266
Iterating global reduction 6 with 1 rules applied. Total rules applied 103 place count 143 transition count 266
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 104 place count 142 transition count 264
Iterating global reduction 6 with 1 rules applied. Total rules applied 105 place count 142 transition count 264
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 106 place count 141 transition count 262
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 141 transition count 262
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 108 place count 140 transition count 260
Iterating global reduction 6 with 1 rules applied. Total rules applied 109 place count 140 transition count 260
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 110 place count 139 transition count 258
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 139 transition count 258
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 112 place count 138 transition count 256
Iterating global reduction 6 with 1 rules applied. Total rules applied 113 place count 138 transition count 256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 114 place count 137 transition count 254
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 137 transition count 254
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 116 place count 136 transition count 252
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 136 transition count 252
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 118 place count 135 transition count 250
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 135 transition count 250
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 120 place count 134 transition count 248
Iterating global reduction 6 with 1 rules applied. Total rules applied 121 place count 134 transition count 248
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 122 place count 133 transition count 247
Iterating global reduction 6 with 1 rules applied. Total rules applied 123 place count 133 transition count 247
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 124 place count 132 transition count 245
Iterating global reduction 6 with 1 rules applied. Total rules applied 125 place count 132 transition count 245
Applied a total of 125 rules in 111 ms. Remains 132 /192 variables (removed 60) and now considering 245/558 (removed 313) transitions.
Running SMT prover for 2 properties.
[2024-06-02 20:03:31] [INFO ] Flow matrix only has 241 transitions (discarded 4 similar events)
// Phase 1: matrix 241 rows 132 cols
[2024-06-02 20:03:31] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:03:31] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 20:03:31] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-02 20:03:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 20:03:31] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:03:31] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:03:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-02 20:03:32] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:03:32] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 20:03:32] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 20:03:32] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 413 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-20-UpperBounds-06 in 124380 ms.
Starting property specific reduction for FireWire-PT-20-UpperBounds-15
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 20:03:32] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
// Phase 1: matrix 555 rows 193 cols
[2024-06-02 20:03:32] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (332 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (63 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 20:03:32] [INFO ] Flow matrix only has 555 transitions (discarded 10 similar events)
[2024-06-02 20:03:32] [INFO ] Invariant cache hit.
[2024-06-02 20:03:32] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 20:03:32] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-06-02 20:03:32] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 20:03:32] [INFO ] [Real]Added 103 Read/Feed constraints in 33 ms returned sat
[2024-06-02 20:03:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:03:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 20:03:32] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-02 20:03:32] [INFO ] [Nat]Added 103 Read/Feed constraints in 57 ms returned sat
[2024-06-02 20:03:32] [INFO ] Computed and/alt/rep : 168/751/168 causal constraints (skipped 379 transitions) in 36 ms.
[2024-06-02 20:03:32] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:03:32] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:03:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2024-06-02 20:03:32] [INFO ] Added : 4 causal constraints over 3 iterations in 413 ms. Result :sat
Minimization took 392 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 193 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p110) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 564/564 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 191 transition count 556
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 191 transition count 556
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 190 transition count 553
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 190 transition count 553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 189 transition count 551
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 189 transition count 551
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 188 transition count 548
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 188 transition count 548
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 187 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 187 transition count 546
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 186 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 186 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 185 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 185 transition count 541
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 184 transition count 538
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 184 transition count 538
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 183 transition count 536
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 183 transition count 536
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 182 transition count 534
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 182 transition count 534
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 181 transition count 532
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 181 transition count 532
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 181 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 180 transition count 531
Applied a total of 26 rules in 33 ms. Remains 180 /193 variables (removed 13) and now considering 531/564 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 180/193 places, 531/564 transitions.
[2024-06-02 20:03:33] [INFO ] Flow matrix only has 521 transitions (discarded 10 similar events)
// Phase 1: matrix 521 rows 180 cols
[2024-06-02 20:03:33] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34591 resets) in 1782 ms. (560 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (6923 resets) in 528 ms. (1890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FireWire-PT-20-UpperBounds-15 in 3678 ms.
[2024-06-02 20:03:36] [INFO ] Flatten gal took : 100 ms
[2024-06-02 20:03:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-02 20:03:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 565 transitions and 2308 arcs took 10 ms.
Total runtime 315852 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-20-UpperBounds-06

BK_STOP 1717358616358

--------------------
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-20-UpperBounds-06
ub formula formula --maxsum=/tmp/994/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-20"
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-20, 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-171734901400325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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