Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853100469.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FlexibleBarrier-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853100469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 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-06b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678485055024

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 21:50:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 21:50:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:50:56] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-10 21:50:56] [INFO ] Transformed 542 places.
[2023-03-10 21:50:56] [INFO ] Transformed 621 transitions.
[2023-03-10 21:50:56] [INFO ] Found NUPN structural information;
[2023-03-10 21:50:56] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 621 rows 542 cols
[2023-03-10 21:50:56] [INFO ] Computed 8 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 190 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :8
FORMULA FlexibleBarrier-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :2
FORMULA FlexibleBarrier-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 21:50:57] [INFO ] Invariant cache hit.
[2023-03-10 21:50:57] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-10 21:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:50:57] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2023-03-10 21:50:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:50:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-10 21:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:50:58] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-10 21:50:58] [INFO ] Deduced a trap composed of 161 places in 386 ms of which 16 ms to minimize.
[2023-03-10 21:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2023-03-10 21:50:58] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 97 ms.
[2023-03-10 21:51:02] [INFO ] Deduced a trap composed of 250 places in 130 ms of which 1 ms to minimize.
[2023-03-10 21:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-10 21:51:02] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 5 ms to minimize.
[2023-03-10 21:51:02] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 21:51:03] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-10 21:51:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:03] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2023-03-10 21:51:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:51:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-10 21:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:03] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-10 21:51:03] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 2 ms to minimize.
[2023-03-10 21:51:03] [INFO ] Deduced a trap composed of 188 places in 155 ms of which 1 ms to minimize.
[2023-03-10 21:51:04] [INFO ] Deduced a trap composed of 195 places in 130 ms of which 0 ms to minimize.
[2023-03-10 21:51:04] [INFO ] Deduced a trap composed of 159 places in 118 ms of which 1 ms to minimize.
[2023-03-10 21:51:04] [INFO ] Deduced a trap composed of 189 places in 96 ms of which 1 ms to minimize.
[2023-03-10 21:51:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 811 ms
[2023-03-10 21:51:04] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 36 ms.
[2023-03-10 21:51:08] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 21:51:08] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-10 21:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:08] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-10 21:51:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:51:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-10 21:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:08] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-10 21:51:08] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 40 ms.
[2023-03-10 21:51:12] [INFO ] Added : 499 causal constraints over 100 iterations in 4076 ms. Result :sat
Minimization took 244 ms.
[2023-03-10 21:51:13] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-10 21:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:13] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-10 21:51:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:51:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-10 21:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:13] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-10 21:51:13] [INFO ] Deduced a trap composed of 231 places in 142 ms of which 1 ms to minimize.
[2023-03-10 21:51:14] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 1 ms to minimize.
[2023-03-10 21:51:14] [INFO ] Deduced a trap composed of 217 places in 130 ms of which 1 ms to minimize.
[2023-03-10 21:51:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 509 ms
[2023-03-10 21:51:14] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 37 ms.
[2023-03-10 21:51:18] [INFO ] Deduced a trap composed of 158 places in 113 ms of which 0 ms to minimize.
[2023-03-10 21:51:18] [INFO ] Deduced a trap composed of 171 places in 114 ms of which 0 ms to minimize.
[2023-03-10 21:51:18] [INFO ] Deduced a trap composed of 161 places in 113 ms of which 2 ms to minimize.
[2023-03-10 21:51:18] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 21:51:18] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-10 21:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:18] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-10 21:51:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:51:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-10 21:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:19] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-10 21:51:19] [INFO ] Deduced a trap composed of 192 places in 113 ms of which 1 ms to minimize.
[2023-03-10 21:51:19] [INFO ] Deduced a trap composed of 161 places in 104 ms of which 1 ms to minimize.
[2023-03-10 21:51:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2023-03-10 21:51:19] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 34 ms.
[2023-03-10 21:51:23] [INFO ] Deduced a trap composed of 163 places in 90 ms of which 0 ms to minimize.
[2023-03-10 21:51:24] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 1 ms to minimize.
[2023-03-10 21:51:24] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 21:51:24] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-10 21:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:24] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-10 21:51:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 21:51:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-10 21:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 21:51:24] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-10 21:51:24] [INFO ] Deduced a trap composed of 186 places in 118 ms of which 1 ms to minimize.
[2023-03-10 21:51:24] [INFO ] Deduced a trap composed of 184 places in 107 ms of which 0 ms to minimize.
[2023-03-10 21:51:24] [INFO ] Deduced a trap composed of 157 places in 85 ms of which 1 ms to minimize.
[2023-03-10 21:51:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2023-03-10 21:51:25] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 34 ms.
[2023-03-10 21:51:28] [INFO ] Added : 475 causal constraints over 95 iterations in 3883 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 518 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 5 ms
Free SCC test removed 32 places
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 510 transition count 435
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 295 place count 363 transition count 435
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 295 place count 363 transition count 406
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 353 place count 334 transition count 406
Discarding 168 places :
Symmetric choice reduction at 2 with 168 rule applications. Total rules 521 place count 166 transition count 238
Iterating global reduction 2 with 168 rules applied. Total rules applied 689 place count 166 transition count 238
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 689 place count 166 transition count 230
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 705 place count 158 transition count 230
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 711 place count 158 transition count 224
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 735 place count 134 transition count 200
Iterating global reduction 3 with 24 rules applied. Total rules applied 759 place count 134 transition count 200
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 783 place count 134 transition count 176
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 839 place count 106 transition count 148
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 845 place count 106 transition count 142
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 849 place count 102 transition count 138
Iterating global reduction 5 with 4 rules applied. Total rules applied 853 place count 102 transition count 138
Free-agglomeration rule applied 63 times.
Iterating global reduction 5 with 63 rules applied. Total rules applied 916 place count 102 transition count 75
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 98 edges and 39 vertex of which 24 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 89 rules applied. Total rules applied 1005 place count 24 transition count 50
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1026 place count 24 transition count 29
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1027 place count 24 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1028 place count 23 transition count 28
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t536.t280.t281 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 1032 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1037 place count 18 transition count 21
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 1037 place count 18 transition count 17
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1045 place count 14 transition count 17
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1047 place count 14 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1049 place count 13 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1050 place count 13 transition count 13
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1052 place count 13 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1054 place count 11 transition count 11
Applied a total of 1054 rules in 105 ms. Remains 11 /542 variables (removed 531) and now considering 11/621 (removed 610) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 11/542 places, 11/621 transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-10 21:51:29] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=1984 ) properties (out of 4) seen :4
FORMULA FlexibleBarrier-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 33387 ms.
ITS solved all properties within timeout

BK_STOP 1678485091019

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-06b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is FlexibleBarrier-PT-06b, 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 r167-tall-167838853100469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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