Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K 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 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 153K 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-17-UpperBounds-00
FORMULA_NAME FireWire-PT-17-UpperBounds-01
FORMULA_NAME FireWire-PT-17-UpperBounds-02
FORMULA_NAME FireWire-PT-17-UpperBounds-03
FORMULA_NAME FireWire-PT-17-UpperBounds-04
FORMULA_NAME FireWire-PT-17-UpperBounds-05
FORMULA_NAME FireWire-PT-17-UpperBounds-06
FORMULA_NAME FireWire-PT-17-UpperBounds-07
FORMULA_NAME FireWire-PT-17-UpperBounds-08
FORMULA_NAME FireWire-PT-17-UpperBounds-09
FORMULA_NAME FireWire-PT-17-UpperBounds-10
FORMULA_NAME FireWire-PT-17-UpperBounds-11
FORMULA_NAME FireWire-PT-17-UpperBounds-12
FORMULA_NAME FireWire-PT-17-UpperBounds-13
FORMULA_NAME FireWire-PT-17-UpperBounds-14
FORMULA_NAME FireWire-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717357329117

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:42:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:42:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:42:10] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 19:42:10] [INFO ] Transformed 428 places.
[2024-06-02 19:42:10] [INFO ] Transformed 656 transitions.
[2024-06-02 19:42:10] [INFO ] Found NUPN structural information;
[2024-06-02 19:42:10] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 656 rows 428 cols
[2024-06-02 19:42:10] [INFO ] Computed 9 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 35 ms. (277 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70000 steps (25 resets) in 113 ms. (614 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:42:10] [INFO ] Invariant cache hit.
[2024-06-02 19:42:10] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 19:42:11] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 10 ms to minimize.
[2024-06-02 19:42:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:42:11] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-06-02 19:42:11] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 11 ms to minimize.
[2024-06-02 19:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-06-02 19:42:11] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 49 ms.
[2024-06-02 19:42:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-02 19:42:16] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 19:42:16] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-06-02 19:42:16] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:42:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:42:17] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-06-02 19:42:17] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 3 ms to minimize.
[2024-06-02 19:42:17] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-06-02 19:42:17] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-06-02 19:42:17] [INFO ] Deduced a trap composed of 140 places in 119 ms of which 3 ms to minimize.
[2024-06-02 19:42:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 620 ms
[2024-06-02 19:42:17] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 34 ms.
[2024-06-02 19:42:21] [INFO ] Added : 485 causal constraints over 97 iterations in 4147 ms. Result :unknown
[2024-06-02 19:42:21] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:42:22] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-06-02 19:42:22] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 34 ms.
[2024-06-02 19:42:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-06-02 19:42:22] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-06-02 19:42:22] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 36 ms.
[2024-06-02 19:42:27] [INFO ] Added : 486 causal constraints over 98 iterations in 4494 ms. Result :sat
Minimization took 230 ms.
[2024-06-02 19:42:27] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:42:27] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-06-02 19:42:27] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-02 19:42:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:42:27] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-06-02 19:42:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:42:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-02 19:42:27] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 33 ms.
[2024-06-02 19:42:31] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:42:31] [INFO ] Deduced a trap composed of 104 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:42:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2024-06-02 19:42:31] [INFO ] Added : 405 causal constraints over 81 iterations in 3826 ms. Result :sat
Minimization took 395 ms.
[2024-06-02 19:42:32] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:42:32] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-06-02 19:42:32] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 42 ms.
[2024-06-02 19:42:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:42:32] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-06-02 19:42:32] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 40 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-02 19:42:37] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:42:37] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-06-02 19:42:37] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 33 ms.
[2024-06-02 19:42:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 19:42:38] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-06-02 19:42:38] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 33 ms.
[2024-06-02 19:42:41] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 3 ms to minimize.
[2024-06-02 19:42:41] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:42:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2024-06-02 19:42:42] [INFO ] Added : 401 causal constraints over 81 iterations in 3771 ms. Result :sat
Minimization took 377 ms.
[2024-06-02 19:42:42] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:42:42] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-06-02 19:42:42] [INFO ] Deduced a trap composed of 211 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:42:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:42:43] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-06-02 19:42:43] [INFO ] Deduced a trap composed of 211 places in 131 ms of which 2 ms to minimize.
[2024-06-02 19:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-06-02 19:42:43] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 29 ms.
[2024-06-02 19:42:47] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:42:47] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 349 edges and 428 vertex of which 19 / 428 are part of one of the 3 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1083 edges and 412 vertex of which 406 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 125 rules applied. Total rules applied 127 place count 406 transition count 511
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 126 rules applied. Total rules applied 253 place count 283 transition count 508
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 257 place count 281 transition count 506
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 259 place count 279 transition count 506
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 259 place count 279 transition count 498
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 275 place count 271 transition count 498
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 317 place count 229 transition count 455
Iterating global reduction 4 with 42 rules applied. Total rules applied 359 place count 229 transition count 455
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 361 place count 229 transition count 453
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 361 place count 229 transition count 442
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 383 place count 218 transition count 442
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 393 place count 208 transition count 388
Iterating global reduction 5 with 10 rules applied. Total rules applied 403 place count 208 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 408 place count 208 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 410 place count 206 transition count 383
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 480 place count 171 transition count 348
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 542 place count 140 transition count 445
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 548 place count 140 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 584 place count 140 transition count 403
Free-agglomeration rule applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 603 place count 140 transition count 384
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 628 place count 121 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 9 with 56 rules applied. Total rules applied 684 place count 121 transition count 322
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 687 place count 121 transition count 322
Applied a total of 687 rules in 175 ms. Remains 121 /428 variables (removed 307) and now considering 322/656 (removed 334) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 121/428 places, 322/656 transitions.
[2024-06-02 19:42:49] [INFO ] Flow matrix only has 287 transitions (discarded 35 similar events)
// Phase 1: matrix 287 rows 121 cols
[2024-06-02 19:42:49] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (57648 resets) in 1171 ms. (853 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (29531 resets) in 846 ms. (2361 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:42:51] [INFO ] Flow matrix only has 287 transitions (discarded 35 similar events)
[2024-06-02 19:42:51] [INFO ] Invariant cache hit.
[2024-06-02 19:42:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:42:51] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 19:42:51] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:42:51] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:42:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:42:51] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 19:42:51] [INFO ] [Nat]Added 61 Read/Feed constraints in 9 ms returned sat
[2024-06-02 19:42:51] [INFO ] Computed and/alt/rep : 94/484/94 causal constraints (skipped 189 transitions) in 17 ms.
[2024-06-02 19:42:51] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:42:51] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:42:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2024-06-02 19:42:51] [INFO ] Added : 28 causal constraints over 6 iterations in 317 ms. Result :sat
Minimization took 104 ms.
[2024-06-02 19:42:52] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:42:52] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-02 19:42:52] [INFO ] [Real]Added 61 Read/Feed constraints in 8 ms returned sat
[2024-06-02 19:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:42:52] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:42:52] [INFO ] [Nat]Added 61 Read/Feed constraints in 6 ms returned sat
[2024-06-02 19:42:52] [INFO ] Computed and/alt/rep : 94/484/94 causal constraints (skipped 189 transitions) in 16 ms.
[2024-06-02 19:42:52] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:42:52] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 0 ms to minimize.
[2024-06-02 19:42:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2024-06-02 19:42:52] [INFO ] Added : 22 causal constraints over 7 iterations in 324 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 322/322 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 118 transition count 319
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 118 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 117 transition count 318
Applied a total of 8 rules in 19 ms. Remains 117 /121 variables (removed 4) and now considering 318/322 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 117/121 places, 318/322 transitions.
[2024-06-02 19:42:52] [INFO ] Flow matrix only has 281 transitions (discarded 37 similar events)
// Phase 1: matrix 281 rows 117 cols
[2024-06-02 19:42:52] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (57650 resets) in 1109 ms. (900 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (14751 resets) in 406 ms. (2457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:42:54] [INFO ] Flow matrix only has 281 transitions (discarded 37 similar events)
[2024-06-02 19:42:54] [INFO ] Invariant cache hit.
[2024-06-02 19:42:54] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:42:54] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 19:42:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:42:54] [INFO ] [Real]Added 61 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:42:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:42:54] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 19:42:54] [INFO ] [Nat]Added 61 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:42:54] [INFO ] Computed and/alt/rep : 89/477/89 causal constraints (skipped 188 transitions) in 18 ms.
[2024-06-02 19:42:54] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 0 ms to minimize.
[2024-06-02 19:42:54] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:42:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-06-02 19:42:54] [INFO ] Added : 16 causal constraints over 5 iterations in 288 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 117 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p103) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 316/316 transitions.
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 312
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 115 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 5 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 112 transition count 302
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 112 transition count 302
Applied a total of 7 rules in 14 ms. Remains 112 /117 variables (removed 5) and now considering 302/316 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 112/117 places, 302/316 transitions.
[2024-06-02 19:42:55] [INFO ] Flow matrix only has 265 transitions (discarded 37 similar events)
// Phase 1: matrix 265 rows 112 cols
[2024-06-02 19:42:55] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (59022 resets) in 1070 ms. (933 steps per ms)
BEST_FIRST walk for 1000000 steps (15458 resets) in 401 ms. (2487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 19:42:56] [INFO ] Flow matrix only has 265 transitions (discarded 37 similar events)
[2024-06-02 19:42:56] [INFO ] Invariant cache hit.
[2024-06-02 19:42:56] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:42:56] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 19:42:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:42:56] [INFO ] [Real]Added 61 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:42:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:42:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:42:56] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 19:42:56] [INFO ] [Nat]Added 61 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:42:56] [INFO ] Computed and/alt/rep : 82/435/82 causal constraints (skipped 179 transitions) in 15 ms.
[2024-06-02 19:42:56] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:42:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-06-02 19:42:56] [INFO ] Added : 19 causal constraints over 5 iterations in 187 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 302/302 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 112/112 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 302/302 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 19:42:57] [INFO ] Flow matrix only has 265 transitions (discarded 37 similar events)
[2024-06-02 19:42:57] [INFO ] Invariant cache hit.
[2024-06-02 19:42:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 19:42:57] [INFO ] Flow matrix only has 265 transitions (discarded 37 similar events)
[2024-06-02 19:42:57] [INFO ] Invariant cache hit.
[2024-06-02 19:42:57] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:42:57] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-02 19:42:57] [INFO ] Redundant transitions in 16 ms returned []
Running 298 sub problems to find dead transitions.
[2024-06-02 19:42:57] [INFO ] Flow matrix only has 265 transitions (discarded 37 similar events)
[2024-06-02 19:42:57] [INFO ] Invariant cache hit.
[2024-06-02 19:42:57] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 2/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 19:42:58] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:42:58] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:42:59] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:42:59] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:42:59] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:42:59] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:42:59] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 265/377 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 61/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 19:43:03] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 0/377 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 188 constraints, problems are : Problem set: 0 solved, 298 unsolved in 11532 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 112/112 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 2/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 265/377 variables, 112/127 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 61/188 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 298/486 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 0/377 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 486 constraints, problems are : Problem set: 0 solved, 298 unsolved in 14477 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 112/112 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 8/8 constraints]
After SMT, in 26262ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 26274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26580 ms. Remains : 112/112 places, 302/302 transitions.
RANDOM walk for 40000 steps (2384 resets) in 684 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (628 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (590 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 32111 steps, run visited all 2 properties in 181 ms. (steps per millisecond=177 )
Probabilistic random walk after 32111 steps, saw 12258 distinct states, run finished after 186 ms. (steps per millisecond=172 ) properties seen :2
FORMULA FireWire-PT-17-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 73919 ms.
ITS solved all properties within timeout

BK_STOP 1717357404178

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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