fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857400549
Last Updated
May 14, 2023

About the Execution of Marcie+red for FlexibleBarrier-PT-16b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
505.212 94839.00 115024.00 415.10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r170-tall-167838857400549.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 marciexred
Input is FlexibleBarrier-PT-16b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857400549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 10K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:26 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 945K 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-16b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678570227838

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 21:30:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 21:30:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 21:30:29] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-11 21:30:29] [INFO ] Transformed 3472 places.
[2023-03-11 21:30:29] [INFO ] Transformed 4001 transitions.
[2023-03-11 21:30:29] [INFO ] Found NUPN structural information;
[2023-03-11 21:30:29] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 4001 rows 3472 cols
[2023-03-11 21:30:29] [INFO ] Computed 18 place invariants in 138 ms
Incomplete random walk after 10000 steps, including 90 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :4
FORMULA FlexibleBarrier-PT-16b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 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 8 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-16b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 21:30:30] [INFO ] Invariant cache hit.
[2023-03-11 21:30:30] [INFO ] [Real]Absence check using 18 positive place invariants in 84 ms returned sat
[2023-03-11 21:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:30:32] [INFO ] [Real]Absence check using state equation in 1559 ms returned sat
[2023-03-11 21:30:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:30:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 66 ms returned sat
[2023-03-11 21:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:30:34] [INFO ] [Nat]Absence check using state equation in 1732 ms returned sat
[2023-03-11 21:30:36] [INFO ] Deduced a trap composed of 1310 places in 1825 ms of which 8 ms to minimize.
[2023-03-11 21:30:38] [INFO ] Deduced a trap composed of 1335 places in 1862 ms of which 5 ms to minimize.
[2023-03-11 21:30: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 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-11 21:30:39] [INFO ] [Real]Absence check using 18 positive place invariants in 63 ms returned sat
[2023-03-11 21:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:30:41] [INFO ] [Real]Absence check using state equation in 1658 ms returned sat
[2023-03-11 21:30:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:30:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 64 ms returned sat
[2023-03-11 21:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:30:43] [INFO ] [Nat]Absence check using state equation in 1621 ms returned sat
[2023-03-11 21:30:45] [INFO ] Deduced a trap composed of 1290 places in 1702 ms of which 11 ms to minimize.
[2023-03-11 21:30:47] [INFO ] Deduced a trap composed of 1307 places in 1760 ms of which 2 ms to minimize.
[2023-03-11 21:30:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-11 21:30:47] [INFO ] [Real]Absence check using 18 positive place invariants in 63 ms returned sat
[2023-03-11 21:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:30:49] [INFO ] [Real]Absence check using state equation in 1800 ms returned sat
[2023-03-11 21:30:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:30:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 64 ms returned sat
[2023-03-11 21:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:30:51] [INFO ] [Nat]Absence check using state equation in 1830 ms returned sat
[2023-03-11 21:30:53] [INFO ] Deduced a trap composed of 1388 places in 1584 ms of which 2 ms to minimize.
[2023-03-11 21:30:55] [INFO ] Deduced a trap composed of 106 places in 1456 ms of which 2 ms to minimize.
[2023-03-11 21:30:55] [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-11 21:30:55] [INFO ] [Real]Absence check using 18 positive place invariants in 60 ms returned sat
[2023-03-11 21:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:30:57] [INFO ] [Real]Absence check using state equation in 1695 ms returned sat
[2023-03-11 21:30:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:30:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 62 ms returned sat
[2023-03-11 21:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:30:59] [INFO ] [Nat]Absence check using state equation in 1705 ms returned sat
[2023-03-11 21:31:00] [INFO ] Deduced a trap composed of 28 places in 517 ms of which 1 ms to minimize.
[2023-03-11 21:31:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 757 ms
[2023-03-11 21:31:00] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 242 ms.
[2023-03-11 21:31: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 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.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-11 21:31:02] [INFO ] [Real]Absence check using 18 positive place invariants in 60 ms returned sat
[2023-03-11 21:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:04] [INFO ] [Real]Absence check using state equation in 1761 ms returned sat
[2023-03-11 21:31:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:31:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 62 ms returned sat
[2023-03-11 21:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:06] [INFO ] [Nat]Absence check using state equation in 1674 ms returned sat
[2023-03-11 21:31:08] [INFO ] Deduced a trap composed of 1268 places in 1621 ms of which 3 ms to minimize.
[2023-03-11 21:31:10] [INFO ] Deduced a trap composed of 1299 places in 1554 ms of which 2 ms to minimize.
[2023-03-11 21:31:10] [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-11 21:31:10] [INFO ] [Real]Absence check using 18 positive place invariants in 63 ms returned sat
[2023-03-11 21:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:12] [INFO ] [Real]Absence check using state equation in 1586 ms returned sat
[2023-03-11 21:31:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:31:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 65 ms returned sat
[2023-03-11 21:31:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:14] [INFO ] [Nat]Absence check using state equation in 1695 ms returned sat
[2023-03-11 21:31:16] [INFO ] Deduced a trap composed of 280 places in 1637 ms of which 2 ms to minimize.
[2023-03-11 21:31:18] [INFO ] Deduced a trap composed of 1253 places in 1649 ms of which 3 ms to minimize.
[2023-03-11 21:31: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 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-11 21:31:18] [INFO ] [Real]Absence check using 18 positive place invariants in 61 ms returned sat
[2023-03-11 21:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:20] [INFO ] [Real]Absence check using state equation in 1815 ms returned sat
[2023-03-11 21:31:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:31:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 65 ms returned sat
[2023-03-11 21:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:23] [INFO ] [Nat]Absence check using state equation in 1782 ms returned sat
[2023-03-11 21:31:23] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 203 ms.
[2023-03-11 21:31:28] [INFO ] Deduced a trap composed of 226 places in 2501 ms of which 3 ms to minimize.
[2023-03-11 21:31:28] [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.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-11 21:31:28] [INFO ] [Real]Absence check using 18 positive place invariants in 65 ms returned sat
[2023-03-11 21:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:30] [INFO ] [Real]Absence check using state equation in 1644 ms returned sat
[2023-03-11 21:31:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:31:31] [INFO ] [Nat]Absence check using 18 positive place invariants in 61 ms returned sat
[2023-03-11 21:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:32] [INFO ] [Nat]Absence check using state equation in 1657 ms returned sat
[2023-03-11 21:31:34] [INFO ] Deduced a trap composed of 1288 places in 1684 ms of which 2 ms to minimize.
[2023-03-11 21:31:36] [INFO ] Deduced a trap composed of 1421 places in 1630 ms of which 2 ms to minimize.
[2023-03-11 21:31: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 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-11 21:31:36] [INFO ] [Real]Absence check using 18 positive place invariants in 64 ms returned sat
[2023-03-11 21:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:38] [INFO ] [Real]Absence check using state equation in 1556 ms returned sat
[2023-03-11 21:31:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:31:38] [INFO ] [Nat]Absence check using 18 positive place invariants in 72 ms returned sat
[2023-03-11 21:31:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:40] [INFO ] [Nat]Absence check using state equation in 1674 ms returned sat
[2023-03-11 21:31:42] [INFO ] Deduced a trap composed of 1300 places in 1776 ms of which 3 ms to minimize.
[2023-03-11 21:31:44] [INFO ] Deduced a trap composed of 1232 places in 1626 ms of which 3 ms to minimize.
[2023-03-11 21:31:44] [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-11 21:31:44] [INFO ] [Real]Absence check using 18 positive place invariants in 58 ms returned sat
[2023-03-11 21:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:46] [INFO ] [Real]Absence check using state equation in 1628 ms returned sat
[2023-03-11 21:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:31:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 66 ms returned sat
[2023-03-11 21:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:48] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2023-03-11 21:31:50] [INFO ] Deduced a trap composed of 416 places in 1804 ms of which 3 ms to minimize.
[2023-03-11 21:31:52] [INFO ] Deduced a trap composed of 305 places in 1788 ms of which 2 ms to minimize.
[2023-03-11 21:31:52] [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-11 21:31:52] [INFO ] [Real]Absence check using 18 positive place invariants in 61 ms returned sat
[2023-03-11 21:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:54] [INFO ] [Real]Absence check using state equation in 1586 ms returned sat
[2023-03-11 21:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 21:31:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 64 ms returned sat
[2023-03-11 21:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 21:31:56] [INFO ] [Nat]Absence check using state equation in 1597 ms returned sat
[2023-03-11 21:31:58] [INFO ] Deduced a trap composed of 277 places in 1672 ms of which 2 ms to minimize.
[2023-03-11 21:32:00] [INFO ] Deduced a trap composed of 1302 places in 1616 ms of which 2 ms to minimize.
[2023-03-11 21:32:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 3472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 3403 edges and 3472 vertex of which 98 / 3472 are part of one of the 16 SCC in 12 ms
Free SCC test removed 82 places
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions removed 850 transitions
Trivial Post-agglo rules discarded 850 transitions
Performed 850 trivial Post agglomeration. Transition count delta: 850
Iterating post reduction 0 with 850 rules applied. Total rules applied 851 place count 3390 transition count 3052
Reduce places removed 850 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 857 rules applied. Total rules applied 1708 place count 2540 transition count 3045
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1715 place count 2533 transition count 3045
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 1715 place count 2533 transition count 2812
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 2181 place count 2300 transition count 2812
Discarding 1378 places :
Symmetric choice reduction at 3 with 1378 rule applications. Total rules 3559 place count 922 transition count 1434
Iterating global reduction 3 with 1378 rules applied. Total rules applied 4937 place count 922 transition count 1434
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 4937 place count 922 transition count 1420
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 4965 place count 908 transition count 1420
Discarding 221 places :
Symmetric choice reduction at 3 with 221 rule applications. Total rules 5186 place count 687 transition count 1199
Iterating global reduction 3 with 221 rules applied. Total rules applied 5407 place count 687 transition count 1199
Ensure Unique test removed 218 transitions
Reduce isomorphic transitions removed 218 transitions.
Iterating post reduction 3 with 218 rules applied. Total rules applied 5625 place count 687 transition count 981
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 5793 place count 603 transition count 897
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 5825 place count 603 transition count 865
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 5841 place count 587 transition count 849
Iterating global reduction 5 with 16 rules applied. Total rules applied 5857 place count 587 transition count 849
Free-agglomeration rule applied 489 times.
Iterating global reduction 5 with 489 rules applied. Total rules applied 6346 place count 587 transition count 360
Reduce places removed 489 places and 0 transitions.
Drop transitions removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 274 edges and 98 vertex of which 83 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 711 rules applied. Total rules applied 7057 place count 83 transition count 139
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 7078 place count 83 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 7079 place count 82 transition count 117
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 65 edges and 81 vertex of which 26 / 81 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 7081 place count 68 transition count 117
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 7107 place count 68 transition count 91
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 13 Pre rules applied. Total rules applied 7107 place count 68 transition count 78
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 7133 place count 55 transition count 78
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 7146 place count 55 transition count 65
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 7172 place count 42 transition count 52
Free-agglomeration rule applied 13 times.
Iterating global reduction 10 with 13 rules applied. Total rules applied 7185 place count 42 transition count 39
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 33 rules applied. Total rules applied 7218 place count 22 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 7219 place count 22 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 7220 place count 21 transition count 25
Applied a total of 7220 rules in 725 ms. Remains 21 /3472 variables (removed 3451) and now considering 25/4001 (removed 3976) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 725 ms. Remains : 21/3472 places, 25/4001 transitions.
// Phase 1: matrix 25 rows 21 cols
[2023-03-11 21:32:00] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 11) seen :11
FORMULA FlexibleBarrier-PT-16b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 92568 ms.
ITS solved all properties within timeout

BK_STOP 1678570322677

--------------------
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-16b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is FlexibleBarrier-PT-16b, 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 r170-tall-167838857400549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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