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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 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 FlexibleBarrier-PT-18b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-18b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717183644178

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:27:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 19:27:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:27:25] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-05-31 19:27:25] [INFO ] Transformed 4370 places.
[2024-05-31 19:27:25] [INFO ] Transformed 5037 transitions.
[2024-05-31 19:27:25] [INFO ] Found NUPN structural information;
[2024-05-31 19:27:25] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 5037 rows 4370 cols
[2024-05-31 19:27:25] [INFO ] Computed 20 invariants in 195 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 (82 resets) in 73 ms. (135 steps per ms)
FORMULA FlexibleBarrier-PT-18b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (68 resets) in 133 ms. (820 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 19:27:26] [INFO ] Invariant cache hit.
[2024-05-31 19:27:27] [INFO ] [Real]Absence check using 20 positive place invariants in 132 ms returned sat
[2024-05-31 19:27:29] [INFO ] [Real]Absence check using state equation in 1881 ms returned sat
[2024-05-31 19:27:29] [INFO ] Deduced a trap composed of 335 places in 337 ms of which 40 ms to minimize.
[2024-05-31 19:27:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:27:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 112 ms returned sat
[2024-05-31 19:27:32] [INFO ] [Nat]Absence check using state equation in 1826 ms returned sat
[2024-05-31 19:27:32] [INFO ] Deduced a trap composed of 335 places in 213 ms of which 5 ms to minimize.
[2024-05-31 19:27:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 565 ms
[2024-05-31 19:27:33] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 303 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 19:27:35] [INFO ] [Real]Absence check using 20 positive place invariants in 108 ms returned sat
[2024-05-31 19:27:37] [INFO ] [Real]Absence check using state equation in 2014 ms returned sat
[2024-05-31 19:27:38] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 258 ms.
[2024-05-31 19:27:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:27:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 108 ms returned sat
[2024-05-31 19:27:41] [INFO ] [Nat]Absence check using state equation in 2129 ms returned sat
[2024-05-31 19:27:42] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 246 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 19:27:44] [INFO ] [Real]Absence check using 20 positive place invariants in 107 ms returned sat
[2024-05-31 19:27:46] [INFO ] [Real]Absence check using state equation in 1700 ms returned sat
[2024-05-31 19:27:46] [INFO ] Deduced a trap composed of 94 places in 339 ms of which 6 ms to minimize.
[2024-05-31 19:27:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:27:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 115 ms returned sat
[2024-05-31 19:27:49] [INFO ] [Nat]Absence check using state equation in 1807 ms returned sat
[2024-05-31 19:27:50] [INFO ] Deduced a trap composed of 94 places in 325 ms of which 5 ms to minimize.
[2024-05-31 19:27:50] [INFO ] Deduced a trap composed of 325 places in 211 ms of which 4 ms to minimize.
[2024-05-31 19:27:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 967 ms
[2024-05-31 19:27:50] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 280 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 19:27:52] [INFO ] [Real]Absence check using 20 positive place invariants in 102 ms returned sat
[2024-05-31 19:27:54] [INFO ] [Real]Absence check using state equation in 1937 ms returned sat
[2024-05-31 19:27:55] [INFO ] Deduced a trap composed of 163 places in 366 ms of which 6 ms to minimize.
[2024-05-31 19:27:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:27:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 102 ms returned sat
[2024-05-31 19:27:58] [INFO ] [Nat]Absence check using state equation in 1944 ms returned sat
[2024-05-31 19:27:58] [INFO ] Deduced a trap composed of 163 places in 388 ms of which 6 ms to minimize.
[2024-05-31 19:27:59] [INFO ] Deduced a trap composed of 334 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:27:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 971 ms
[2024-05-31 19:27:59] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 253 ms.
[2024-05-31 19:28:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:28:01] [INFO ] [Real]Absence check using 20 positive place invariants in 102 ms returned sat
[2024-05-31 19:28:03] [INFO ] [Real]Absence check using state equation in 1873 ms returned sat
[2024-05-31 19:28:03] [INFO ] Deduced a trap composed of 161 places in 311 ms of which 6 ms to minimize.
[2024-05-31 19:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:28:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 105 ms returned sat
[2024-05-31 19:28:06] [INFO ] [Nat]Absence check using state equation in 1904 ms returned sat
[2024-05-31 19:28:07] [INFO ] Deduced a trap composed of 161 places in 315 ms of which 5 ms to minimize.
[2024-05-31 19:28:07] [INFO ] Deduced a trap composed of 334 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:28:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 884 ms
[2024-05-31 19:28:07] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 252 ms.
[2024-05-31 19:28:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:28:09] [INFO ] [Real]Absence check using 20 positive place invariants in 101 ms returned sat
[2024-05-31 19:28:11] [INFO ] [Real]Absence check using state equation in 1879 ms returned sat
[2024-05-31 19:28:12] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 250 ms.
[2024-05-31 19:28:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:28:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 102 ms returned sat
[2024-05-31 19:28:15] [INFO ] [Nat]Absence check using state equation in 1832 ms returned sat
[2024-05-31 19:28:15] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 247 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 19:28:18] [INFO ] [Real]Absence check using 20 positive place invariants in 101 ms returned sat
[2024-05-31 19:28:20] [INFO ] [Real]Absence check using state equation in 1764 ms returned sat
[2024-05-31 19:28:20] [INFO ] Deduced a trap composed of 161 places in 356 ms of which 7 ms to minimize.
[2024-05-31 19:28:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:28:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 107 ms returned sat
[2024-05-31 19:28:23] [INFO ] [Nat]Absence check using state equation in 1797 ms returned sat
[2024-05-31 19:28:23] [INFO ] Deduced a trap composed of 161 places in 356 ms of which 7 ms to minimize.
[2024-05-31 19:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 647 ms
[2024-05-31 19:28:24] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 262 ms.
[2024-05-31 19:28:26] [INFO ] Added : 40 causal constraints over 8 iterations in 1921 ms. Result :unknown
[2024-05-31 19:28:26] [INFO ] [Real]Absence check using 20 positive place invariants in 102 ms returned sat
[2024-05-31 19:28:28] [INFO ] [Real]Absence check using state equation in 1825 ms returned sat
[2024-05-31 19:28:29] [INFO ] Deduced a trap composed of 163 places in 304 ms of which 6 ms to minimize.
[2024-05-31 19:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:28:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 101 ms returned sat
[2024-05-31 19:28:31] [INFO ] [Nat]Absence check using state equation in 1824 ms returned sat
[2024-05-31 19:28:32] [INFO ] Deduced a trap composed of 163 places in 285 ms of which 6 ms to minimize.
[2024-05-31 19:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 572 ms
[2024-05-31 19:28:32] [INFO ] Computed and/alt/rep : 4651/7273/4651 causal constraints (skipped 385 transitions) in 261 ms.
[2024-05-31 19:28:34] [INFO ] Added : 45 causal constraints over 9 iterations in 1979 ms. Result :unknown
[2024-05-31 19:28:35] [INFO ] [Real]Absence check using 20 positive place invariants in 115 ms returned sat
[2024-05-31 19:28:36] [INFO ] [Real]Absence check using state equation in 1875 ms returned sat
[2024-05-31 19:28:39] [INFO ] Deduced a trap composed of 1573 places in 2254 ms of which 19 ms to minimize.
[2024-05-31 19:28:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-05-31 19:28:40] [INFO ] [Real]Absence check using 20 positive place invariants in 100 ms returned sat
[2024-05-31 19:28:41] [INFO ] [Real]Absence check using state equation in 1835 ms returned sat
[2024-05-31 19:28:42] [INFO ] Deduced a trap composed of 168 places in 618 ms of which 9 ms to minimize.
[2024-05-31 19:28:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:28:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 104 ms returned sat
[2024-05-31 19:28:45] [INFO ] [Nat]Absence check using state equation in 1852 ms returned sat
[2024-05-31 19:28:46] [INFO ] Deduced a trap composed of 168 places in 589 ms of which 9 ms to minimize.
[2024-05-31 19:28:46] [INFO ] Deduced a trap composed of 332 places in 368 ms of which 7 ms to minimize.
[2024-05-31 19:28:49] [INFO ] Deduced a trap composed of 324 places in 2585 ms of which 30 ms to minimize.
[2024-05-31 19:28:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-05-31 19:28:50] [INFO ] [Real]Absence check using 20 positive place invariants in 99 ms returned sat
[2024-05-31 19:28:52] [INFO ] [Real]Absence check using state equation in 1790 ms returned sat
[2024-05-31 19:28:54] [INFO ] Deduced a trap composed of 110 places in 2434 ms of which 19 ms to minimize.
[2024-05-31 19:28:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-18b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 4298 edges and 4370 vertex of which 110 / 4370 are part of one of the 18 SCC in 15 ms
Free SCC test removed 92 places
Drop transitions (Empty/Sink Transition effects.) removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1063 transitions
Trivial Post-agglo rules discarded 1063 transitions
Performed 1063 trivial Post agglomeration. Transition count delta: 1063
Iterating post reduction 0 with 1063 rules applied. Total rules applied 1064 place count 4278 transition count 3863
Reduce places removed 1063 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1067 rules applied. Total rules applied 2131 place count 3215 transition count 3859
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2135 place count 3211 transition count 3859
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 299 Pre rules applied. Total rules applied 2135 place count 3211 transition count 3560
Deduced a syphon composed of 299 places in 3 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 3 with 598 rules applied. Total rules applied 2733 place count 2912 transition count 3560
Discarding 1767 places :
Symmetric choice reduction at 3 with 1767 rule applications. Total rules 4500 place count 1145 transition count 1793
Iterating global reduction 3 with 1767 rules applied. Total rules applied 6267 place count 1145 transition count 1793
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 6267 place count 1145 transition count 1776
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 6301 place count 1128 transition count 1776
Discarding 287 places :
Symmetric choice reduction at 3 with 287 rule applications. Total rules 6588 place count 841 transition count 1489
Iterating global reduction 3 with 287 rules applied. Total rules applied 6875 place count 841 transition count 1489
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Iterating post reduction 3 with 281 rules applied. Total rules applied 7156 place count 841 transition count 1208
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 7342 place count 748 transition count 1115
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 7378 place count 748 transition count 1079
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 7396 place count 730 transition count 1061
Iterating global reduction 5 with 18 rules applied. Total rules applied 7414 place count 730 transition count 1061
Free-agglomeration rule applied 622 times.
Iterating global reduction 5 with 622 rules applied. Total rules applied 8036 place count 730 transition count 439
Reduce places removed 622 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Graph (complete) has 299 edges and 108 vertex of which 88 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 910 rules applied. Total rules applied 8946 place count 88 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 8974 place count 88 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 8975 place count 87 transition count 123
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 70 edges and 86 vertex of which 28 / 86 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 8977 place count 72 transition count 123
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 9005 place count 72 transition count 95
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 9005 place count 72 transition count 81
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 9033 place count 58 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 9047 place count 58 transition count 67
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 9075 place count 44 transition count 53
Free-agglomeration rule applied 14 times.
Iterating global reduction 10 with 14 rules applied. Total rules applied 9089 place count 44 transition count 39
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 34 rules applied. Total rules applied 9123 place count 24 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 9124 place count 24 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 9125 place count 23 transition count 24
Applied a total of 9125 rules in 944 ms. Remains 23 /4370 variables (removed 4347) and now considering 24/5037 (removed 5013) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 953 ms. Remains : 23/4370 places, 24/5037 transitions.
// Phase 1: matrix 24 rows 23 cols
[2024-05-31 19:28:56] [INFO ] Computed 9 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-18b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 961 ms. (1039 steps per ms)
FORMULA FlexibleBarrier-PT-18b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 284 ms. (3508 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 92033 ms.
ITS solved all properties within timeout

BK_STOP 1717183737378

--------------------
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="FlexibleBarrier-PT-18b"
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 FlexibleBarrier-PT-18b, 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 r496-tall-171640602700125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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