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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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-19-UpperBounds-00
FORMULA_NAME FireWire-PT-19-UpperBounds-01
FORMULA_NAME FireWire-PT-19-UpperBounds-02
FORMULA_NAME FireWire-PT-19-UpperBounds-03
FORMULA_NAME FireWire-PT-19-UpperBounds-04
FORMULA_NAME FireWire-PT-19-UpperBounds-05
FORMULA_NAME FireWire-PT-19-UpperBounds-06
FORMULA_NAME FireWire-PT-19-UpperBounds-07
FORMULA_NAME FireWire-PT-19-UpperBounds-08
FORMULA_NAME FireWire-PT-19-UpperBounds-09
FORMULA_NAME FireWire-PT-19-UpperBounds-10
FORMULA_NAME FireWire-PT-19-UpperBounds-11
FORMULA_NAME FireWire-PT-19-UpperBounds-12
FORMULA_NAME FireWire-PT-19-UpperBounds-13
FORMULA_NAME FireWire-PT-19-UpperBounds-14
FORMULA_NAME FireWire-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717357915183

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-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:51:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:51:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:51:56] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-02 19:51:56] [INFO ] Transformed 602 places.
[2024-06-02 19:51:56] [INFO ] Transformed 944 transitions.
[2024-06-02 19:51:56] [INFO ] Found NUPN structural information;
[2024-06-02 19:51:56] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 211 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 944 rows 602 cols
[2024-06-02 19:51:56] [INFO ] Computed 13 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (4 resets) in 37 ms. (263 steps per ms)
FORMULA FireWire-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120001 steps (39 resets) in 196 ms. (609 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:51:56] [INFO ] Invariant cache hit.
[2024-06-02 19:51:57] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-02 19:51:57] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-06-02 19:51:57] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 147 ms.
[2024-06-02 19:51:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:51:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-06-02 19:51:58] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-02 19:51:58] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 63 ms.
[2024-06-02 19:52:03] [INFO ] Added : 430 causal constraints over 86 iterations in 4557 ms. Result :unknown
[2024-06-02 19:52:03] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:03] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-06-02 19:52:03] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 49 ms.
[2024-06-02 19:52:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-02 19:52:04] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2024-06-02 19:52:04] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 45 ms.
[2024-06-02 19:52:08] [INFO ] Added : 440 causal constraints over 88 iterations in 4632 ms. Result :unknown
[2024-06-02 19:52:08] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:09] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 176 places in 250 ms of which 41 ms to minimize.
[2024-06-02 19:52:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:09] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-02 19:52:10] [INFO ] Deduced a trap composed of 176 places in 211 ms of which 5 ms to minimize.
[2024-06-02 19:52:10] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 3 ms to minimize.
[2024-06-02 19:52:10] [INFO ] Deduced a trap composed of 83 places in 210 ms of which 4 ms to minimize.
[2024-06-02 19:52:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 746 ms
[2024-06-02 19:52:10] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 40 ms.
[2024-06-02 19:52:14] [INFO ] Added : 390 causal constraints over 78 iterations in 3913 ms. Result :unknown
[2024-06-02 19:52:14] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:14] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-02 19:52:15] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:15] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-06-02 19:52:15] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-06-02 19:52:15] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 53 ms.
[2024-06-02 19:52:20] [INFO ] Added : 430 causal constraints over 86 iterations in 4553 ms. Result :unknown
[2024-06-02 19:52:20] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:20] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-06-02 19:52:20] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 50 ms.
[2024-06-02 19:52:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:21] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-06-02 19:52:21] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 51 ms.
[2024-06-02 19:52:25] [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: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:52:25] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:26] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-06-02 19:52:26] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:52:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:26] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2024-06-02 19:52:26] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-06-02 19:52:26] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 38 ms.
[2024-06-02 19:52:31] [INFO ] Added : 430 causal constraints over 86 iterations in 4524 ms. Result :unknown
[2024-06-02 19:52:31] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:31] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-06-02 19:52:31] [INFO ] Deduced a trap composed of 305 places in 199 ms of which 3 ms to minimize.
[2024-06-02 19:52:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:32] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-06-02 19:52:32] [INFO ] Deduced a trap composed of 305 places in 199 ms of which 3 ms to minimize.
[2024-06-02 19:52:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2024-06-02 19:52:32] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 44 ms.
[2024-06-02 19:52:37] [INFO ] Added : 420 causal constraints over 84 iterations in 4412 ms. Result :unknown
[2024-06-02 19:52:37] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:37] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-06-02 19:52:37] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-06-02 19:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:37] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-06-02 19:52:38] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 4 ms to minimize.
[2024-06-02 19:52:38] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 3 ms to minimize.
[2024-06-02 19:52:38] [INFO ] Deduced a trap composed of 131 places in 187 ms of which 3 ms to minimize.
[2024-06-02 19:52:38] [INFO ] Deduced a trap composed of 117 places in 207 ms of which 3 ms to minimize.
[2024-06-02 19:52:39] [INFO ] Deduced a trap composed of 145 places in 190 ms of which 4 ms to minimize.
[2024-06-02 19:52:39] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 3 ms to minimize.
[2024-06-02 19:52:39] [INFO ] Deduced a trap composed of 103 places in 193 ms of which 3 ms to minimize.
[2024-06-02 19:52:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1607 ms
[2024-06-02 19:52:39] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 52 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-02 19:52:42] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:42] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-02 19:52:43] [INFO ] Deduced a trap composed of 231 places in 191 ms of which 4 ms to minimize.
[2024-06-02 19:52:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:43] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2024-06-02 19:52:43] [INFO ] Deduced a trap composed of 231 places in 204 ms of which 4 ms to minimize.
[2024-06-02 19:52:44] [INFO ] Deduced a trap composed of 96 places in 183 ms of which 3 ms to minimize.
[2024-06-02 19:52:44] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 3 ms to minimize.
[2024-06-02 19:52:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 709 ms
[2024-06-02 19:52:44] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 45 ms.
[2024-06-02 19:52:48] [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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:52:48] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:48] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-06-02 19:52:48] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 51 ms.
[2024-06-02 19:52:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:49] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-06-02 19:52:49] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 55 ms.
[2024-06-02 19:52:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-02 19:52:54] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:54] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2024-06-02 19:52:54] [INFO ] Deduced a trap composed of 261 places in 206 ms of which 3 ms to minimize.
[2024-06-02 19:52:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:52:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 19:52:54] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-06-02 19:52:55] [INFO ] Deduced a trap composed of 261 places in 190 ms of which 3 ms to minimize.
[2024-06-02 19:52:55] [INFO ] Deduced a trap composed of 315 places in 195 ms of which 4 ms to minimize.
[2024-06-02 19:52:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 471 ms
[2024-06-02 19:52:55] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 44 ms.
[2024-06-02 19:52:59] [INFO ] Added : 425 causal constraints over 85 iterations in 4176 ms. Result :unknown
[2024-06-02 19:52:59] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 19:52:59] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-06-02 19:53:00] [INFO ] Deduced a trap composed of 82 places in 212 ms of which 4 ms to minimize.
[2024-06-02 19:53:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:53:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-02 19:53:00] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-06-02 19:53:00] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 4 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 4 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2024-06-02 19:53:01] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 42 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 476 edges and 602 vertex of which 19 / 602 are part of one of the 3 SCC in 5 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 1585 edges and 586 vertex of which 577 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 577 transition count 751
Reduce places removed 170 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 173 rules applied. Total rules applied 348 place count 407 transition count 748
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 354 place count 405 transition count 744
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 358 place count 401 transition count 744
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 358 place count 401 transition count 732
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 382 place count 389 transition count 732
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 443 place count 328 transition count 670
Iterating global reduction 4 with 61 rules applied. Total rules applied 504 place count 328 transition count 670
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 507 place count 328 transition count 667
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 507 place count 328 transition count 651
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 539 place count 312 transition count 651
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 553 place count 298 transition count 570
Iterating global reduction 5 with 14 rules applied. Total rules applied 567 place count 298 transition count 570
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 7 rules applied. Total rules applied 574 place count 298 transition count 563
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 577 place count 295 transition count 563
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 675 place count 246 transition count 514
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 757 place count 205 transition count 637
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 766 place count 205 transition count 628
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 8 with 51 rules applied. Total rules applied 817 place count 205 transition count 577
Free-agglomeration rule applied 29 times.
Iterating global reduction 8 with 29 rules applied. Total rules applied 846 place count 205 transition count 548
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 884 place count 176 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 9 with 82 rules applied. Total rules applied 966 place count 176 transition count 457
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 969 place count 176 transition count 457
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 971 place count 176 transition count 457
Applied a total of 971 rules in 223 ms. Remains 176 /602 variables (removed 426) and now considering 457/944 (removed 487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 176/602 places, 457/944 transitions.
[2024-06-02 19:53:10] [INFO ] Flow matrix only has 401 transitions (discarded 56 similar events)
// Phase 1: matrix 401 rows 176 cols
[2024-06-02 19:53:10] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (40056 resets) in 1672 ms. (597 steps per ms)
FORMULA FireWire-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (8277 resets) in 505 ms. (1976 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 76368 ms.
ITS solved all properties within timeout

BK_STOP 1717357992739

--------------------
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-19"
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-19, 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-171734901400317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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