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.r231-tall-167856416800917.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 MultiCrashLeafsetExtension-PT-S32C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416800917
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.4K Feb 26 03:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 03:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K Feb 26 03:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 232K Feb 26 03:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 03:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 22M 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 MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679512590067

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=MultiCrashLeafsetExtension-PT-S32C05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 19:16:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 19:16:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:16:32] [INFO ] Load time of PNML (sax parser for PT used): 817 ms
[2023-03-22 19:16:32] [INFO ] Transformed 20498 places.
[2023-03-22 19:16:32] [INFO ] Transformed 31713 transitions.
[2023-03-22 19:16:32] [INFO ] Parsed PT model containing 20498 places and 31713 transitions and 126502 arcs in 1112 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 30657 out of 31713 initially.
// Phase 1: matrix 30657 rows 20498 cols
[2023-03-22 19:16:36] [INFO ] Computed 1543 place invariants in 3086 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 194 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :0
[2023-03-22 19:16:37] [INFO ] Flow matrix only has 30657 transitions (discarded 1056 similar events)
// Phase 1: matrix 30657 rows 20498 cols
[2023-03-22 19:16:40] [INFO ] Computed 1543 place invariants in 3021 ms
[2023-03-22 19:16:43] [INFO ] [Real]Absence check using 80 positive place invariants in 701 ms returned sat
[2023-03-22 19:16:44] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 561 ms returned unsat
[2023-03-22 19:16:47] [INFO ] [Real]Absence check using 80 positive place invariants in 717 ms returned sat
[2023-03-22 19:16:48] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 770 ms returned unsat
[2023-03-22 19:16:50] [INFO ] [Real]Absence check using 80 positive place invariants in 670 ms returned sat
[2023-03-22 19:16:51] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 444 ms returned unsat
[2023-03-22 19:16:53] [INFO ] [Real]Absence check using 80 positive place invariants in 680 ms returned sat
[2023-03-22 19:16:54] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 462 ms returned unsat
[2023-03-22 19:16:57] [INFO ] [Real]Absence check using 80 positive place invariants in 664 ms returned sat
[2023-03-22 19:16:58] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1175 ms returned sat
[2023-03-22 19:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:16:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:02] [INFO ] [Real]Absence check using 80 positive place invariants in 672 ms returned sat
[2023-03-22 19:17:03] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1289 ms returned sat
[2023-03-22 19:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:07] [INFO ] [Real]Absence check using 80 positive place invariants in 714 ms returned sat
[2023-03-22 19:17:08] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1276 ms returned sat
[2023-03-22 19:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:12] [INFO ] [Real]Absence check using 80 positive place invariants in 693 ms returned sat
[2023-03-22 19:17:13] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1346 ms returned sat
[2023-03-22 19:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:17] [INFO ] [Real]Absence check using 80 positive place invariants in 668 ms returned sat
[2023-03-22 19:17:18] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1246 ms returned sat
[2023-03-22 19:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:22] [INFO ] [Real]Absence check using 80 positive place invariants in 669 ms returned sat
[2023-03-22 19:17:23] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 748 ms returned unsat
[2023-03-22 19:17:25] [INFO ] [Real]Absence check using 80 positive place invariants in 699 ms returned sat
[2023-03-22 19:17:27] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1239 ms returned sat
[2023-03-22 19:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:30] [INFO ] [Real]Absence check using 80 positive place invariants in 686 ms returned sat
[2023-03-22 19:17:31] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1168 ms returned sat
[2023-03-22 19:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:35] [INFO ] [Real]Absence check using 80 positive place invariants in 682 ms returned sat
[2023-03-22 19:17:37] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1399 ms returned sat
[2023-03-22 19:17:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:40] [INFO ] [Real]Absence check using 80 positive place invariants in 687 ms returned sat
[2023-03-22 19:17:42] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1340 ms returned sat
[2023-03-22 19:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-22 19:17:45] [INFO ] [Real]Absence check using 80 positive place invariants in 697 ms returned sat
[2023-03-22 19:17:47] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1215 ms returned sat
[2023-03-22 19:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:17:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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, 99, 1, 99, 99, 1, 1, 1, 1, 33, 33, 99] Max seen :[1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 20498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20498/20498 places, 31713/31713 transitions.
Graph (complete) has 72683 edges and 20498 vertex of which 20452 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.51 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions removed 5274 transitions
Trivial Post-agglo rules discarded 5274 transitions
Performed 5274 trivial Post agglomeration. Transition count delta: 5274
Iterating post reduction 0 with 5274 rules applied. Total rules applied 5275 place count 20452 transition count 26439
Reduce places removed 5274 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5278 rules applied. Total rules applied 10553 place count 15178 transition count 26435
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 10557 place count 15174 transition count 26435
Performed 330 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 330 Pre rules applied. Total rules applied 10557 place count 15174 transition count 26105
Deduced a syphon composed of 330 places in 44 ms
Reduce places removed 330 places and 0 transitions.
Iterating global reduction 3 with 660 rules applied. Total rules applied 11217 place count 14844 transition count 26105
Discarding 4944 places :
Symmetric choice reduction at 3 with 4944 rule applications. Total rules 16161 place count 9900 transition count 21161
Iterating global reduction 3 with 4944 rules applied. Total rules applied 21105 place count 9900 transition count 21161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 21105 place count 9900 transition count 21155
Deduced a syphon composed of 6 places in 22 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 21117 place count 9894 transition count 21155
Discarding 984 places :
Symmetric choice reduction at 3 with 984 rule applications. Total rules 22101 place count 8910 transition count 16235
Iterating global reduction 3 with 984 rules applied. Total rules applied 23085 place count 8910 transition count 16235
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 18 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 23151 place count 8877 transition count 16202
Free-agglomeration rule (complex) applied 582 times.
Iterating global reduction 3 with 582 rules applied. Total rules applied 23733 place count 8877 transition count 19556
Reduce places removed 582 places and 0 transitions.
Iterating post reduction 3 with 582 rules applied. Total rules applied 24315 place count 8295 transition count 19556
Partial Free-agglomeration rule applied 132 times.
Drop transitions removed 132 transitions
Iterating global reduction 4 with 132 rules applied. Total rules applied 24447 place count 8295 transition count 19556
Applied a total of 24447 rules in 15057 ms. Remains 8295 /20498 variables (removed 12203) and now considering 19556/31713 (removed 12157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15061 ms. Remains : 8295/20498 places, 19556/31713 transitions.
Normalized transition count is 17990 out of 19556 initially.
// Phase 1: matrix 17990 rows 8295 cols
[2023-03-22 19:18:04] [INFO ] Computed 1497 place invariants in 893 ms
Interrupted random walk after 594595 steps, including 19072 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 6
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 834333 steps, including 2481 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 1
Interrupted Best-First random walk after 859555 steps, including 2556 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 1
Interrupted Best-First random walk after 863363 steps, including 2568 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 3
Interrupted Best-First random walk after 837029 steps, including 2489 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 3
Interrupted Best-First random walk after 851909 steps, including 2533 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 3
Interrupted Best-First random walk after 864724 steps, including 2572 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 0
Interrupted Best-First random walk after 878402 steps, including 2612 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 2
Interrupted Best-First random walk after 861884 steps, including 2563 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 0
[2023-03-22 19:19:14] [INFO ] Flow matrix only has 17990 transitions (discarded 1566 similar events)
// Phase 1: matrix 17990 rows 8295 cols
[2023-03-22 19:19:15] [INFO ] Computed 1497 place invariants in 892 ms
[2023-03-22 19:19:15] [INFO ] [Real]Absence check using 63 positive place invariants in 149 ms returned sat
[2023-03-22 19:19:16] [INFO ] [Real]Absence check using 63 positive and 1434 generalized place invariants in 275 ms returned unsat
[2023-03-22 19:19:17] [INFO ] [Real]Absence check using 63 positive place invariants in 167 ms returned sat
[2023-03-22 19:19:17] [INFO ] [Real]Absence check using 63 positive and 1434 generalized place invariants in 516 ms returned sat
[2023-03-22 19:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:19:29] [INFO ] [Real]Absence check using state equation in 11444 ms returned sat
[2023-03-22 19:19:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:19:30] [INFO ] [Nat]Absence check using 63 positive place invariants in 143 ms returned sat
[2023-03-22 19:19:30] [INFO ] [Nat]Absence check using 63 positive and 1434 generalized place invariants in 507 ms returned sat
[2023-03-22 19:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:19:42] [INFO ] [Nat]Absence check using state equation in 11321 ms returned sat
[2023-03-22 19:19:42] [INFO ] State equation strengthened by 10210 read => feed constraints.
[2023-03-22 19:19:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 19:19:48] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6497 ms returned unknown
[2023-03-22 19:19:49] [INFO ] [Real]Absence check using 63 positive place invariants in 143 ms returned sat
[2023-03-22 19:19:50] [INFO ] [Real]Absence check using 63 positive and 1434 generalized place invariants in 425 ms returned unsat
[2023-03-22 19:19:50] [INFO ] [Real]Absence check using 63 positive place invariants in 139 ms returned sat
[2023-03-22 19:19:51] [INFO ] [Real]Absence check using 63 positive and 1434 generalized place invariants in 305 ms returned unsat
[2023-03-22 19:19:52] [INFO ] [Real]Absence check using 63 positive place invariants in 151 ms returned sat
[2023-03-22 19:19:52] [INFO ] [Real]Absence check using 63 positive and 1434 generalized place invariants in 495 ms returned sat
[2023-03-22 19:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:20:03] [INFO ] [Real]Absence check using state equation in 11159 ms returned sat
[2023-03-22 19:20:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:20:05] [INFO ] [Nat]Absence check using 63 positive place invariants in 146 ms returned sat
[2023-03-22 19:20:05] [INFO ] [Nat]Absence check using 63 positive and 1434 generalized place invariants in 496 ms returned sat
[2023-03-22 19:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:20:16] [INFO ] [Nat]Absence check using state equation in 11296 ms returned sat
[2023-03-22 19:20:19] [INFO ] [Nat]Added 10210 Read/Feed constraints in 3122 ms returned unsat
[2023-03-22 19:20:20] [INFO ] [Real]Absence check using 63 positive place invariants in 135 ms returned sat
[2023-03-22 19:20:21] [INFO ] [Real]Absence check using 63 positive and 1434 generalized place invariants in 490 ms returned sat
[2023-03-22 19:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:20:32] [INFO ] [Real]Absence check using state equation in 11597 ms returned sat
[2023-03-22 19:20:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:20:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 140 ms returned sat
[2023-03-22 19:20:34] [INFO ] [Nat]Absence check using 63 positive and 1434 generalized place invariants in 490 ms returned sat
[2023-03-22 19:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:20:46] [INFO ] [Nat]Absence check using state equation in 11874 ms returned sat
[2023-03-22 19:20:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 19:20:53] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6584 ms returned unknown
[2023-03-22 19:20:53] [INFO ] [Real]Absence check using 63 positive place invariants in 157 ms returned sat
[2023-03-22 19:20:54] [INFO ] [Real]Absence check using 63 positive and 1434 generalized place invariants in 516 ms returned sat
[2023-03-22 19:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:21:05] [INFO ] [Real]Absence check using state equation in 10739 ms returned sat
[2023-03-22 19:21:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:21:06] [INFO ] [Nat]Absence check using 63 positive place invariants in 142 ms returned sat
[2023-03-22 19:21:07] [INFO ] [Nat]Absence check using 63 positive and 1434 generalized place invariants in 508 ms returned sat
[2023-03-22 19:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:21:20] [INFO ] [Nat]Absence check using state equation in 12970 ms returned sat
[2023-03-22 19:21:22] [INFO ] [Nat]Added 10210 Read/Feed constraints in 2378 ms returned unsat
[2023-03-22 19:21:23] [INFO ] [Real]Absence check using 63 positive place invariants in 148 ms returned sat
[2023-03-22 19:21:23] [INFO ] [Real]Absence check using 63 positive and 1434 generalized place invariants in 388 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 0, 1, 0, 1] Max seen :[1, 0, 1, 1, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 8295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8295/8295 places, 19556/19556 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8295 transition count 19554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8293 transition count 19554
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 8292 transition count 19553
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 8292 transition count 19553
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 8292 transition count 19549
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 8288 transition count 19549
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 8283 transition count 19544
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 8283 transition count 19544
Applied a total of 24 rules in 6618 ms. Remains 8283 /8295 variables (removed 12) and now considering 19544/19556 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6618 ms. Remains : 8283/8295 places, 19544/19556 transitions.
Normalized transition count is 17978 out of 19544 initially.
// Phase 1: matrix 17978 rows 8283 cols
[2023-03-22 19:21:31] [INFO ] Computed 1497 place invariants in 897 ms
Interrupted random walk after 589901 steps, including 18920 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 875276 steps, including 2603 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Interrupted Best-First random walk after 861808 steps, including 2563 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 0
[2023-03-22 19:22:11] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
// Phase 1: matrix 17978 rows 8283 cols
[2023-03-22 19:22:12] [INFO ] Computed 1497 place invariants in 888 ms
[2023-03-22 19:22:13] [INFO ] [Real]Absence check using 65 positive place invariants in 184 ms returned sat
[2023-03-22 19:22:13] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 478 ms returned sat
[2023-03-22 19:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:22:26] [INFO ] [Real]Absence check using state equation in 12685 ms returned sat
[2023-03-22 19:22:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:22:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 200 ms returned sat
[2023-03-22 19:22:28] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 515 ms returned sat
[2023-03-22 19:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:22:41] [INFO ] [Nat]Absence check using state equation in 13534 ms returned sat
[2023-03-22 19:22:41] [INFO ] State equation strengthened by 10210 read => feed constraints.
[2023-03-22 19:22:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 19:22:46] [INFO ] [Nat]Added 10210 Read/Feed constraints in 4428 ms returned unsat
[2023-03-22 19:22:47] [INFO ] [Real]Absence check using 65 positive place invariants in 169 ms returned sat
[2023-03-22 19:22:47] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 475 ms returned sat
[2023-03-22 19:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:22:59] [INFO ] [Real]Absence check using state equation in 12082 ms returned sat
[2023-03-22 19:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:23:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 190 ms returned sat
[2023-03-22 19:23:01] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 478 ms returned sat
[2023-03-22 19:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:23:13] [INFO ] [Nat]Absence check using state equation in 11731 ms returned sat
[2023-03-22 19:23:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 19:23:18] [INFO ] [Nat]Added 10210 Read/Feed constraints in 4933 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0] Max seen :[0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 406554 ms.
ITS solved all properties within timeout

BK_STOP 1679512999141

--------------------
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="MultiCrashLeafsetExtension-PT-S32C05"
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 MultiCrashLeafsetExtension-PT-S32C05, 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 r231-tall-167856416800917"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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