About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S32C04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.092 | 3494329.00 | 3621069.00 | 41943.60 | 0 1 1 0 0 0 ? 0 1 0 1 ? 1 0 0 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/mcc2024-input.r263-tall-171654372000101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r263-tall-171654372000101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20M May 18 16:43 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 1716655541146
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=gold2023
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 202304061127
[2024-05-25 16:45:42] [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]
[2024-05-25 16:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:45:43] [INFO ] Load time of PNML (sax parser for PT used): 698 ms
[2024-05-25 16:45:43] [INFO ] Transformed 18180 places.
[2024-05-25 16:45:43] [INFO ] Transformed 28411 transitions.
[2024-05-25 16:45:43] [INFO ] Parsed PT model containing 18180 places and 28411 transitions and 115534 arcs in 903 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Normalized transition count is 27355 out of 28411 initially.
// Phase 1: matrix 27355 rows 18180 cols
[2024-05-25 16:45:46] [INFO ] Computed 1473 invariants in 2668 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :1
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 :0
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 :2
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 :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :0
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 :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 :3
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 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
[2024-05-25 16:45:47] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18180 cols
[2024-05-25 16:45:50] [INFO ] Computed 1473 invariants in 2441 ms
[2024-05-25 16:45:52] [INFO ] [Real]Absence check using 78 positive place invariants in 533 ms returned sat
[2024-05-25 16:45:54] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1200 ms returned sat
[2024-05-25 16:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:45:55] [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 0
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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:45:58] [INFO ] [Real]Absence check using 78 positive place invariants in 537 ms returned sat
[2024-05-25 16:45:58] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 699 ms returned unsat
[2024-05-25 16:46:01] [INFO ] [Real]Absence check using 78 positive place invariants in 529 ms returned sat
[2024-05-25 16:46:02] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 934 ms returned unsat
[2024-05-25 16:46:04] [INFO ] [Real]Absence check using 78 positive place invariants in 516 ms returned sat
[2024-05-25 16:46:05] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1134 ms returned sat
[2024-05-25 16:46:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:07] [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 3
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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:09] [INFO ] [Real]Absence check using 78 positive place invariants in 550 ms returned sat
[2024-05-25 16:46:10] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1170 ms returned sat
[2024-05-25 16:46:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:14] [INFO ] [Real]Absence check using 78 positive place invariants in 550 ms returned sat
[2024-05-25 16:46:15] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1268 ms returned sat
[2024-05-25 16:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:17] [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 5
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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:19] [INFO ] [Real]Absence check using 78 positive place invariants in 517 ms returned sat
[2024-05-25 16:46:20] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1186 ms returned sat
[2024-05-25 16:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:22] [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 6
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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:24] [INFO ] [Real]Absence check using 78 positive place invariants in 559 ms returned sat
[2024-05-25 16:46:25] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1218 ms returned sat
[2024-05-25 16:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:27] [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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:29] [INFO ] [Real]Absence check using 78 positive place invariants in 529 ms returned sat
[2024-05-25 16:46:30] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1117 ms returned unsat
[2024-05-25 16:46:33] [INFO ] [Real]Absence check using 78 positive place invariants in 558 ms returned sat
[2024-05-25 16:46:34] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1177 ms returned sat
[2024-05-25 16:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:35] [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 9
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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:38] [INFO ] [Real]Absence check using 78 positive place invariants in 531 ms returned sat
[2024-05-25 16:46:39] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1227 ms returned sat
[2024-05-25 16:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:40] [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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:43] [INFO ] [Real]Absence check using 78 positive place invariants in 517 ms returned sat
[2024-05-25 16:46:44] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1161 ms returned sat
[2024-05-25 16:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:48] [INFO ] [Real]Absence check using 78 positive place invariants in 526 ms returned sat
[2024-05-25 16:46:48] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 645 ms returned unsat
[2024-05-25 16:46:51] [INFO ] [Real]Absence check using 78 positive place invariants in 529 ms returned sat
[2024-05-25 16:46:52] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1234 ms returned sat
[2024-05-25 16:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:53] [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 13
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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:46:56] [INFO ] [Real]Absence check using 78 positive place invariants in 535 ms returned sat
[2024-05-25 16:46:57] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1104 ms returned sat
[2024-05-25 16:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:46:58] [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 14
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:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:47:01] [INFO ] [Real]Absence check using 78 positive place invariants in 547 ms returned sat
[2024-05-25 16:47:02] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 662 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 33, 1, 1, 1, 1, 1] Max seen :[0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-15 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-08 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 11 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 4223 transitions
Trivial Post-agglo rules discarded 4223 transitions
Performed 4223 trivial Post agglomeration. Transition count delta: 4223
Iterating post reduction 0 with 4223 rules applied. Total rules applied 4224 place count 18136 transition count 24188
Reduce places removed 4223 places and 0 transitions.
Iterating post reduction 1 with 4223 rules applied. Total rules applied 8447 place count 13913 transition count 24188
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 264 Pre rules applied. Total rules applied 8447 place count 13913 transition count 23924
Deduced a syphon composed of 264 places in 24 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 8975 place count 13649 transition count 23924
Discarding 3959 places :
Symmetric choice reduction at 2 with 3959 rule applications. Total rules 12934 place count 9690 transition count 19965
Iterating global reduction 2 with 3959 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 2 with 7 Pre rules applied. Total rules applied 16893 place count 9690 transition count 19958
Deduced a syphon composed of 7 places in 20 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16907 place count 9683 transition count 19958
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 17896 place count 8694 transition count 16002
Iterating global reduction 2 with 989 rules applied. Total rules applied 18885 place count 8694 transition count 16002
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 2 with 66 rules applied. Total rules applied 18951 place count 8661 transition count 15969
Free-agglomeration rule (complex) applied 576 times.
Iterating global reduction 2 with 576 rules applied. Total rules applied 19527 place count 8661 transition count 18360
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 2 with 576 rules applied. Total rules applied 20103 place count 8085 transition count 18360
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 20136 place count 8085 transition count 18360
Applied a total of 20136 rules in 14944 ms. Remains 8085 /18180 variables (removed 10095) and now considering 18360/28411 (removed 10051) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14948 ms. Remains : 8085/18180 places, 18360/28411 transitions.
Normalized transition count is 16795 out of 18360 initially.
// Phase 1: matrix 16795 rows 8085 cols
[2024-05-25 16:47:17] [INFO ] Computed 1429 invariants in 786 ms
Interrupted random walk after 667041 steps, including 26535 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 953768 steps, including 3491 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen 0
Interrupted Best-First random walk after 948385 steps, including 3472 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
Interrupted Best-First random walk after 952849 steps, including 3488 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen 0
Interrupted Best-First random walk after 965359 steps, including 3534 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen 0
Interrupted Best-First random walk after 967644 steps, including 3542 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen 0
Interrupted Best-First random walk after 961480 steps, including 3520 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen 0
Interrupted Best-First random walk after 977046 steps, including 3577 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen 0
Interrupted Best-First random walk after 964522 steps, including 3531 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen 0
Interrupted Best-First random walk after 974673 steps, including 3568 resets, run timeout after 5001 ms. (steps per millisecond=194 ) properties seen 0
Interrupted Best-First random walk after 977312 steps, including 3578 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen 0
[2024-05-25 16:48:38] [INFO ] Flow matrix only has 16795 transitions (discarded 1565 similar events)
// Phase 1: matrix 16795 rows 8085 cols
[2024-05-25 16:48:38] [INFO ] Computed 1429 invariants in 744 ms
[2024-05-25 16:48:39] [INFO ] [Real]Absence check using 65 positive place invariants in 200 ms returned sat
[2024-05-25 16:48:40] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 478 ms returned sat
[2024-05-25 16:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:48:50] [INFO ] [Real]Absence check using state equation in 10647 ms returned sat
[2024-05-25 16:48:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:48:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 189 ms returned sat
[2024-05-25 16:48:52] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 490 ms returned sat
[2024-05-25 16:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:49:03] [INFO ] [Nat]Absence check using state equation in 10902 ms returned sat
[2024-05-25 16:49:03] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2024-05-25 16:49:06] [INFO ] [Nat]Added 9154 Read/Feed constraints in 2342 ms returned unsat
[2024-05-25 16:49:07] [INFO ] [Real]Absence check using 65 positive place invariants in 175 ms returned sat
[2024-05-25 16:49:07] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 466 ms returned sat
[2024-05-25 16:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:49:18] [INFO ] [Real]Absence check using state equation in 11282 ms returned sat
[2024-05-25 16:49:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:49:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 177 ms returned sat
[2024-05-25 16:49:20] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 476 ms returned sat
[2024-05-25 16:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:49:33] [INFO ] [Nat]Absence check using state equation in 12263 ms returned sat
[2024-05-25 16:49:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:49:39] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6543 ms returned unknown
[2024-05-25 16:49:40] [INFO ] [Real]Absence check using 65 positive place invariants in 179 ms returned sat
[2024-05-25 16:49:41] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 472 ms returned sat
[2024-05-25 16:49:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:49:51] [INFO ] [Real]Absence check using state equation in 10440 ms returned sat
[2024-05-25 16:49:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:49:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 195 ms returned sat
[2024-05-25 16:49:53] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 552 ms returned sat
[2024-05-25 16:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:50:09] [INFO ] [Nat]Absence check using state equation in 15563 ms returned sat
[2024-05-25 16:50:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:50:15] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6483 ms returned unknown
[2024-05-25 16:50:16] [INFO ] [Real]Absence check using 65 positive place invariants in 174 ms returned sat
[2024-05-25 16:50:16] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 455 ms returned sat
[2024-05-25 16:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:50:28] [INFO ] [Real]Absence check using state equation in 11931 ms returned sat
[2024-05-25 16:50:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:50:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 177 ms returned sat
[2024-05-25 16:50:30] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 494 ms returned sat
[2024-05-25 16:50:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:50:43] [INFO ] [Nat]Absence check using state equation in 12764 ms returned sat
[2024-05-25 16:50:47] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3461 ms returned unsat
[2024-05-25 16:50:48] [INFO ] [Real]Absence check using 65 positive place invariants in 196 ms returned sat
[2024-05-25 16:50:48] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 516 ms returned sat
[2024-05-25 16:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:51:01] [INFO ] [Real]Absence check using state equation in 12898 ms returned sat
[2024-05-25 16:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:51:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 205 ms returned sat
[2024-05-25 16:51:03] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 521 ms returned sat
[2024-05-25 16:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:51:15] [INFO ] [Nat]Absence check using state equation in 12329 ms returned sat
[2024-05-25 16:51:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:51:22] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6436 ms returned unknown
[2024-05-25 16:51:23] [INFO ] [Real]Absence check using 65 positive place invariants in 174 ms returned sat
[2024-05-25 16:51:23] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 451 ms returned sat
[2024-05-25 16:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:51:34] [INFO ] [Real]Absence check using state equation in 10496 ms returned sat
[2024-05-25 16:51:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:51:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 187 ms returned sat
[2024-05-25 16:51:35] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 458 ms returned sat
[2024-05-25 16:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:51:47] [INFO ] [Nat]Absence check using state equation in 11575 ms returned sat
[2024-05-25 16:51:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:51:51] [INFO ] [Nat]Added 9154 Read/Feed constraints in 4066 ms returned unsat
[2024-05-25 16:51:52] [INFO ] [Real]Absence check using 65 positive place invariants in 173 ms returned sat
[2024-05-25 16:51:52] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 443 ms returned sat
[2024-05-25 16:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:52:03] [INFO ] [Real]Absence check using state equation in 10091 ms returned sat
[2024-05-25 16:52:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:52:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 168 ms returned sat
[2024-05-25 16:52:04] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 471 ms returned sat
[2024-05-25 16:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:52:15] [INFO ] [Nat]Absence check using state equation in 11074 ms returned sat
[2024-05-25 16:52:17] [INFO ] [Nat]Added 9154 Read/Feed constraints in 1867 ms returned unsat
[2024-05-25 16:52:18] [INFO ] [Real]Absence check using 65 positive place invariants in 194 ms returned sat
[2024-05-25 16:52:19] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 477 ms returned sat
[2024-05-25 16:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:52:31] [INFO ] [Real]Absence check using state equation in 12289 ms returned sat
[2024-05-25 16:52:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:52:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 179 ms returned sat
[2024-05-25 16:52:33] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 493 ms returned sat
[2024-05-25 16:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:52:45] [INFO ] [Nat]Absence check using state equation in 12380 ms returned sat
[2024-05-25 16:52:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:52:52] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6508 ms returned unknown
[2024-05-25 16:52:53] [INFO ] [Real]Absence check using 65 positive place invariants in 185 ms returned sat
[2024-05-25 16:52:53] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 472 ms returned sat
[2024-05-25 16:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:53:05] [INFO ] [Real]Absence check using state equation in 11810 ms returned sat
[2024-05-25 16:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:53:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 178 ms returned sat
[2024-05-25 16:53:07] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 496 ms returned sat
[2024-05-25 16:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:53:18] [INFO ] [Nat]Absence check using state equation in 11448 ms returned sat
[2024-05-25 16:53:21] [INFO ] [Nat]Added 9154 Read/Feed constraints in 2375 ms returned unsat
[2024-05-25 16:53:22] [INFO ] [Real]Absence check using 65 positive place invariants in 174 ms returned sat
[2024-05-25 16:53:22] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 479 ms returned sat
[2024-05-25 16:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:53:35] [INFO ] [Real]Absence check using state equation in 12559 ms returned sat
[2024-05-25 16:53:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:53:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 172 ms returned sat
[2024-05-25 16:53:37] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 502 ms returned sat
[2024-05-25 16:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:53:48] [INFO ] [Nat]Absence check using state equation in 11830 ms returned sat
[2024-05-25 16:53:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:53:55] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6518 ms returned unknown
Current structural bounds on expressions (after SMT) : [0, 1, 1, 0, 1, 0, 0, 1, 0, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-09 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-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 8085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8085/8085 places, 18360/18360 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8085 transition count 18359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8084 transition count 18359
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 8084 transition count 18358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 8083 transition count 18358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 8082 transition count 18357
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 8082 transition count 18357
Applied a total of 6 rules in 5228 ms. Remains 8082 /8085 variables (removed 3) and now considering 18357/18360 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5228 ms. Remains : 8082/8085 places, 18357/18360 transitions.
Normalized transition count is 16792 out of 18357 initially.
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 16:54:01] [INFO ] Computed 1429 invariants in 842 ms
Interrupted random walk after 618719 steps, including 24615 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 871852 steps, including 3191 resets, run timeout after 5001 ms. (steps per millisecond=174 ) properties seen 0
Interrupted Best-First random walk after 857673 steps, including 3140 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Interrupted Best-First random walk after 854225 steps, including 3127 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 858237 steps, including 3142 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Interrupted Best-First random walk after 859804 steps, including 3147 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
[2024-05-25 16:54:56] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 16:54:57] [INFO ] Computed 1429 invariants in 823 ms
[2024-05-25 16:54:58] [INFO ] [Real]Absence check using 65 positive place invariants in 186 ms returned sat
[2024-05-25 16:54:58] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 481 ms returned sat
[2024-05-25 16:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:10] [INFO ] [Real]Absence check using state equation in 11458 ms returned sat
[2024-05-25 16:55:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:55:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 193 ms returned sat
[2024-05-25 16:55:12] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 463 ms returned sat
[2024-05-25 16:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:24] [INFO ] [Nat]Absence check using state equation in 12102 ms returned sat
[2024-05-25 16:55:24] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2024-05-25 16:55:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:55:30] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6402 ms returned unsat
[2024-05-25 16:55:31] [INFO ] [Real]Absence check using 65 positive place invariants in 197 ms returned sat
[2024-05-25 16:55:32] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 501 ms returned sat
[2024-05-25 16:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:43] [INFO ] [Real]Absence check using state equation in 10590 ms returned sat
[2024-05-25 16:55:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:55:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 178 ms returned sat
[2024-05-25 16:55:44] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 479 ms returned sat
[2024-05-25 16:55:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:58] [INFO ] [Nat]Absence check using state equation in 13135 ms returned sat
[2024-05-25 16:56:01] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3967 ms returned unsat
[2024-05-25 16:56:03] [INFO ] [Real]Absence check using 65 positive place invariants in 205 ms returned sat
[2024-05-25 16:56:03] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 499 ms returned sat
[2024-05-25 16:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:56:14] [INFO ] [Real]Absence check using state equation in 11351 ms returned sat
[2024-05-25 16:56:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:56:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 188 ms returned sat
[2024-05-25 16:56:16] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 474 ms returned sat
[2024-05-25 16:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:56:29] [INFO ] [Nat]Absence check using state equation in 13130 ms returned sat
[2024-05-25 16:56:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:56:33] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3934 ms returned sat
[2024-05-25 16:56:48] [INFO ] Deduced a trap composed of 731 places in 13879 ms of which 18 ms to minimize.
[2024-05-25 16:56:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15114 ms
[2024-05-25 16:56:50] [INFO ] Computed and/alt/rep : 10924/15885/10924 causal constraints (skipped 5835 transitions) in 1508 ms.
[2024-05-25 16:56:54] [INFO ] Added : 6 causal constraints over 2 iterations in 5112 ms. Result :sat
[2024-05-25 16:56:55] [INFO ] [Real]Absence check using 65 positive place invariants in 206 ms returned sat
[2024-05-25 16:56:56] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 489 ms returned sat
[2024-05-25 16:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:57:08] [INFO ] [Real]Absence check using state equation in 12075 ms returned sat
[2024-05-25 16:57:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:57:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 184 ms returned sat
[2024-05-25 16:57:10] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 467 ms returned sat
[2024-05-25 16:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:57:20] [INFO ] [Nat]Absence check using state equation in 10483 ms returned sat
[2024-05-25 16:57:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:57:27] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6478 ms returned unknown
[2024-05-25 16:57:27] [INFO ] [Real]Absence check using 65 positive place invariants in 188 ms returned sat
[2024-05-25 16:57:28] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 494 ms returned sat
[2024-05-25 16:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:57:40] [INFO ] [Real]Absence check using state equation in 12272 ms returned sat
[2024-05-25 16:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:57:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 189 ms returned sat
[2024-05-25 16:57:42] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 505 ms returned sat
[2024-05-25 16:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:57:53] [INFO ] [Nat]Absence check using state equation in 11243 ms returned sat
[2024-05-25 16:57:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:57:57] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3783 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 1, 1, 0] Max seen :[0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 8082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1999 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1999 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Normalized transition count is 16792 out of 18357 initially.
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 16:58:00] [INFO ] Computed 1429 invariants in 801 ms
Interrupted random walk after 643965 steps, including 25624 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 928711 steps, including 3400 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen 0
Interrupted Best-First random walk after 895261 steps, including 3277 resets, run timeout after 5001 ms. (steps per millisecond=179 ) properties seen 0
[2024-05-25 16:58:40] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 16:58:41] [INFO ] Computed 1429 invariants in 835 ms
[2024-05-25 16:58:42] [INFO ] [Real]Absence check using 65 positive place invariants in 199 ms returned sat
[2024-05-25 16:58:43] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 488 ms returned sat
[2024-05-25 16:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:58:53] [INFO ] [Real]Absence check using state equation in 10920 ms returned sat
[2024-05-25 16:58:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:58:55] [INFO ] [Nat]Absence check using 65 positive place invariants in 189 ms returned sat
[2024-05-25 16:58:55] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 462 ms returned sat
[2024-05-25 16:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:59:07] [INFO ] [Nat]Absence check using state equation in 12011 ms returned sat
[2024-05-25 16:59:07] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2024-05-25 16:59:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:59:11] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3932 ms returned sat
[2024-05-25 16:59:25] [INFO ] Deduced a trap composed of 731 places in 13307 ms of which 18 ms to minimize.
[2024-05-25 16:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14594 ms
[2024-05-25 16:59:27] [INFO ] Computed and/alt/rep : 10924/15885/10924 causal constraints (skipped 5835 transitions) in 1396 ms.
[2024-05-25 16:59:31] [INFO ] Added : 6 causal constraints over 2 iterations in 5017 ms. Result :sat
[2024-05-25 16:59:33] [INFO ] [Real]Absence check using 65 positive place invariants in 200 ms returned sat
[2024-05-25 16:59:33] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 488 ms returned sat
[2024-05-25 16:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:59:45] [INFO ] [Real]Absence check using state equation in 11654 ms returned sat
[2024-05-25 16:59:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:59:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 186 ms returned sat
[2024-05-25 16:59:47] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 458 ms returned sat
[2024-05-25 16:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:59:58] [INFO ] [Nat]Absence check using state equation in 11783 ms returned sat
[2024-05-25 17:00:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:00:05] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6510 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 8082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1947 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1948 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1969 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
[2024-05-25 17:00:09] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
[2024-05-25 17:00:09] [INFO ] Invariant cache hit.
[2024-05-25 17:00:10] [INFO ] Implicit Places using invariants in 775 ms returned []
Implicit Place search using SMT only with invariants took 784 ms to find 0 implicit places.
[2024-05-25 17:00:10] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
[2024-05-25 17:00:10] [INFO ] Invariant cache hit.
[2024-05-25 17:00:11] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3595 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06
Normalized transition count is 16792 out of 18357 initially.
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 17:00:11] [INFO ] Computed 1429 invariants in 779 ms
Incomplete random walk after 10000 steps, including 397 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
[2024-05-25 17:00:12] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 17:00:13] [INFO ] Computed 1429 invariants in 783 ms
[2024-05-25 17:00:14] [INFO ] [Real]Absence check using 65 positive place invariants in 192 ms returned sat
[2024-05-25 17:00:14] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 502 ms returned sat
[2024-05-25 17:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:00:18] [INFO ] [Real]Absence check using state equation in 3600 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8082 transition count 18356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8081 transition count 18356
Applied a total of 2 rules in 3854 ms. Remains 8081 /8082 variables (removed 1) and now considering 18356/18357 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3855 ms. Remains : 8081/8082 places, 18356/18357 transitions.
Normalized transition count is 16790 out of 18356 initially.
// Phase 1: matrix 16790 rows 8081 cols
[2024-05-25 17:00:22] [INFO ] Computed 1429 invariants in 766 ms
Interrupted random walk after 700005 steps, including 27852 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 0
Interrupted Best-First random walk after 963611 steps, including 3527 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen 0
[2024-05-25 17:00:57] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2024-05-25 17:00:58] [INFO ] Computed 1429 invariants in 776 ms
[2024-05-25 17:00:59] [INFO ] [Real]Absence check using 65 positive place invariants in 161 ms returned sat
[2024-05-25 17:01:00] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 447 ms returned sat
[2024-05-25 17:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:01:09] [INFO ] [Real]Absence check using state equation in 9334 ms returned sat
[2024-05-25 17:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:01:10] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2024-05-25 17:01:11] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 466 ms returned sat
[2024-05-25 17:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:01:21] [INFO ] [Nat]Absence check using state equation in 10588 ms returned sat
[2024-05-25 17:01:21] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2024-05-25 17:01:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:01:27] [INFO ] [Nat]Added 9154 Read/Feed constraints in 5389 ms returned sat
[2024-05-25 17:01:40] [INFO ] Deduced a trap composed of 546 places in 12912 ms of which 10 ms to minimize.
[2024-05-25 17:01:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13934 ms
[2024-05-25 17:01:42] [INFO ] Computed and/alt/rep : 10922/15882/10922 causal constraints (skipped 5835 transitions) in 1064 ms.
[2024-05-25 17:01:44] [INFO ] Added : 6 causal constraints over 2 iterations in 3814 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 1881 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 1881 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 1891 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
[2024-05-25 17:01:49] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2024-05-25 17:01:49] [INFO ] Invariant cache hit.
[2024-05-25 17:01:57] [INFO ] Implicit Places using invariants in 8030 ms returned []
Implicit Place search using SMT only with invariants took 8044 ms to find 0 implicit places.
[2024-05-25 17:01:57] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2024-05-25 17:01:57] [INFO ] Invariant cache hit.
[2024-05-25 17:02:10] [INFO ] Dead Transitions using invariants and state equation in 12633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22575 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06 in 118990 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-11
Normalized transition count is 16792 out of 18357 initially.
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 17:02:10] [INFO ] Computed 1429 invariants in 739 ms
Incomplete random walk after 10000 steps, including 398 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
[2024-05-25 17:02:11] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 17:02:12] [INFO ] Computed 1429 invariants in 753 ms
[2024-05-25 17:02:12] [INFO ] [Real]Absence check using 65 positive place invariants in 174 ms returned sat
[2024-05-25 17:02:13] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 444 ms returned sat
[2024-05-25 17:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:02:17] [INFO ] [Real]Absence check using state equation in 3719 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1893 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1893 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Normalized transition count is 16792 out of 18357 initially.
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 17:02:19] [INFO ] Computed 1429 invariants in 727 ms
Interrupted random walk after 700819 steps, including 27879 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 0
Interrupted Best-First random walk after 958488 steps, including 3509 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
[2024-05-25 17:02:54] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 17:02:55] [INFO ] Computed 1429 invariants in 760 ms
[2024-05-25 17:02:56] [INFO ] [Real]Absence check using 65 positive place invariants in 179 ms returned sat
[2024-05-25 17:02:56] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 446 ms returned sat
[2024-05-25 17:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:03:07] [INFO ] [Real]Absence check using state equation in 10889 ms returned sat
[2024-05-25 17:03:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:03:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 183 ms returned sat
[2024-05-25 17:03:09] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 457 ms returned sat
[2024-05-25 17:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:03:20] [INFO ] [Nat]Absence check using state equation in 10597 ms returned sat
[2024-05-25 17:03:20] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2024-05-25 17:03:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:03:26] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6491 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1917 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1917 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1968 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
[2024-05-25 17:03:30] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
[2024-05-25 17:03:30] [INFO ] Invariant cache hit.
[2024-05-25 17:03:31] [INFO ] Implicit Places using invariants in 763 ms returned []
Implicit Place search using SMT only with invariants took 786 ms to find 0 implicit places.
[2024-05-25 17:03:31] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
[2024-05-25 17:03:31] [INFO ] Invariant cache hit.
[2024-05-25 17:03:44] [INFO ] Dead Transitions using invariants and state equation in 12714 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15491 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-11 in 94105 ms.
[2024-05-25 17:03:46] [INFO ] Flatten gal took : 1523 ms
[2024-05-25 17:03:47] [INFO ] Applying decomposition
[2024-05-25 17:03:48] [INFO ] Flatten gal took : 932 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14502729512590431008.txt' '-o' '/tmp/graph14502729512590431008.bin' '-w' '/tmp/graph14502729512590431008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14502729512590431008.bin' '-l' '-1' '-v' '-w' '/tmp/graph14502729512590431008.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:03:50] [INFO ] Decomposing Gal with order
[2024-05-25 17:03:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:03:59] [INFO ] Removed a total of 27313 redundant transitions.
[2024-05-25 17:04:00] [INFO ] Flatten gal took : 7356 ms
[2024-05-25 17:04:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 11761 labels/synchronizations in 2116 ms.
[2024-05-25 17:04:05] [INFO ] Time to serialize gal into /tmp/UpperBounds7329721269593484107.gal : 291 ms
[2024-05-25 17:04:05] [INFO ] Time to serialize properties into /tmp/UpperBounds5311836354884759703.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7329721269593484107.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5311836354884759703.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds5311836354884759703.prop.
ITS-tools command line returned an error code 137
[2024-05-25 17:14:52] [INFO ] Flatten gal took : 4171 ms
[2024-05-25 17:14:52] [INFO ] Time to serialize gal into /tmp/UpperBounds1254035940106285209.gal : 118 ms
[2024-05-25 17:14:52] [INFO ] Time to serialize properties into /tmp/UpperBounds9112770363078257621.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1254035940106285209.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9112770363078257621.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds9112770363078257621.prop.
ITS-tools command line returned an error code 137
[2024-05-25 17:29:01] [INFO ] Flatten gal took : 2942 ms
[2024-05-25 17:29:04] [INFO ] Input system was already deterministic with 18357 transitions.
[2024-05-25 17:29:04] [INFO ] Transformed 8082 places.
[2024-05-25 17:29:04] [INFO ] Transformed 18357 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
[2024-05-25 17:29:37] [INFO ] Time to serialize gal into /tmp/UpperBounds4152315114048953016.gal : 99 ms
[2024-05-25 17:29:37] [INFO ] Time to serialize properties into /tmp/UpperBounds10298599770975715081.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4152315114048953016.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10298599770975715081.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10298599770975715081.prop.
ITS-tools command line returned an error code 137
Total runtime 3490566 ms.
BK_STOP 1716659035475
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r263-tall-171654372000101"
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 ;