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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717371452929

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 23:37:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:37:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:37:34] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 23:37:34] [INFO ] Transformed 437 places.
[2024-06-02 23:37:34] [INFO ] Transformed 707 transitions.
[2024-06-02 23:37:34] [INFO ] Found NUPN structural information;
[2024-06-02 23:37:34] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 707 rows 437 cols
[2024-06-02 23:37:34] [INFO ] Computed 9 invariants in 28 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :3
FORMULA FireWire-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :1
FORMULA FireWire-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
[2024-06-02 23:37:35] [INFO ] Invariant cache hit.
[2024-06-02 23:37:35] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-06-02 23:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:35] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-06-02 23:37:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:37:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:35] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-02 23:37:36] [INFO ] Deduced a trap composed of 118 places in 270 ms of which 4 ms to minimize.
[2024-06-02 23:37:36] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 1 ms to minimize.
[2024-06-02 23:37:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 542 ms
[2024-06-02 23:37:36] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 52 ms.
[2024-06-02 23:37:39] [INFO ] Added : 377 causal constraints over 76 iterations in 3391 ms. Result :sat
Minimization took 306 ms.
[2024-06-02 23:37:40] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 23:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:40] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-06-02 23:37:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:37:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:40] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-02 23:37:40] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2024-06-02 23:37:40] [INFO ] Deduced a trap composed of 117 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:37:41] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 1 ms to minimize.
[2024-06-02 23:37:41] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 0 ms to minimize.
[2024-06-02 23:37:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 803 ms
[2024-06-02 23:37:41] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 41 ms.
[2024-06-02 23:37:45] [INFO ] Added : 445 causal constraints over 89 iterations in 3954 ms. Result :unknown
[2024-06-02 23:37:45] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:45] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-06-02 23:37:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:37:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:37:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:45] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-02 23:37:46] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 0 ms to minimize.
[2024-06-02 23:37:46] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2024-06-02 23:37:46] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 1 ms to minimize.
[2024-06-02 23:37:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 547 ms
[2024-06-02 23:37:46] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 36 ms.
[2024-06-02 23:37:50] [INFO ] Added : 455 causal constraints over 91 iterations in 4217 ms. Result :unknown
[2024-06-02 23:37:50] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 23:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:50] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-06-02 23:37:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:37:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:51] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-06-02 23:37:51] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 1 ms to minimize.
[2024-06-02 23:37:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2024-06-02 23:37:51] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 35 ms.
[2024-06-02 23:37:55] [INFO ] Added : 466 causal constraints over 94 iterations in 4597 ms. Result :sat
Minimization took 2 ms.
[2024-06-02 23:37:56] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 23:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:56] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-06-02 23:37:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:37:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:37:56] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-06-02 23:37:56] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 0 ms to minimize.
[2024-06-02 23:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-06-02 23:37:56] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 46 ms.
[2024-06-02 23:38:01] [INFO ] Deduced a trap composed of 131 places in 85 ms of which 7 ms to minimize.
[2024-06-02 23:38:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-02 23:38:01] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:01] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-06-02 23:38:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:01] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-06-02 23:38:01] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 1 ms to minimize.
[2024-06-02 23:38:02] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 1 ms to minimize.
[2024-06-02 23:38:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2024-06-02 23:38:02] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 33 ms.
[2024-06-02 23:38:06] [INFO ] Added : 470 causal constraints over 94 iterations in 4367 ms. Result :unknown
[2024-06-02 23:38:06] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:06] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-06-02 23:38:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:06] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-06-02 23:38:07] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 0 ms to minimize.
[2024-06-02 23:38:07] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 1 ms to minimize.
[2024-06-02 23:38:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2024-06-02 23:38:07] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 33 ms.
[2024-06-02 23:38:11] [INFO ] Added : 423 causal constraints over 86 iterations in 3866 ms. Result :sat
Minimization took 354 ms.
[2024-06-02 23:38:11] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 23:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:11] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-06-02 23:38:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:12] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-02 23:38:12] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 0 ms to minimize.
[2024-06-02 23:38:12] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 0 ms to minimize.
[2024-06-02 23:38:12] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 1 ms to minimize.
[2024-06-02 23:38:12] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 1 ms to minimize.
[2024-06-02 23:38:12] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 0 ms to minimize.
[2024-06-02 23:38:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 860 ms
[2024-06-02 23:38:13] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 37 ms.
[2024-06-02 23:38:17] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:38:17] [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 7
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-02 23:38:17] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 23:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:17] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-06-02 23:38:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:17] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-02 23:38:17] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2024-06-02 23:38:17] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 0 ms to minimize.
[2024-06-02 23:38:18] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 0 ms to minimize.
[2024-06-02 23:38:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 534 ms
[2024-06-02 23:38:18] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 33 ms.
[2024-06-02 23:38:21] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 1 ms to minimize.
[2024-06-02 23:38:21] [INFO ] Deduced a trap composed of 119 places in 71 ms of which 0 ms to minimize.
[2024-06-02 23:38:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2024-06-02 23:38:21] [INFO ] Added : 406 causal constraints over 82 iterations in 3917 ms. Result :sat
Minimization took 299 ms.
[2024-06-02 23:38:22] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 23:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:22] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-06-02 23:38:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:22] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-06-02 23:38:23] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 0 ms to minimize.
[2024-06-02 23:38:23] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 1 ms to minimize.
[2024-06-02 23:38:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2024-06-02 23:38:23] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 36 ms.
[2024-06-02 23:38:27] [INFO ] Added : 468 causal constraints over 94 iterations in 4375 ms. Result :unknown
[2024-06-02 23:38:27] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 23:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:27] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-02 23:38:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:28] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-06-02 23:38:28] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 0 ms to minimize.
[2024-06-02 23:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-06-02 23:38:28] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 33 ms.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 103 places in 169 ms of which 1 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:38:32] [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 10
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-02 23:38:33] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:33] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-06-02 23:38:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:33] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-06-02 23:38:33] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 1 ms to minimize.
[2024-06-02 23:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-06-02 23:38:33] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 37 ms.
[2024-06-02 23:38:37] [INFO ] Added : 460 causal constraints over 92 iterations in 4267 ms. Result :sat
Minimization took 328 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FireWire-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 309 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 4 ms
Free SCC test removed 9 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 418 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 418 transition count 612
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 337 transition count 610
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 169 place count 336 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 335 transition count 609
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 170 place count 335 transition count 598
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 192 place count 324 transition count 598
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 251 place count 265 transition count 535
Iterating global reduction 4 with 59 rules applied. Total rules applied 310 place count 265 transition count 535
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 312 place count 265 transition count 533
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 312 place count 265 transition count 529
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 320 place count 261 transition count 529
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 336 place count 245 transition count 452
Iterating global reduction 5 with 16 rules applied. Total rules applied 352 place count 245 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 354 place count 245 transition count 450
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 359 place count 240 transition count 441
Iterating global reduction 6 with 5 rules applied. Total rules applied 364 place count 240 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 366 place count 240 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 367 place count 239 transition count 439
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 369 place count 237 transition count 433
Iterating global reduction 8 with 2 rules applied. Total rules applied 371 place count 237 transition count 433
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 373 place count 235 transition count 429
Iterating global reduction 8 with 2 rules applied. Total rules applied 375 place count 235 transition count 429
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 377 place count 233 transition count 423
Iterating global reduction 8 with 2 rules applied. Total rules applied 379 place count 233 transition count 423
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 381 place count 231 transition count 419
Iterating global reduction 8 with 2 rules applied. Total rules applied 383 place count 231 transition count 419
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 385 place count 229 transition count 413
Iterating global reduction 8 with 2 rules applied. Total rules applied 387 place count 229 transition count 413
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 389 place count 227 transition count 409
Iterating global reduction 8 with 2 rules applied. Total rules applied 391 place count 227 transition count 409
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 393 place count 225 transition count 403
Iterating global reduction 8 with 2 rules applied. Total rules applied 395 place count 225 transition count 403
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 397 place count 223 transition count 399
Iterating global reduction 8 with 2 rules applied. Total rules applied 399 place count 223 transition count 399
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 401 place count 221 transition count 393
Iterating global reduction 8 with 2 rules applied. Total rules applied 403 place count 221 transition count 393
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 405 place count 219 transition count 389
Iterating global reduction 8 with 2 rules applied. Total rules applied 407 place count 219 transition count 389
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 409 place count 217 transition count 385
Iterating global reduction 8 with 2 rules applied. Total rules applied 411 place count 217 transition count 385
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 413 place count 215 transition count 381
Iterating global reduction 8 with 2 rules applied. Total rules applied 415 place count 215 transition count 381
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 483 place count 181 transition count 347
Performed 28 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 539 place count 153 transition count 405
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 541 place count 153 transition count 403
Free-agglomeration rule applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 560 place count 153 transition count 384
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 584 place count 134 transition count 379
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 588 place count 130 transition count 375
Iterating global reduction 9 with 4 rules applied. Total rules applied 592 place count 130 transition count 375
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 598 place count 130 transition count 369
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 614 place count 130 transition count 353
Applied a total of 614 rules in 199 ms. Remains 130 /437 variables (removed 307) and now considering 353/707 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 130/437 places, 353/707 transitions.
Normalized transition count is 347 out of 353 initially.
// Phase 1: matrix 347 rows 130 cols
[2024-06-02 23:38:40] [INFO ] Computed 7 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 49701 resets, run finished after 1379 ms. (steps per millisecond=725 ) properties (out of 11) seen :7
FORMULA FireWire-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 12448 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12428 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12400 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 12385 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 4) seen :0
[2024-06-02 23:38:43] [INFO ] Flow matrix only has 347 transitions (discarded 6 similar events)
// Phase 1: matrix 347 rows 130 cols
[2024-06-02 23:38:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:38:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:43] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 23:38:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:43] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 23:38:43] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:38:43] [INFO ] [Nat]Added 62 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:38:43] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:38:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-06-02 23:38:43] [INFO ] Computed and/alt/rep : 159/854/159 causal constraints (skipped 184 transitions) in 16 ms.
[2024-06-02 23:38:44] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-02 23:38:44] [INFO ] Added : 67 causal constraints over 16 iterations in 470 ms. Result :sat
Minimization took 61 ms.
[2024-06-02 23:38:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:44] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 23:38:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:44] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:38:44] [INFO ] [Nat]Added 62 Read/Feed constraints in 14 ms returned sat
[2024-06-02 23:38:44] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-06-02 23:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-02 23:38:44] [INFO ] Computed and/alt/rep : 159/854/159 causal constraints (skipped 184 transitions) in 18 ms.
[2024-06-02 23:38:44] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2024-06-02 23:38:44] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-02 23:38:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2024-06-02 23:38:44] [INFO ] Added : 47 causal constraints over 14 iterations in 453 ms. Result :sat
Minimization took 50 ms.
[2024-06-02 23:38:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:45] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 23:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:45] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 23:38:45] [INFO ] [Nat]Added 62 Read/Feed constraints in 30 ms returned sat
[2024-06-02 23:38:45] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:38:45] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2024-06-02 23:38:45] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-06-02 23:38:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 241 ms
[2024-06-02 23:38:45] [INFO ] Computed and/alt/rep : 159/854/159 causal constraints (skipped 184 transitions) in 18 ms.
[2024-06-02 23:38:45] [INFO ] Added : 61 causal constraints over 13 iterations in 281 ms. Result :sat
Minimization took 68 ms.
[2024-06-02 23:38:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:45] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 23:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:46] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:38:46] [INFO ] [Nat]Added 62 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:38:46] [INFO ] Computed and/alt/rep : 159/854/159 causal constraints (skipped 184 transitions) in 27 ms.
[2024-06-02 23:38:46] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2024-06-02 23:38:46] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:38:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2024-06-02 23:38:46] [INFO ] Added : 48 causal constraints over 10 iterations in 425 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 353/353 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 129 transition count 351
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 129 transition count 349
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 7 place count 127 transition count 349
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 125 transition count 347
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 125 transition count 347
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 2 with 2 rules applied. Total rules applied 13 place count 124 transition count 346
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 2 with 2 rules applied. Total rules applied 15 place count 123 transition count 347
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 123 transition count 346
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 123 transition count 345
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 122 transition count 342
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 122 transition count 342
Applied a total of 23 rules in 40 ms. Remains 122 /130 variables (removed 8) and now considering 342/353 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 122/130 places, 342/353 transitions.
Normalized transition count is 336 out of 342 initially.
// Phase 1: matrix 336 rows 122 cols
[2024-06-02 23:38:46] [INFO ] Computed 7 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 49905 resets, run finished after 1231 ms. (steps per millisecond=812 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 12416 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12384 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12471 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12390 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 4) seen :0
[2024-06-02 23:38:49] [INFO ] Flow matrix only has 336 transitions (discarded 6 similar events)
// Phase 1: matrix 336 rows 122 cols
[2024-06-02 23:38:49] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:38:49] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:49] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:38:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:49] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:38:49] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:38:49] [INFO ] [Nat]Added 61 Read/Feed constraints in 14 ms returned sat
[2024-06-02 23:38:49] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-06-02 23:38:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 23:38:49] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 186 transitions) in 20 ms.
[2024-06-02 23:38:50] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:38:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-06-02 23:38:50] [INFO ] Added : 78 causal constraints over 19 iterations in 510 ms. Result :sat
Minimization took 78 ms.
[2024-06-02 23:38:50] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:50] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 23:38:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:38:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:50] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 23:38:50] [INFO ] [Nat]Added 61 Read/Feed constraints in 10 ms returned sat
[2024-06-02 23:38:50] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 186 transitions) in 19 ms.
[2024-06-02 23:38:51] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2024-06-02 23:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-06-02 23:38:51] [INFO ] Added : 41 causal constraints over 12 iterations in 381 ms. Result :sat
Minimization took 48 ms.
[2024-06-02 23:38:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:51] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 23:38:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:51] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 23:38:51] [INFO ] [Nat]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 23:38:51] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:38:51] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:38:51] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2024-06-02 23:38:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 241 ms
[2024-06-02 23:38:51] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 186 transitions) in 18 ms.
[2024-06-02 23:38:51] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 23:38:51] [INFO ] Added : 35 causal constraints over 11 iterations in 303 ms. Result :sat
Minimization took 54 ms.
[2024-06-02 23:38:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:52] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 23:38:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:52] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 23:38:52] [INFO ] [Nat]Added 61 Read/Feed constraints in 11 ms returned sat
[2024-06-02 23:38:52] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 186 transitions) in 20 ms.
[2024-06-02 23:38:52] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:38:52] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2024-06-02 23:38:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2024-06-02 23:38:52] [INFO ] Added : 72 causal constraints over 17 iterations in 585 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 122/122 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-06-02 23:38:52] [INFO ] Flow matrix only has 336 transitions (discarded 6 similar events)
[2024-06-02 23:38:52] [INFO ] Invariant cache hit.
[2024-06-02 23:38:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 23:38:52] [INFO ] Flow matrix only has 336 transitions (discarded 6 similar events)
[2024-06-02 23:38:52] [INFO ] Invariant cache hit.
[2024-06-02 23:38:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:38:53] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-06-02 23:38:53] [INFO ] Redundant transitions in 35 ms returned [312]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2024-06-02 23:38:53] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:38:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:38:53] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/122 places, 341/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 470 ms. Remains : 122/122 places, 341/342 transitions.
Normalized transition count is 335 out of 341 initially.
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:38:53] [INFO ] Computed 7 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 49842 resets, run finished after 1218 ms. (steps per millisecond=821 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 12441 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12347 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12351 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12357 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 4) seen :0
[2024-06-02 23:38:56] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:38:56] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:38:56] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:56] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 23:38:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:56] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:38:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:38:56] [INFO ] [Nat]Added 61 Read/Feed constraints in 11 ms returned sat
[2024-06-02 23:38:56] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 185 transitions) in 21 ms.
[2024-06-02 23:38:56] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:38:56] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-06-02 23:38:57] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2024-06-02 23:38:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2024-06-02 23:38:57] [INFO ] Added : 60 causal constraints over 12 iterations in 593 ms. Result :sat
Minimization took 64 ms.
[2024-06-02 23:38:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:57] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:38:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:57] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 23:38:57] [INFO ] [Nat]Added 61 Read/Feed constraints in 8 ms returned sat
[2024-06-02 23:38:57] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 185 transitions) in 18 ms.
[2024-06-02 23:38:57] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:38:57] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 4 ms to minimize.
[2024-06-02 23:38:57] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:38:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2024-06-02 23:38:57] [INFO ] Added : 36 causal constraints over 9 iterations in 472 ms. Result :sat
Minimization took 52 ms.
[2024-06-02 23:38:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:57] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 23:38:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:58] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 23:38:58] [INFO ] [Nat]Added 61 Read/Feed constraints in 15 ms returned sat
[2024-06-02 23:38:58] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2024-06-02 23:38:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-02 23:38:58] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 185 transitions) in 26 ms.
[2024-06-02 23:38:58] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-06-02 23:38:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-06-02 23:38:58] [INFO ] Added : 47 causal constraints over 11 iterations in 366 ms. Result :sat
Minimization took 67 ms.
[2024-06-02 23:38:58] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:58] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:38:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:38:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:38:58] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 23:38:58] [INFO ] [Nat]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:38:58] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 185 transitions) in 21 ms.
[2024-06-02 23:38:59] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:38:59] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:38:59] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:38:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2024-06-02 23:38:59] [INFO ] Added : 48 causal constraints over 12 iterations in 532 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 122/122 places, 341/341 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 341/341 (removed 0) transitions.
[2024-06-02 23:38:59] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
[2024-06-02 23:38:59] [INFO ] Invariant cache hit.
[2024-06-02 23:38:59] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 23:38:59] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
[2024-06-02 23:38:59] [INFO ] Invariant cache hit.
[2024-06-02 23:38:59] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:38:59] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-06-02 23:38:59] [INFO ] Redundant transitions in 7 ms returned []
[2024-06-02 23:38:59] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
[2024-06-02 23:38:59] [INFO ] Invariant cache hit.
[2024-06-02 23:38:59] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 122/122 places, 341/341 transitions.
Starting property specific reduction for FireWire-PT-18-UpperBounds-00
Normalized transition count is 335 out of 341 initially.
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:38:59] [INFO ] Computed 7 invariants in 2 ms
Incomplete random walk after 10000 steps, including 494 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-06-02 23:38:59] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:38:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:38:59] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:00] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 23:39:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:39:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:00] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 23:39:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:39:00] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:39:00] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 185 transitions) in 20 ms.
[2024-06-02 23:39:00] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2024-06-02 23:39:00] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-06-02 23:39:00] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:39:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2024-06-02 23:39:00] [INFO ] Added : 60 causal constraints over 12 iterations in 592 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 340
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 340
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 119 transition count 338
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 117 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 333
Applied a total of 10 rules in 11 ms. Remains 117 /122 variables (removed 5) and now considering 333/341 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 117/122 places, 333/341 transitions.
Normalized transition count is 327 out of 333 initially.
// Phase 1: matrix 327 rows 117 cols
[2024-06-02 23:39:00] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 49895 resets, run finished after 1281 ms. (steps per millisecond=780 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12454 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 1) seen :0
[2024-06-02 23:39:02] [INFO ] Flow matrix only has 327 transitions (discarded 6 similar events)
// Phase 1: matrix 327 rows 117 cols
[2024-06-02 23:39:02] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:39:02] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:02] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 23:39:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:39:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:02] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 23:39:02] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:39:02] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2024-06-02 23:39:02] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 0 ms to minimize.
[2024-06-02 23:39:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-06-02 23:39:02] [INFO ] Computed and/alt/rep : 140/812/140 causal constraints (skipped 183 transitions) in 19 ms.
[2024-06-02 23:39:03] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
[2024-06-02 23:39:03] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2024-06-02 23:39:03] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 0 ms to minimize.
[2024-06-02 23:39:03] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2024-06-02 23:39:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 320 ms
[2024-06-02 23:39:03] [INFO ] Added : 27 causal constraints over 6 iterations in 487 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 117/117 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2024-06-02 23:39:03] [INFO ] Flow matrix only has 327 transitions (discarded 6 similar events)
[2024-06-02 23:39:03] [INFO ] Invariant cache hit.
[2024-06-02 23:39:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:39:03] [INFO ] Flow matrix only has 327 transitions (discarded 6 similar events)
[2024-06-02 23:39:03] [INFO ] Invariant cache hit.
[2024-06-02 23:39:03] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:39:03] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-02 23:39:03] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:39:03] [INFO ] Flow matrix only has 327 transitions (discarded 6 similar events)
[2024-06-02 23:39:03] [INFO ] Invariant cache hit.
[2024-06-02 23:39:03] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 117/117 places, 333/333 transitions.
Ending property specific reduction for FireWire-PT-18-UpperBounds-00 in 3910 ms.
Starting property specific reduction for FireWire-PT-18-UpperBounds-01
Normalized transition count is 335 out of 341 initially.
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:39:03] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 10000 steps, including 489 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2024-06-02 23:39:03] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:39:03] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:39:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:03] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:39:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:39:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:04] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 23:39:04] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:39:04] [INFO ] [Nat]Added 61 Read/Feed constraints in 9 ms returned sat
[2024-06-02 23:39:04] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 185 transitions) in 20 ms.
[2024-06-02 23:39:04] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 0 ms to minimize.
[2024-06-02 23:39:04] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 0 ms to minimize.
[2024-06-02 23:39:04] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:39:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2024-06-02 23:39:04] [INFO ] Added : 36 causal constraints over 9 iterations in 492 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 338
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 6 place count 119 transition count 337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 334
Applied a total of 8 rules in 9 ms. Remains 118 /122 variables (removed 4) and now considering 334/341 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 118/122 places, 334/341 transitions.
Normalized transition count is 328 out of 334 initially.
// Phase 1: matrix 328 rows 118 cols
[2024-06-02 23:39:04] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 49641 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12422 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 1) seen :0
[2024-06-02 23:39:06] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
// Phase 1: matrix 328 rows 118 cols
[2024-06-02 23:39:06] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:39:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:06] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:39:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:06] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 23:39:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:39:06] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2024-06-02 23:39:06] [INFO ] Computed and/alt/rep : 142/822/142 causal constraints (skipped 182 transitions) in 23 ms.
[2024-06-02 23:39:06] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:39:06] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 0 ms to minimize.
[2024-06-02 23:39:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-06-02 23:39:06] [INFO ] Added : 55 causal constraints over 16 iterations in 518 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 334/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 334/334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 334/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-06-02 23:39:07] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 23:39:07] [INFO ] Invariant cache hit.
[2024-06-02 23:39:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 23:39:07] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 23:39:07] [INFO ] Invariant cache hit.
[2024-06-02 23:39:07] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:39:07] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-06-02 23:39:07] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:39:07] [INFO ] Flow matrix only has 328 transitions (discarded 6 similar events)
[2024-06-02 23:39:07] [INFO ] Invariant cache hit.
[2024-06-02 23:39:07] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 118/118 places, 334/334 transitions.
Ending property specific reduction for FireWire-PT-18-UpperBounds-01 in 3671 ms.
Starting property specific reduction for FireWire-PT-18-UpperBounds-03
Normalized transition count is 335 out of 341 initially.
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:39:07] [INFO ] Computed 7 invariants in 2 ms
Incomplete random walk after 10000 steps, including 491 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2024-06-02 23:39:07] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:39:07] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:39:07] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:07] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 23:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:39:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:07] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 23:39:07] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:39:07] [INFO ] [Nat]Added 61 Read/Feed constraints in 23 ms returned sat
[2024-06-02 23:39:07] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2024-06-02 23:39:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-02 23:39:07] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 185 transitions) in 21 ms.
[2024-06-02 23:39:08] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-06-02 23:39:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-02 23:39:08] [INFO ] Added : 47 causal constraints over 11 iterations in 370 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 339
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 339
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 119 transition count 337
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 117 transition count 332
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 332
Applied a total of 10 rules in 8 ms. Remains 117 /122 variables (removed 5) and now considering 332/341 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 117/122 places, 332/341 transitions.
Normalized transition count is 326 out of 332 initially.
// Phase 1: matrix 326 rows 117 cols
[2024-06-02 23:39:08] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 49768 resets, run finished after 1305 ms. (steps per millisecond=766 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12407 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 1) seen :0
[2024-06-02 23:39:10] [INFO ] Flow matrix only has 326 transitions (discarded 6 similar events)
// Phase 1: matrix 326 rows 117 cols
[2024-06-02 23:39:10] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:39:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:10] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 23:39:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:39:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:10] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-02 23:39:10] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:39:10] [INFO ] [Nat]Added 60 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2024-06-02 23:39:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-02 23:39:10] [INFO ] Computed and/alt/rep : 141/828/141 causal constraints (skipped 181 transitions) in 18 ms.
[2024-06-02 23:39:10] [INFO ] Added : 31 causal constraints over 9 iterations in 181 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 117/117 places, 332/332 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-02 23:39:10] [INFO ] Flow matrix only has 326 transitions (discarded 6 similar events)
[2024-06-02 23:39:10] [INFO ] Invariant cache hit.
[2024-06-02 23:39:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 23:39:10] [INFO ] Flow matrix only has 326 transitions (discarded 6 similar events)
[2024-06-02 23:39:10] [INFO ] Invariant cache hit.
[2024-06-02 23:39:10] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:39:10] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 23:39:10] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:39:10] [INFO ] Flow matrix only has 326 transitions (discarded 6 similar events)
[2024-06-02 23:39:10] [INFO ] Invariant cache hit.
[2024-06-02 23:39:11] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 117/117 places, 332/332 transitions.
Ending property specific reduction for FireWire-PT-18-UpperBounds-03 in 3543 ms.
Starting property specific reduction for FireWire-PT-18-UpperBounds-10
Normalized transition count is 335 out of 341 initially.
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:39:11] [INFO ] Computed 7 invariants in 4 ms
Incomplete random walk after 10000 steps, including 499 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-06-02 23:39:11] [INFO ] Flow matrix only has 335 transitions (discarded 6 similar events)
// Phase 1: matrix 335 rows 122 cols
[2024-06-02 23:39:11] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:39:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:11] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 23:39:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:39:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:11] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 23:39:11] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:39:11] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:39:11] [INFO ] Computed and/alt/rep : 146/833/146 causal constraints (skipped 185 transitions) in 22 ms.
[2024-06-02 23:39:11] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:39:11] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:39:11] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:39:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2024-06-02 23:39:11] [INFO ] Added : 48 causal constraints over 12 iterations in 518 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 338
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 0 with 2 rules applied. Total rules applied 6 place count 119 transition count 337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 335
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 335
Applied a total of 8 rules in 8 ms. Remains 118 /122 variables (removed 4) and now considering 335/341 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 118/122 places, 335/341 transitions.
Normalized transition count is 329 out of 335 initially.
// Phase 1: matrix 329 rows 118 cols
[2024-06-02 23:39:11] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 49829 resets, run finished after 1160 ms. (steps per millisecond=862 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12428 resets, run finished after 418 ms. (steps per millisecond=2392 ) properties (out of 1) seen :0
[2024-06-02 23:39:13] [INFO ] Flow matrix only has 329 transitions (discarded 6 similar events)
// Phase 1: matrix 329 rows 118 cols
[2024-06-02 23:39:13] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:39:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:13] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 23:39:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:39:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:39:13] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-02 23:39:13] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:39:13] [INFO ] [Nat]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:39:13] [INFO ] Computed and/alt/rep : 143/822/143 causal constraints (skipped 182 transitions) in 20 ms.
[2024-06-02 23:39:13] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:39:14] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:39:14] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:39:14] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:39:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 309 ms
[2024-06-02 23:39:14] [INFO ] Added : 42 causal constraints over 10 iterations in 551 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 335/335 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 335/335 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 335/335 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-06-02 23:39:14] [INFO ] Flow matrix only has 329 transitions (discarded 6 similar events)
[2024-06-02 23:39:14] [INFO ] Invariant cache hit.
[2024-06-02 23:39:14] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:39:14] [INFO ] Flow matrix only has 329 transitions (discarded 6 similar events)
[2024-06-02 23:39:14] [INFO ] Invariant cache hit.
[2024-06-02 23:39:14] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:39:14] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-06-02 23:39:14] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:39:14] [INFO ] Flow matrix only has 329 transitions (discarded 6 similar events)
[2024-06-02 23:39:14] [INFO ] Invariant cache hit.
[2024-06-02 23:39:14] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 118/118 places, 335/335 transitions.
Ending property specific reduction for FireWire-PT-18-UpperBounds-10 in 3659 ms.
[2024-06-02 23:39:14] [INFO ] Flatten gal took : 56 ms
[2024-06-02 23:39:14] [INFO ] Applying decomposition
[2024-06-02 23:39:14] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1430170799651747172.txt' '-o' '/tmp/graph1430170799651747172.bin' '-w' '/tmp/graph1430170799651747172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1430170799651747172.bin' '-l' '-1' '-v' '-w' '/tmp/graph1430170799651747172.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:39:15] [INFO ] Decomposing Gal with order
[2024-06-02 23:39:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:39:15] [INFO ] Removed a total of 484 redundant transitions.
[2024-06-02 23:39:15] [INFO ] Flatten gal took : 65 ms
[2024-06-02 23:39:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 14 ms.
[2024-06-02 23:39:15] [INFO ] Time to serialize gal into /tmp/UpperBounds9760943448435420041.gal : 6 ms
[2024-06-02 23:39:15] [INFO ] Time to serialize properties into /tmp/UpperBounds12532937433356664536.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9760943448435420041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12532937433356664536.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds12532937433356664536.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.09279e+07,13.7384,337916,1736,219,424713,5177,705,1.85557e+06,181,19764,0
Total reachable state count : 30927890

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-18-UpperBounds-00 :0 <= i2.i1.u26.p338 <= 1
FORMULA FireWire-PT-18-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-18-UpperBounds-00,0,13.7859,337916,1,0,424713,5177,884,1.85557e+06,203,19764,1298
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-18-UpperBounds-01 :0 <= i2.i2.u13.p152 <= 1
FORMULA FireWire-PT-18-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-18-UpperBounds-01,0,13.7874,337916,1,0,424713,5177,920,1.85557e+06,208,19764,1616
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-18-UpperBounds-03 :0 <= i5.u19.p254 <= 1
FORMULA FireWire-PT-18-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-18-UpperBounds-03,0,13.7949,337916,1,0,424713,5177,945,1.85557e+06,227,19764,1736
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-18-UpperBounds-10 :0 <= i0.u14.p154 <= 1
FORMULA FireWire-PT-18-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-18-UpperBounds-10,0,13.7951,337916,1,0,424713,5177,965,1.85557e+06,227,19764,1754
Total runtime 114590 ms.

BK_STOP 1717371569988

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is FireWire-PT-18, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910400191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;