About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.535 | 3020367.00 | 2986712.00 | 80577.10 | 0 1 1 0 1 1 ? 0 0 1 0 1 1 0 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.r229-tall-167856413900909.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 itstools
Input is MultiCrashLeafsetExtension-PT-S32C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413900909
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 15K Feb 26 02:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 02:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K 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.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 03:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 20M 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-S32C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679615948036
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-23 23:59:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 23:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 23:59:10] [INFO ] Load time of PNML (sax parser for PT used): 594 ms
[2023-03-23 23:59:10] [INFO ] Transformed 18180 places.
[2023-03-23 23:59:10] [INFO ] Transformed 28411 transitions.
[2023-03-23 23:59:10] [INFO ] Parsed PT model containing 18180 places and 28411 transitions and 115534 arcs in 765 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 27355 out of 28411 initially.
// Phase 1: matrix 27355 rows 18180 cols
[2023-03-23 23:59:13] [INFO ] Computed 1473 place invariants in 2572 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :0
[2023-03-23 23:59:14] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18180 cols
[2023-03-23 23:59:16] [INFO ] Computed 1473 place invariants in 2348 ms
[2023-03-23 23:59:19] [INFO ] [Real]Absence check using 78 positive place invariants in 527 ms returned sat
[2023-03-23 23:59:20] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1134 ms returned sat
[2023-03-23 23:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:59:21] [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 0
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-23 23:59:24] [INFO ] [Real]Absence check using 78 positive place invariants in 520 ms returned sat
[2023-03-23 23:59:24] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 617 ms returned unsat
[2023-03-23 23:59:26] [INFO ] [Real]Absence check using 78 positive place invariants in 510 ms returned sat
[2023-03-23 23:59:27] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 625 ms returned unsat
[2023-03-23 23:59:29] [INFO ] [Real]Absence check using 78 positive place invariants in 526 ms returned sat
[2023-03-23 23:59:31] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1097 ms returned sat
[2023-03-23 23:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:59:32] [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 3
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-23 23:59:34] [INFO ] [Real]Absence check using 78 positive place invariants in 519 ms returned sat
[2023-03-23 23:59:35] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1099 ms returned sat
[2023-03-23 23:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:59:37] [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 4
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-23 23:59:39] [INFO ] [Real]Absence check using 78 positive place invariants in 494 ms returned sat
[2023-03-23 23:59:40] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 625 ms returned unsat
[2023-03-23 23:59:42] [INFO ] [Real]Absence check using 78 positive place invariants in 513 ms returned sat
[2023-03-23 23:59:44] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1097 ms returned sat
[2023-03-23 23:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:59:45] [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-23 23:59:48] [INFO ] [Real]Absence check using 78 positive place invariants in 523 ms returned sat
[2023-03-23 23:59:49] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1090 ms returned sat
[2023-03-23 23:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:59:50] [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-23 23:59:52] [INFO ] [Real]Absence check using 78 positive place invariants in 513 ms returned sat
[2023-03-23 23:59:54] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1070 ms returned sat
[2023-03-23 23:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:59: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: 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-23 23:59:58] [INFO ] [Real]Absence check using 78 positive place invariants in 515 ms returned sat
[2023-03-23 23:59:58] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 637 ms returned unsat
[2023-03-24 00:00:00] [INFO ] [Real]Absence check using 78 positive place invariants in 501 ms returned sat
[2023-03-24 00:00:02] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1130 ms returned sat
[2023-03-24 00:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:00:03] [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 10
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-24 00:00:06] [INFO ] [Real]Absence check using 78 positive place invariants in 522 ms returned sat
[2023-03-24 00:00:07] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1149 ms returned sat
[2023-03-24 00:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:00:08] [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 11
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-24 00:00:11] [INFO ] [Real]Absence check using 78 positive place invariants in 509 ms returned sat
[2023-03-24 00:00:11] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 638 ms returned unsat
[2023-03-24 00:00:14] [INFO ] [Real]Absence check using 78 positive place invariants in 501 ms returned sat
[2023-03-24 00:00:15] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1094 ms returned sat
[2023-03-24 00:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:00:16] [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-24 00:00:18] [INFO ] [Real]Absence check using 78 positive place invariants in 485 ms returned sat
[2023-03-24 00:00:19] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 627 ms returned unsat
[2023-03-24 00:00:21] [INFO ] [Real]Absence check using 78 positive place invariants in 489 ms returned sat
[2023-03-24 00:00:22] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 626 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 99, 1, 1, 1, 1, 1, 1, 99, 1, 1, 1, 1] Max seen :[0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 18180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18180/18180 places, 28411/28411 transitions.
Graph (complete) has 66065 edges and 18180 vertex of which 18136 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.51 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions removed 4222 transitions
Trivial Post-agglo rules discarded 4222 transitions
Performed 4222 trivial Post agglomeration. Transition count delta: 4222
Iterating post reduction 0 with 4222 rules applied. Total rules applied 4223 place count 18136 transition count 24189
Reduce places removed 4222 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8447 place count 13914 transition count 24187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8449 place count 13912 transition count 24187
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 264 Pre rules applied. Total rules applied 8449 place count 13912 transition count 23923
Deduced a syphon composed of 264 places in 19 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 3 with 528 rules applied. Total rules applied 8977 place count 13648 transition count 23923
Discarding 3958 places :
Symmetric choice reduction at 3 with 3958 rule applications. Total rules 12935 place count 9690 transition count 19965
Iterating global reduction 3 with 3958 rules applied. Total rules applied 16893 place count 9690 transition count 19965
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16893 place count 9690 transition count 19958
Deduced a syphon composed of 7 places in 19 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 16907 place count 9683 transition count 19958
Discarding 988 places :
Symmetric choice reduction at 3 with 988 rule applications. Total rules 17895 place count 8695 transition count 16006
Iterating global reduction 3 with 988 rules applied. Total rules applied 18883 place count 8695 transition count 16006
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 14 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 18949 place count 8662 transition count 15973
Free-agglomeration rule (complex) applied 578 times.
Iterating global reduction 3 with 578 rules applied. Total rules applied 19527 place count 8662 transition count 18359
Reduce places removed 578 places and 0 transitions.
Iterating post reduction 3 with 578 rules applied. Total rules applied 20105 place count 8084 transition count 18359
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 20138 place count 8084 transition count 18359
Applied a total of 20138 rules in 14171 ms. Remains 8084 /18180 variables (removed 10096) and now considering 18359/28411 (removed 10052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14175 ms. Remains : 8084/18180 places, 18359/28411 transitions.
Normalized transition count is 16793 out of 18359 initially.
// Phase 1: matrix 16793 rows 8084 cols
[2023-03-24 00:00:37] [INFO ] Computed 1429 place invariants in 818 ms
Interrupted random walk after 733518 steps, including 29183 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 2
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4878 ms. (steps per millisecond=205 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000000 steps, including 3661 resets, run finished after 4820 ms. (steps per millisecond=207 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4866 ms. (steps per millisecond=205 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4920 ms. (steps per millisecond=203 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4831 ms. (steps per millisecond=206 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4835 ms. (steps per millisecond=206 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4785 ms. (steps per millisecond=208 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4775 ms. (steps per millisecond=209 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4842 ms. (steps per millisecond=206 ) properties (out of 9) seen :2
[2023-03-24 00:01:51] [INFO ] Flow matrix only has 16793 transitions (discarded 1566 similar events)
// Phase 1: matrix 16793 rows 8084 cols
[2023-03-24 00:01:52] [INFO ] Computed 1429 place invariants in 821 ms
[2023-03-24 00:01:52] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2023-03-24 00:01:53] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 488 ms returned sat
[2023-03-24 00:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:02:02] [INFO ] [Real]Absence check using state equation in 9411 ms returned sat
[2023-03-24 00:02:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:02:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 172 ms returned sat
[2023-03-24 00:02:04] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 458 ms returned sat
[2023-03-24 00:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:02:14] [INFO ] [Nat]Absence check using state equation in 9634 ms returned sat
[2023-03-24 00:02:14] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2023-03-24 00:02:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 00:02:18] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3583 ms returned unsat
[2023-03-24 00:02:18] [INFO ] [Real]Absence check using 65 positive place invariants in 158 ms returned sat
[2023-03-24 00:02:19] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 473 ms returned sat
[2023-03-24 00:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:02:29] [INFO ] [Real]Absence check using state equation in 10402 ms returned sat
[2023-03-24 00:02:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:02:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 157 ms returned sat
[2023-03-24 00:02:31] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 452 ms returned sat
[2023-03-24 00:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:02:42] [INFO ] [Nat]Absence check using state equation in 10936 ms returned sat
[2023-03-24 00:02:45] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3330 ms returned unsat
[2023-03-24 00:02:46] [INFO ] [Real]Absence check using 65 positive place invariants in 150 ms returned sat
[2023-03-24 00:02:46] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 73 ms returned unsat
[2023-03-24 00:02:47] [INFO ] [Real]Absence check using 65 positive place invariants in 154 ms returned sat
[2023-03-24 00:02:47] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 462 ms returned sat
[2023-03-24 00:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:02:56] [INFO ] [Real]Absence check using state equation in 9102 ms returned sat
[2023-03-24 00:02:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:02:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 164 ms returned sat
[2023-03-24 00:02:58] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 467 ms returned sat
[2023-03-24 00:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:08] [INFO ] [Nat]Absence check using state equation in 10071 ms returned sat
[2023-03-24 00:03:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 00:03:14] [INFO ] [Nat]Added 9154 Read/Feed constraints in 5595 ms returned sat
[2023-03-24 00:03:16] [INFO ] Computed and/alt/rep : 10925/15888/10925 causal constraints (skipped 5835 transitions) in 1140 ms.
[2023-03-24 00:03:19] [INFO ] Added : 6 causal constraints over 2 iterations in 4327 ms. Result :sat
[2023-03-24 00:03:20] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2023-03-24 00:03:21] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 475 ms returned sat
[2023-03-24 00:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:30] [INFO ] [Real]Absence check using state equation in 9056 ms returned sat
[2023-03-24 00:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 157 ms returned sat
[2023-03-24 00:03:31] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 465 ms returned sat
[2023-03-24 00:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:41] [INFO ] [Nat]Absence check using state equation in 9250 ms returned sat
[2023-03-24 00:03:42] [INFO ] [Nat]Added 9154 Read/Feed constraints in 1579 ms returned unsat
[2023-03-24 00:03:43] [INFO ] [Real]Absence check using 65 positive place invariants in 158 ms returned sat
[2023-03-24 00:03:44] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 466 ms returned sat
[2023-03-24 00:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:53] [INFO ] [Real]Absence check using state equation in 9072 ms returned sat
[2023-03-24 00:03:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 160 ms returned sat
[2023-03-24 00:03:54] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 472 ms returned sat
[2023-03-24 00:03:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:04:05] [INFO ] [Nat]Absence check using state equation in 10684 ms returned sat
[2023-03-24 00:04:08] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3196 ms returned unsat
[2023-03-24 00:04:09] [INFO ] [Real]Absence check using 65 positive place invariants in 157 ms returned sat
[2023-03-24 00:04:10] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 464 ms returned sat
[2023-03-24 00:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:04:19] [INFO ] [Real]Absence check using state equation in 9171 ms returned sat
[2023-03-24 00:04:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:04:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 158 ms returned sat
[2023-03-24 00:04:20] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 438 ms returned sat
[2023-03-24 00:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:04:31] [INFO ] [Nat]Absence check using state equation in 10143 ms returned sat
[2023-03-24 00:04:32] [INFO ] [Nat]Added 9154 Read/Feed constraints in 1440 ms returned unsat
[2023-03-24 00:04:33] [INFO ] [Real]Absence check using 65 positive place invariants in 157 ms returned sat
[2023-03-24 00:04:33] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 328 ms returned unsat
[2023-03-24 00:04:34] [INFO ] [Real]Absence check using 65 positive place invariants in 155 ms returned sat
[2023-03-24 00:04:35] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 466 ms returned sat
[2023-03-24 00:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:04:44] [INFO ] [Real]Absence check using state equation in 9108 ms returned sat
[2023-03-24 00:04:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:04:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 164 ms returned sat
[2023-03-24 00:04:45] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 466 ms returned sat
[2023-03-24 00:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:04:55] [INFO ] [Nat]Absence check using state equation in 9625 ms returned sat
[2023-03-24 00:04:58] [INFO ] [Nat]Added 9154 Read/Feed constraints in 2871 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 1, 1, 0, 0, 0, 1, 0] Max seen :[0, 0, 1, 0, 0, 0, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 8084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8084/8084 places, 18359/18359 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8084 transition count 18358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8083 transition count 18358
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 8081 transition count 18356
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 8081 transition count 18356
Applied a total of 6 rules in 4863 ms. Remains 8081 /8084 variables (removed 3) and now considering 18356/18359 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4863 ms. Remains : 8081/8084 places, 18356/18359 transitions.
Normalized transition count is 16790 out of 18356 initially.
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-24 00:05:04] [INFO ] Computed 1429 place invariants in 793 ms
Interrupted random walk after 737839 steps, including 29359 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4885 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
[2023-03-24 00:05:39] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-24 00:05:39] [INFO ] Computed 1429 place invariants in 812 ms
[2023-03-24 00:05:40] [INFO ] [Real]Absence check using 65 positive place invariants in 156 ms returned sat
[2023-03-24 00:05:41] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 451 ms returned sat
[2023-03-24 00:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:05:49] [INFO ] [Real]Absence check using state equation in 8590 ms returned sat
[2023-03-24 00:05:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:05:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 158 ms returned sat
[2023-03-24 00:05:51] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 457 ms returned sat
[2023-03-24 00:05:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:06:01] [INFO ] [Nat]Absence check using state equation in 10183 ms returned sat
[2023-03-24 00:06:01] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2023-03-24 00:06:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 00:06:07] [INFO ] [Nat]Added 9154 Read/Feed constraints in 5321 ms returned sat
[2023-03-24 00:06:08] [INFO ] Computed and/alt/rep : 10922/15882/10922 causal constraints (skipped 5835 transitions) in 1228 ms.
[2023-03-24 00:06:11] [INFO ] Added : 6 causal constraints over 2 iterations in 3923 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 1869 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1869 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 1831 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
[2023-03-24 00:06:15] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2023-03-24 00:06:15] [INFO ] Invariant cache hit.
[2023-03-24 00:06:24] [INFO ] Implicit Places using invariants in 8272 ms returned []
Implicit Place search using SMT only with invariants took 8272 ms to find 0 implicit places.
[2023-03-24 00:06:24] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2023-03-24 00:06:24] [INFO ] Invariant cache hit.
[2023-03-24 00:06:37] [INFO ] Dead Transitions using invariants and state equation in 12976 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23084 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06
Normalized transition count is 16790 out of 18356 initially.
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-24 00:06:37] [INFO ] Computed 1429 place invariants in 799 ms
Incomplete random walk after 10000 steps, including 398 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
[2023-03-24 00:06:38] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-24 00:06:39] [INFO ] Computed 1429 place invariants in 811 ms
[2023-03-24 00:06:40] [INFO ] [Real]Absence check using 65 positive place invariants in 165 ms returned sat
[2023-03-24 00:06:40] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 478 ms returned sat
[2023-03-24 00:06:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:06: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 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.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:733)
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] Max seen :[0]
Support contains 1 out of 8081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 1847 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1849 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Normalized transition count is 16790 out of 18356 initially.
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-24 00:06:46] [INFO ] Computed 1429 place invariants in 808 ms
Interrupted random walk after 746463 steps, including 29699 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 3661 resets, run finished after 4904 ms. (steps per millisecond=203 ) properties (out of 1) seen :0
[2023-03-24 00:07:21] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-24 00:07:22] [INFO ] Computed 1429 place invariants in 805 ms
[2023-03-24 00:07:23] [INFO ] [Real]Absence check using 65 positive place invariants in 159 ms returned sat
[2023-03-24 00:07:24] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 483 ms returned sat
[2023-03-24 00:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:07:34] [INFO ] [Real]Absence check using state equation in 10050 ms returned sat
[2023-03-24 00:07:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:07:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 156 ms returned sat
[2023-03-24 00:07:35] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 450 ms returned sat
[2023-03-24 00:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:07:45] [INFO ] [Nat]Absence check using state equation in 9920 ms returned sat
[2023-03-24 00:07:45] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2023-03-24 00:07:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 00:07:51] [INFO ] [Nat]Added 9154 Read/Feed constraints in 5520 ms returned sat
[2023-03-24 00:07:52] [INFO ] Computed and/alt/rep : 10922/15882/10922 causal constraints (skipped 5835 transitions) in 1103 ms.
[2023-03-24 00:07:55] [INFO ] Added : 6 causal constraints over 2 iterations in 3776 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 1809 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1809 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 1828 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
[2023-03-24 00:07:59] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2023-03-24 00:07:59] [INFO ] Invariant cache hit.
[2023-03-24 00:08:08] [INFO ] Implicit Places using invariants in 8236 ms returned []
Implicit Place search using SMT only with invariants took 8241 ms to find 0 implicit places.
[2023-03-24 00:08:08] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2023-03-24 00:08:08] [INFO ] Invariant cache hit.
[2023-03-24 00:08:20] [INFO ] Dead Transitions using invariants and state equation in 12585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22658 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06 in 103582 ms.
[2023-03-24 00:08:21] [INFO ] Flatten gal took : 921 ms
[2023-03-24 00:08:22] [INFO ] Applying decomposition
[2023-03-24 00:08:23] [INFO ] Flatten gal took : 750 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8821192562979575293.txt' '-o' '/tmp/graph8821192562979575293.bin' '-w' '/tmp/graph8821192562979575293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8821192562979575293.bin' '-l' '-1' '-v' '-w' '/tmp/graph8821192562979575293.weights' '-q' '0' '-e' '0.001'
[2023-03-24 00:08:24] [INFO ] Decomposing Gal with order
[2023-03-24 00:08:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-24 00:08:31] [INFO ] Removed a total of 26397 redundant transitions.
[2023-03-24 00:08:32] [INFO ] Flatten gal took : 6190 ms
[2023-03-24 00:08:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 14175 labels/synchronizations in 2072 ms.
[2023-03-24 00:08:36] [INFO ] Time to serialize gal into /tmp/UpperBounds7418786715388297588.gal : 215 ms
[2023-03-24 00:08:36] [INFO ] Time to serialize properties into /tmp/UpperBounds13049724549730920906.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7418786715388297588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13049724549730920906.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds13049724549730920906.prop.
ITS-tools command line returned an error code 137
[2023-03-24 00:21:06] [INFO ] Flatten gal took : 3161 ms
[2023-03-24 00:21:07] [INFO ] Time to serialize gal into /tmp/UpperBounds10837389881002646424.gal : 274 ms
[2023-03-24 00:21:07] [INFO ] Time to serialize properties into /tmp/UpperBounds8205469987171419085.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10837389881002646424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8205469987171419085.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds8205469987171419085.prop.
ITS-tools command line returned an error code 137
[2023-03-24 00:36:23] [INFO ] Flatten gal took : 2774 ms
[2023-03-24 00:36:24] [INFO ] Input system was already deterministic with 18356 transitions.
[2023-03-24 00:36:24] [INFO ] Transformed 8081 places.
[2023-03-24 00:36:24] [INFO ] Transformed 18356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-24 00:36:57] [INFO ] Time to serialize gal into /tmp/UpperBounds15135444737761199285.gal : 87 ms
[2023-03-24 00:36:57] [INFO ] Time to serialize properties into /tmp/UpperBounds15623998692214719748.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15135444737761199285.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15623998692214719748.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15623998692214719748.prop.
ITS-tools command line returned an error code 137
Total runtime 3016422 ms.
BK_STOP 1679618968403
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-S32C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C04, 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 r229-tall-167856413900909"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C04.tgz
mv MultiCrashLeafsetExtension-PT-S32C04 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 '
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 ;