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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 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:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 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 1.5M 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-20b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678490900990

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-20b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 23:28:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 23:28:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:28:22] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2023-03-10 23:28:22] [INFO ] Transformed 5372 places.
[2023-03-10 23:28:22] [INFO ] Transformed 6193 transitions.
[2023-03-10 23:28:22] [INFO ] Found NUPN structural information;
[2023-03-10 23:28:22] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 6193 rows 5372 cols
[2023-03-10 23:28:23] [INFO ] Computed 22 place invariants in 209 ms
Incomplete random walk after 10000 steps, including 74 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :4
FORMULA FlexibleBarrier-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
[2023-03-10 23:28:23] [INFO ] Invariant cache hit.
[2023-03-10 23:28:24] [INFO ] [Real]Absence check using 22 positive place invariants in 119 ms returned sat
[2023-03-10 23:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:28:28] [INFO ] [Real]Absence check using state equation in 3553 ms returned sat
[2023-03-10 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:28:29] [INFO ] [Nat]Absence check using 22 positive place invariants in 116 ms returned sat
[2023-03-10 23:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:28:32] [INFO ] [Nat]Absence check using state equation in 3731 ms returned sat
[2023-03-10 23:28:36] [INFO ] Deduced a trap composed of 2027 places in 3722 ms of which 11 ms to minimize.
[2023-03-10 23:28:36] [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.verifyPossible(DeadlockTester.java:916)
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 23:28:37] [INFO ] [Real]Absence check using 22 positive place invariants in 124 ms returned sat
[2023-03-10 23:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:28:41] [INFO ] [Real]Absence check using state equation in 3458 ms returned sat
[2023-03-10 23:28:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:28:41] [INFO ] [Nat]Absence check using 22 positive place invariants in 124 ms returned sat
[2023-03-10 23:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:28:45] [INFO ] [Nat]Absence check using state equation in 3477 ms returned sat
[2023-03-10 23:28:49] [INFO ] Deduced a trap composed of 2050 places in 3548 ms of which 4 ms to minimize.
[2023-03-10 23: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 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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 23:28:49] [INFO ] [Real]Absence check using 22 positive place invariants in 110 ms returned sat
[2023-03-10 23:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:28:53] [INFO ] [Real]Absence check using state equation in 3444 ms returned sat
[2023-03-10 23:28:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:28:54] [INFO ] [Nat]Absence check using 22 positive place invariants in 119 ms returned sat
[2023-03-10 23:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:28:57] [INFO ] [Nat]Absence check using state equation in 3527 ms returned sat
[2023-03-10 23:29:01] [INFO ] Deduced a trap composed of 1990 places in 3735 ms of which 3 ms to minimize.
[2023-03-10 23:29:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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.verifyPossible(DeadlockTester.java:916)
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 23:29:02] [INFO ] [Real]Absence check using 22 positive place invariants in 108 ms returned sat
[2023-03-10 23:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:06] [INFO ] [Real]Absence check using state equation in 3484 ms returned sat
[2023-03-10 23:29:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:29:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 128 ms returned sat
[2023-03-10 23:29:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:10] [INFO ] [Nat]Absence check using state equation in 3539 ms returned sat
[2023-03-10 23:29:14] [INFO ] Deduced a trap composed of 1962 places in 3469 ms of which 4 ms to minimize.
[2023-03-10 23:29:14] [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.verifyPossible(DeadlockTester.java:916)
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 23:29:14] [INFO ] [Real]Absence check using 22 positive place invariants in 106 ms returned sat
[2023-03-10 23:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:18] [INFO ] [Real]Absence check using state equation in 3372 ms returned sat
[2023-03-10 23:29:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:29:19] [INFO ] [Nat]Absence check using 22 positive place invariants in 116 ms returned sat
[2023-03-10 23:29:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:22] [INFO ] [Nat]Absence check using state equation in 3577 ms returned sat
[2023-03-10 23:29:26] [INFO ] Deduced a trap composed of 2117 places in 3557 ms of which 4 ms to minimize.
[2023-03-10 23:29:26] [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.verifyPossible(DeadlockTester.java:916)
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 23:29:27] [INFO ] [Real]Absence check using 22 positive place invariants in 110 ms returned sat
[2023-03-10 23:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:30] [INFO ] [Real]Absence check using state equation in 3439 ms returned sat
[2023-03-10 23:29:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:29:31] [INFO ] [Nat]Absence check using 22 positive place invariants in 113 ms returned sat
[2023-03-10 23:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:35] [INFO ] [Nat]Absence check using state equation in 3477 ms returned sat
[2023-03-10 23:29:38] [INFO ] Deduced a trap composed of 2042 places in 3577 ms of which 3 ms to minimize.
[2023-03-10 23:29:38] [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 5
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.verifyPossible(DeadlockTester.java:916)
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 23:29:39] [INFO ] [Real]Absence check using 22 positive place invariants in 108 ms returned sat
[2023-03-10 23:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:43] [INFO ] [Real]Absence check using state equation in 3461 ms returned sat
[2023-03-10 23:29:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:29:44] [INFO ] [Nat]Absence check using 22 positive place invariants in 110 ms returned sat
[2023-03-10 23:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:47] [INFO ] [Nat]Absence check using state equation in 3416 ms returned sat
[2023-03-10 23:29:51] [INFO ] Deduced a trap composed of 2015 places in 3597 ms of which 4 ms to minimize.
[2023-03-10 23:29:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 23:29:52] [INFO ] [Real]Absence check using 22 positive place invariants in 115 ms returned sat
[2023-03-10 23:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:55] [INFO ] [Real]Absence check using state equation in 3448 ms returned sat
[2023-03-10 23:29:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:29:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 116 ms returned sat
[2023-03-10 23:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:29:59] [INFO ] [Nat]Absence check using state equation in 3512 ms returned sat
[2023-03-10 23:30:03] [INFO ] Deduced a trap composed of 1970 places in 3371 ms of which 3 ms to minimize.
[2023-03-10 23:30:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 23:30:04] [INFO ] [Real]Absence check using 22 positive place invariants in 107 ms returned sat
[2023-03-10 23:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:07] [INFO ] [Real]Absence check using state equation in 3457 ms returned sat
[2023-03-10 23:30:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:08] [INFO ] [Nat]Absence check using 22 positive place invariants in 111 ms returned sat
[2023-03-10 23:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:11] [INFO ] [Nat]Absence check using state equation in 3449 ms returned sat
[2023-03-10 23:30:15] [INFO ] Deduced a trap composed of 2011 places in 3596 ms of which 4 ms to minimize.
[2023-03-10 23:30:15] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 23:30:16] [INFO ] [Real]Absence check using 22 positive place invariants in 116 ms returned sat
[2023-03-10 23:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:19] [INFO ] [Real]Absence check using state equation in 3332 ms returned sat
[2023-03-10 23:30:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:20] [INFO ] [Nat]Absence check using 22 positive place invariants in 112 ms returned sat
[2023-03-10 23:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:24] [INFO ] [Nat]Absence check using state equation in 3367 ms returned sat
[2023-03-10 23:30:27] [INFO ] Deduced a trap composed of 2055 places in 3656 ms of which 4 ms to minimize.
[2023-03-10 23:30:27] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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 23:30:28] [INFO ] [Real]Absence check using 22 positive place invariants in 111 ms returned sat
[2023-03-10 23:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:32] [INFO ] [Real]Absence check using state equation in 3431 ms returned sat
[2023-03-10 23:30:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 115 ms returned sat
[2023-03-10 23:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:36] [INFO ] [Nat]Absence check using state equation in 3518 ms returned sat
[2023-03-10 23:30:37] [INFO ] Deduced a trap composed of 543 places in 811 ms of which 1 ms to minimize.
[2023-03-10 23:30:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 5292 edges and 5372 vertex of which 122 / 5372 are part of one of the 20 SCC in 17 ms
Free SCC test removed 102 places
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Drop transitions removed 1301 transitions
Trivial Post-agglo rules discarded 1301 transitions
Performed 1301 trivial Post agglomeration. Transition count delta: 1301
Iterating post reduction 0 with 1301 rules applied. Total rules applied 1302 place count 5270 transition count 4769
Reduce places removed 1301 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1306 rules applied. Total rules applied 2608 place count 3969 transition count 4764
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2613 place count 3964 transition count 4764
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 374 Pre rules applied. Total rules applied 2613 place count 3964 transition count 4390
Deduced a syphon composed of 374 places in 4 ms
Reduce places removed 374 places and 0 transitions.
Iterating global reduction 3 with 748 rules applied. Total rules applied 3361 place count 3590 transition count 4390
Discarding 2202 places :
Symmetric choice reduction at 3 with 2202 rule applications. Total rules 5563 place count 1388 transition count 2188
Iterating global reduction 3 with 2202 rules applied. Total rules applied 7765 place count 1388 transition count 2188
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 7765 place count 1388 transition count 2170
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 7801 place count 1370 transition count 2170
Discarding 356 places :
Symmetric choice reduction at 3 with 356 rule applications. Total rules 8157 place count 1014 transition count 1814
Iterating global reduction 3 with 356 rules applied. Total rules applied 8513 place count 1014 transition count 1814
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 3 with 352 rules applied. Total rules applied 8865 place count 1014 transition count 1462
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 9073 place count 910 transition count 1358
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 9113 place count 910 transition count 1318
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 9133 place count 890 transition count 1298
Iterating global reduction 5 with 20 rules applied. Total rules applied 9153 place count 890 transition count 1298
Free-agglomeration rule applied 771 times.
Iterating global reduction 5 with 771 rules applied. Total rules applied 9924 place count 890 transition count 527
Reduce places removed 771 places and 0 transitions.
Drop transitions removed 359 transitions
Reduce isomorphic transitions removed 359 transitions.
Graph (complete) has 331 edges and 119 vertex of which 79 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1131 rules applied. Total rules applied 11055 place count 79 transition count 168
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 6 with 56 rules applied. Total rules applied 11111 place count 79 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 11112 place count 78 transition count 111
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 77 vertex of which 24 / 77 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 11114 place count 65 transition count 111
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 11138 place count 65 transition count 87
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 11138 place count 65 transition count 75
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 11162 place count 53 transition count 75
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 11174 place count 53 transition count 63
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 11198 place count 41 transition count 51
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 11210 place count 41 transition count 39
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 30 rules applied. Total rules applied 11240 place count 23 transition count 27
Applied a total of 11240 rules in 1193 ms. Remains 23 /5372 variables (removed 5349) and now considering 27/6193 (removed 6166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1193 ms. Remains : 23/5372 places, 27/6193 transitions.
// Phase 1: matrix 27 rows 23 cols
[2023-03-10 23:30:38] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 11) seen :11
FORMULA FlexibleBarrier-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 137252 ms.
ITS solved all properties within timeout

BK_STOP 1678491040492

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

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