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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 07:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 12 07:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 22M 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-S32C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716658096410

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-S32C05
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 17:28:17] [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 17:28:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:28:18] [INFO ] Load time of PNML (sax parser for PT used): 742 ms
[2024-05-25 17:28:18] [INFO ] Transformed 20498 places.
[2024-05-25 17:28:18] [INFO ] Transformed 31713 transitions.
[2024-05-25 17:28:18] [INFO ] Parsed PT model containing 20498 places and 31713 transitions and 126502 arcs in 955 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Normalized transition count is 30657 out of 31713 initially.
// Phase 1: matrix 30657 rows 20498 cols
[2024-05-25 17:28:22] [INFO ] Computed 1543 invariants in 3235 ms
Incomplete random walk after 10000 steps, including 193 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 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 28 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 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 28 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 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 28 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :0
[2024-05-25 17:28:24] [INFO ] Flow matrix only has 30657 transitions (discarded 1056 similar events)
// Phase 1: matrix 30657 rows 20498 cols
[2024-05-25 17:28:26] [INFO ] Computed 1543 invariants in 2865 ms
[2024-05-25 17:28:30] [INFO ] [Real]Absence check using 80 positive place invariants in 700 ms returned sat
[2024-05-25 17:28:31] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1170 ms returned unknown
[2024-05-25 17:28:35] [INFO ] [Real]Absence check using 80 positive place invariants in 681 ms returned sat
[2024-05-25 17:28:36] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1170 ms returned sat
[2024-05-25 17:28:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:28:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 17:28:39] [INFO ] [Real]Absence check using 80 positive place invariants in 700 ms returned sat
[2024-05-25 17:28:41] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1141 ms returned sat
[2024-05-25 17:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:28:41] [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 2
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 17:28:44] [INFO ] [Real]Absence check using 80 positive place invariants in 678 ms returned sat
[2024-05-25 17:28:45] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 458 ms returned unsat
[2024-05-25 17:28:48] [INFO ] [Real]Absence check using 80 positive place invariants in 704 ms returned sat
[2024-05-25 17:28:50] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1388 ms returned sat
[2024-05-25 17:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:28:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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 17:28:53] [INFO ] [Real]Absence check using 80 positive place invariants in 700 ms returned sat
[2024-05-25 17:28:54] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1326 ms returned sat
[2024-05-25 17:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:28:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 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 17:28:58] [INFO ] [Real]Absence check using 80 positive place invariants in 729 ms returned sat
[2024-05-25 17:28:58] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 510 ms returned unsat
[2024-05-25 17:29:01] [INFO ] [Real]Absence check using 80 positive place invariants in 689 ms returned sat
[2024-05-25 17:29:02] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1199 ms returned sat
[2024-05-25 17:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:29:04] [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 7
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 17:29:06] [INFO ] [Real]Absence check using 80 positive place invariants in 682 ms returned sat
[2024-05-25 17:29:08] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1342 ms returned sat
[2024-05-25 17:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:29:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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 17:29:12] [INFO ] [Real]Absence check using 80 positive place invariants in 705 ms returned sat
[2024-05-25 17:29:13] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1316 ms returned sat
[2024-05-25 17:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:29:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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 17:29:17] [INFO ] [Real]Absence check using 80 positive place invariants in 697 ms returned sat
[2024-05-25 17:29:18] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1536 ms returned sat
[2024-05-25 17:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:29:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 10
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 17:29:22] [INFO ] [Real]Absence check using 80 positive place invariants in 714 ms returned sat
[2024-05-25 17:29:23] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1299 ms returned sat
[2024-05-25 17:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:29:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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 17:29:27] [INFO ] [Real]Absence check using 80 positive place invariants in 700 ms returned sat
[2024-05-25 17:29:28] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1352 ms returned sat
[2024-05-25 17:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:29:29] [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 12
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 17:29:32] [INFO ] [Real]Absence check using 80 positive place invariants in 707 ms returned sat
[2024-05-25 17:29:32] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 575 ms returned unsat
[2024-05-25 17:29:35] [INFO ] [Real]Absence check using 80 positive place invariants in 683 ms returned sat
[2024-05-25 17:29:36] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1217 ms returned sat
[2024-05-25 17:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:29:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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 17:29:40] [INFO ] [Real]Absence check using 80 positive place invariants in 681 ms returned sat
[2024-05-25 17:29:41] [INFO ] [Real]Absence check using 80 positive and 1463 generalized place invariants in 1196 ms returned sat
[2024-05-25 17:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:29:42] [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 15
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)
Current structural bounds on expressions (after SMT) : [1, 33, 1, 1, 1, 1, 1, 99, 1, 33, 1, 1, 99, 1, 99, 99] Max seen :[0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 13 out of 20498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20498/20498 places, 31713/31713 transitions.
Graph (complete) has 72683 edges and 20498 vertex of which 20452 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.55 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions removed 5274 transitions
Trivial Post-agglo rules discarded 5274 transitions
Performed 5274 trivial Post agglomeration. Transition count delta: 5274
Iterating post reduction 0 with 5274 rules applied. Total rules applied 5275 place count 20452 transition count 26439
Reduce places removed 5274 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5278 rules applied. Total rules applied 10553 place count 15178 transition count 26435
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 10557 place count 15174 transition count 26435
Performed 330 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 330 Pre rules applied. Total rules applied 10557 place count 15174 transition count 26105
Deduced a syphon composed of 330 places in 29 ms
Reduce places removed 330 places and 0 transitions.
Iterating global reduction 3 with 660 rules applied. Total rules applied 11217 place count 14844 transition count 26105
Discarding 4944 places :
Symmetric choice reduction at 3 with 4944 rule applications. Total rules 16161 place count 9900 transition count 21161
Iterating global reduction 3 with 4944 rules applied. Total rules applied 21105 place count 9900 transition count 21161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 21105 place count 9900 transition count 21155
Deduced a syphon composed of 6 places in 24 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 21117 place count 9894 transition count 21155
Discarding 984 places :
Symmetric choice reduction at 3 with 984 rule applications. Total rules 22101 place count 8910 transition count 16235
Iterating global reduction 3 with 984 rules applied. Total rules applied 23085 place count 8910 transition count 16235
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 19 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 23151 place count 8877 transition count 16202
Free-agglomeration rule (complex) applied 582 times.
Iterating global reduction 3 with 582 rules applied. Total rules applied 23733 place count 8877 transition count 19556
Reduce places removed 582 places and 0 transitions.
Iterating post reduction 3 with 582 rules applied. Total rules applied 24315 place count 8295 transition count 19556
Partial Free-agglomeration rule applied 132 times.
Drop transitions removed 132 transitions
Iterating global reduction 4 with 132 rules applied. Total rules applied 24447 place count 8295 transition count 19556
Applied a total of 24447 rules in 15067 ms. Remains 8295 /20498 variables (removed 12203) and now considering 19556/31713 (removed 12157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15071 ms. Remains : 8295/20498 places, 19556/31713 transitions.
Normalized transition count is 17990 out of 19556 initially.
// Phase 1: matrix 17990 rows 8295 cols
[2024-05-25 17:29:58] [INFO ] Computed 1497 invariants in 888 ms
Interrupted random walk after 507359 steps, including 16271 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 5
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 757400 steps, including 2252 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen 3
Interrupted Best-First random walk after 741956 steps, including 2207 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 3
Interrupted Best-First random walk after 759231 steps, including 2258 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen 3
Interrupted Best-First random walk after 752849 steps, including 2239 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 3
Interrupted Best-First random walk after 742685 steps, including 2209 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 2
Interrupted Best-First random walk after 742682 steps, including 2209 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 2
Interrupted Best-First random walk after 737360 steps, including 2193 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 3
Interrupted Best-First random walk after 738090 steps, including 2195 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 2
Interrupted Best-First random walk after 723255 steps, including 2151 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 4
Interrupted Best-First random walk after 740453 steps, including 2202 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 3
Interrupted Best-First random walk after 748497 steps, including 2226 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen 3
Interrupted Best-First random walk after 746521 steps, including 2220 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen 4
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-25 17:31:28] [INFO ] Flow matrix only has 17990 transitions (discarded 1566 similar events)
// Phase 1: matrix 17990 rows 8295 cols
[2024-05-25 17:31:29] [INFO ] Computed 1497 invariants in 873 ms
[2024-05-25 17:31:30] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2024-05-25 17:31:31] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 523 ms returned sat
[2024-05-25 17:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:31:44] [INFO ] [Real]Absence check using state equation in 13388 ms returned sat
[2024-05-25 17:31:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:31:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 196 ms returned sat
[2024-05-25 17:31:46] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 493 ms returned sat
[2024-05-25 17:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:32:00] [INFO ] [Nat]Absence check using state equation in 14093 ms returned sat
[2024-05-25 17:32:01] [INFO ] State equation strengthened by 10210 read => feed constraints.
[2024-05-25 17:32:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:32:07] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6685 ms returned unknown
[2024-05-25 17:32:08] [INFO ] [Real]Absence check using 65 positive place invariants in 180 ms returned sat
[2024-05-25 17:32:09] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 530 ms returned sat
[2024-05-25 17:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:32:21] [INFO ] [Real]Absence check using state equation in 12575 ms returned sat
[2024-05-25 17:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:32:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2024-05-25 17:32:23] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 491 ms returned sat
[2024-05-25 17:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:32:36] [INFO ] [Nat]Absence check using state equation in 12688 ms returned sat
[2024-05-25 17:32:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:32:40] [INFO ] [Nat]Added 10210 Read/Feed constraints in 3940 ms returned unsat
[2024-05-25 17:32:41] [INFO ] [Real]Absence check using 65 positive place invariants in 171 ms returned sat
[2024-05-25 17:32:42] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 512 ms returned sat
[2024-05-25 17:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:32:54] [INFO ] [Real]Absence check using state equation in 12025 ms returned sat
[2024-05-25 17:32:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:32:55] [INFO ] [Nat]Absence check using 65 positive place invariants in 176 ms returned sat
[2024-05-25 17:32:56] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 503 ms returned sat
[2024-05-25 17:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:33:09] [INFO ] [Nat]Absence check using state equation in 13345 ms returned sat
[2024-05-25 17:33:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:33:15] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6550 ms returned unknown
[2024-05-25 17:33:16] [INFO ] [Real]Absence check using 65 positive place invariants in 168 ms returned sat
[2024-05-25 17:33:17] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 475 ms returned sat
[2024-05-25 17:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:33:28] [INFO ] [Real]Absence check using state equation in 11076 ms returned sat
[2024-05-25 17:33:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:33:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 164 ms returned sat
[2024-05-25 17:33:30] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 473 ms returned sat
[2024-05-25 17:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:33:41] [INFO ] [Nat]Absence check using state equation in 11257 ms returned sat
[2024-05-25 17:33:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:33:48] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6777 ms returned unknown
[2024-05-25 17:33:49] [INFO ] [Real]Absence check using 65 positive place invariants in 169 ms returned sat
[2024-05-25 17:33:49] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 285 ms returned unsat
[2024-05-25 17:33:50] [INFO ] [Real]Absence check using 65 positive place invariants in 166 ms returned sat
[2024-05-25 17:33:50] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 469 ms returned sat
[2024-05-25 17:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:34:02] [INFO ] [Real]Absence check using state equation in 11788 ms returned sat
[2024-05-25 17:34:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:34:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 168 ms returned sat
[2024-05-25 17:34:04] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 467 ms returned sat
[2024-05-25 17:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:34:15] [INFO ] [Nat]Absence check using state equation in 11051 ms returned sat
[2024-05-25 17:34:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:34:19] [INFO ] [Nat]Added 10210 Read/Feed constraints in 4229 ms returned unsat
[2024-05-25 17:34:20] [INFO ] [Real]Absence check using 65 positive place invariants in 165 ms returned sat
[2024-05-25 17:34:21] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 422 ms returned sat
[2024-05-25 17:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:34:32] [INFO ] [Real]Absence check using state equation in 11049 ms returned sat
[2024-05-25 17:34:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:34:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 166 ms returned sat
[2024-05-25 17:34:33] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 466 ms returned sat
[2024-05-25 17:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:34:45] [INFO ] [Nat]Absence check using state equation in 12035 ms returned sat
[2024-05-25 17:34:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:34:52] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6519 ms returned unknown
[2024-05-25 17:34:53] [INFO ] [Real]Absence check using 65 positive place invariants in 160 ms returned sat
[2024-05-25 17:34:53] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 481 ms returned sat
[2024-05-25 17:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:35:05] [INFO ] [Real]Absence check using state equation in 11825 ms returned sat
[2024-05-25 17:35:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:35:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 169 ms returned sat
[2024-05-25 17:35:07] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 482 ms returned sat
[2024-05-25 17:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:35:18] [INFO ] [Nat]Absence check using state equation in 11559 ms returned sat
[2024-05-25 17:35:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:35:23] [INFO ] [Nat]Added 10210 Read/Feed constraints in 4197 ms returned unsat
[2024-05-25 17:35:24] [INFO ] [Real]Absence check using 65 positive place invariants in 168 ms returned sat
[2024-05-25 17:35:24] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 191 ms returned unsat
[2024-05-25 17:35:25] [INFO ] [Real]Absence check using 65 positive place invariants in 170 ms returned sat
[2024-05-25 17:35:25] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 215 ms returned unsat
[2024-05-25 17:35:26] [INFO ] [Real]Absence check using 65 positive place invariants in 166 ms returned sat
[2024-05-25 17:35:26] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 142 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1] Max seen :[0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 8295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8295/8295 places, 19556/19556 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8295 transition count 19554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8293 transition count 19554
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 8293 transition count 19550
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 8289 transition count 19550
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 18 place count 8283 transition count 19544
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 8283 transition count 19544
Applied a total of 24 rules in 5529 ms. Remains 8283 /8295 variables (removed 12) and now considering 19544/19556 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5531 ms. Remains : 8283/8295 places, 19544/19556 transitions.
Normalized transition count is 17978 out of 19544 initially.
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:35:32] [INFO ] Computed 1497 invariants in 812 ms
Interrupted random walk after 545285 steps, including 17494 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 788228 steps, including 2344 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen 0
Interrupted Best-First random walk after 795211 steps, including 2365 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 0
Interrupted Best-First random walk after 767272 steps, including 2282 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 0
Interrupted Best-First random walk after 769065 steps, including 2287 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 0
[2024-05-25 17:36:22] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:36:23] [INFO ] Computed 1497 invariants in 836 ms
[2024-05-25 17:36:24] [INFO ] [Real]Absence check using 65 positive place invariants in 172 ms returned sat
[2024-05-25 17:36:25] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 479 ms returned sat
[2024-05-25 17:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:36:35] [INFO ] [Real]Absence check using state equation in 10878 ms returned sat
[2024-05-25 17:36:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:36:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 185 ms returned sat
[2024-05-25 17:36:37] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 467 ms returned sat
[2024-05-25 17:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:36:48] [INFO ] [Nat]Absence check using state equation in 10747 ms returned sat
[2024-05-25 17:36:48] [INFO ] State equation strengthened by 10210 read => feed constraints.
[2024-05-25 17:36:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:36:53] [INFO ] [Nat]Added 10210 Read/Feed constraints in 5179 ms returned unsat
[2024-05-25 17:36:54] [INFO ] [Real]Absence check using 65 positive place invariants in 174 ms returned sat
[2024-05-25 17:36:55] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 461 ms returned sat
[2024-05-25 17:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:37:05] [INFO ] [Real]Absence check using state equation in 10555 ms returned sat
[2024-05-25 17:37:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 186 ms returned sat
[2024-05-25 17:37:07] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 475 ms returned sat
[2024-05-25 17:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:37:18] [INFO ] [Nat]Absence check using state equation in 11198 ms returned sat
[2024-05-25 17:37:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:37:25] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6526 ms returned unknown
[2024-05-25 17:37:26] [INFO ] [Real]Absence check using 65 positive place invariants in 186 ms returned sat
[2024-05-25 17:37:26] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 482 ms returned sat
[2024-05-25 17:37:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:37:37] [INFO ] [Real]Absence check using state equation in 11023 ms returned sat
[2024-05-25 17:37:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 184 ms returned sat
[2024-05-25 17:37:39] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 466 ms returned sat
[2024-05-25 17:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:37:51] [INFO ] [Nat]Absence check using state equation in 11642 ms returned sat
[2024-05-25 17:37:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:37:57] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6585 ms returned unknown
[2024-05-25 17:37:58] [INFO ] [Real]Absence check using 65 positive place invariants in 199 ms returned sat
[2024-05-25 17:37:59] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 529 ms returned sat
[2024-05-25 17:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:38:10] [INFO ] [Real]Absence check using state equation in 11720 ms returned sat
[2024-05-25 17:38:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:38:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 186 ms returned sat
[2024-05-25 17:38:12] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 499 ms returned sat
[2024-05-25 17:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:38:23] [INFO ] [Nat]Absence check using state equation in 11072 ms returned sat
[2024-05-25 17:38:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:38:30] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6547 ms returned unknown
Current structural bounds on expressions (after SMT) : [0, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 8283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2129 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2129 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Normalized transition count is 17978 out of 19544 initially.
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:38:33] [INFO ] Computed 1497 invariants in 837 ms
Interrupted random walk after 554147 steps, including 17777 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 805438 steps, including 2395 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
Interrupted Best-First random walk after 807311 steps, including 2401 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
Interrupted Best-First random walk after 804207 steps, including 2392 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
[2024-05-25 17:39:18] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:39:19] [INFO ] Computed 1497 invariants in 855 ms
[2024-05-25 17:39:20] [INFO ] [Real]Absence check using 65 positive place invariants in 182 ms returned sat
[2024-05-25 17:39:20] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 472 ms returned sat
[2024-05-25 17:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:39:31] [INFO ] [Real]Absence check using state equation in 10865 ms returned sat
[2024-05-25 17:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:39:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 182 ms returned sat
[2024-05-25 17:39:33] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 460 ms returned sat
[2024-05-25 17:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:39:44] [INFO ] [Nat]Absence check using state equation in 11115 ms returned sat
[2024-05-25 17:39:44] [INFO ] State equation strengthened by 10210 read => feed constraints.
[2024-05-25 17:39:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:39:51] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6654 ms returned unknown
[2024-05-25 17:39:52] [INFO ] [Real]Absence check using 65 positive place invariants in 185 ms returned sat
[2024-05-25 17:39:52] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 476 ms returned sat
[2024-05-25 17:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:40:04] [INFO ] [Real]Absence check using state equation in 12201 ms returned sat
[2024-05-25 17:40:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:40:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 185 ms returned sat
[2024-05-25 17:40:06] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 475 ms returned sat
[2024-05-25 17:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:40:17] [INFO ] [Nat]Absence check using state equation in 11232 ms returned sat
[2024-05-25 17:40:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:40:24] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6639 ms returned unknown
[2024-05-25 17:40:25] [INFO ] [Real]Absence check using 65 positive place invariants in 189 ms returned sat
[2024-05-25 17:40:26] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 503 ms returned sat
[2024-05-25 17:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:40:38] [INFO ] [Real]Absence check using state equation in 12473 ms returned sat
[2024-05-25 17:40:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:40:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 193 ms returned sat
[2024-05-25 17:40:40] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 517 ms returned sat
[2024-05-25 17:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:40:53] [INFO ] [Nat]Absence check using state equation in 13369 ms returned sat
[2024-05-25 17:40:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:41:00] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6420 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 0] Max seen :[0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 8283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2055 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2055 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Normalized transition count is 17978 out of 19544 initially.
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:41:03] [INFO ] Computed 1497 invariants in 833 ms
Interrupted random walk after 546896 steps, including 17545 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 792032 steps, including 2355 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen 0
Interrupted Best-First random walk after 826452 steps, including 2458 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
[2024-05-25 17:41:43] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:41:44] [INFO ] Computed 1497 invariants in 806 ms
[2024-05-25 17:41:45] [INFO ] [Real]Absence check using 65 positive place invariants in 192 ms returned sat
[2024-05-25 17:41:45] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 524 ms returned sat
[2024-05-25 17:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:41:57] [INFO ] [Real]Absence check using state equation in 11778 ms returned sat
[2024-05-25 17:41:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:41:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 177 ms returned sat
[2024-05-25 17:41:59] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 475 ms returned sat
[2024-05-25 17:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:42:14] [INFO ] [Nat]Absence check using state equation in 14693 ms returned sat
[2024-05-25 17:42:14] [INFO ] State equation strengthened by 10210 read => feed constraints.
[2024-05-25 17:42:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:42:20] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6591 ms returned unknown
[2024-05-25 17:42:21] [INFO ] [Real]Absence check using 65 positive place invariants in 184 ms returned sat
[2024-05-25 17:42:22] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 479 ms returned sat
[2024-05-25 17:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:42:33] [INFO ] [Real]Absence check using state equation in 11729 ms returned sat
[2024-05-25 17:42:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:42:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 185 ms returned sat
[2024-05-25 17:42:35] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 431 ms returned sat
[2024-05-25 17:42:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:42:47] [INFO ] [Nat]Absence check using state equation in 11522 ms returned sat
[2024-05-25 17:42:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:42:53] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6619 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 8283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2107 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2107 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2113 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
[2024-05-25 17:42:58] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
[2024-05-25 17:42:58] [INFO ] Invariant cache hit.
[2024-05-25 17:42:58] [INFO ] Implicit Places using invariants in 833 ms returned []
Implicit Place search using SMT only with invariants took 843 ms to find 0 implicit places.
[2024-05-25 17:42:58] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
[2024-05-25 17:42:58] [INFO ] Invariant cache hit.
[2024-05-25 17:42:59] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3965 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-04
Normalized transition count is 17978 out of 19544 initially.
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:43:00] [INFO ] Computed 1497 invariants in 821 ms
Incomplete random walk after 10000 steps, including 320 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
[2024-05-25 17:43:01] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:43:02] [INFO ] Computed 1497 invariants in 835 ms
[2024-05-25 17:43:03] [INFO ] [Real]Absence check using 65 positive place invariants in 178 ms returned sat
[2024-05-25 17:43:03] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 445 ms returned sat
[2024-05-25 17:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:43:07] [INFO ] [Real]Absence check using state equation in 3701 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2127 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2129 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Normalized transition count is 17978 out of 19544 initially.
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:43:10] [INFO ] Computed 1497 invariants in 839 ms
Interrupted random walk after 542852 steps, including 17415 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 807257 steps, including 2401 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
[2024-05-25 17:43:45] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:43:46] [INFO ] Computed 1497 invariants in 816 ms
[2024-05-25 17:43:47] [INFO ] [Real]Absence check using 65 positive place invariants in 181 ms returned sat
[2024-05-25 17:43:47] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 469 ms returned sat
[2024-05-25 17:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:43:59] [INFO ] [Real]Absence check using state equation in 11534 ms returned sat
[2024-05-25 17:43:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:44:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 182 ms returned sat
[2024-05-25 17:44:00] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 462 ms returned sat
[2024-05-25 17:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:44:13] [INFO ] [Nat]Absence check using state equation in 12815 ms returned sat
[2024-05-25 17:44:13] [INFO ] State equation strengthened by 10210 read => feed constraints.
[2024-05-25 17:44:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:44:20] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6562 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2037 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2037 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2087 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
[2024-05-25 17:44:24] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
[2024-05-25 17:44:24] [INFO ] Invariant cache hit.
[2024-05-25 17:44:25] [INFO ] Implicit Places using invariants in 728 ms returned []
Implicit Place search using SMT only with invariants took 730 ms to find 0 implicit places.
[2024-05-25 17:44:25] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
[2024-05-25 17:44:25] [INFO ] Invariant cache hit.
[2024-05-25 17:44:26] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3640 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-04 in 86081 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-05
Normalized transition count is 17978 out of 19544 initially.
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:44:26] [INFO ] Computed 1497 invariants in 926 ms
Incomplete random walk after 10000 steps, including 321 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
[2024-05-25 17:44:27] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:44:28] [INFO ] Computed 1497 invariants in 943 ms
[2024-05-25 17:44:29] [INFO ] [Real]Absence check using 65 positive place invariants in 201 ms returned sat
[2024-05-25 17:44:30] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 533 ms returned sat
[2024-05-25 17:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:44:33] [INFO ] [Real]Absence check using state equation in 3557 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2046 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2047 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Normalized transition count is 17978 out of 19544 initially.
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:44:36] [INFO ] Computed 1497 invariants in 826 ms
Interrupted random walk after 551641 steps, including 17696 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 809604 steps, including 2408 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
[2024-05-25 17:45:11] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
// Phase 1: matrix 17978 rows 8283 cols
[2024-05-25 17:45:12] [INFO ] Computed 1497 invariants in 819 ms
[2024-05-25 17:45:13] [INFO ] [Real]Absence check using 65 positive place invariants in 179 ms returned sat
[2024-05-25 17:45:13] [INFO ] [Real]Absence check using 65 positive and 1432 generalized place invariants in 490 ms returned sat
[2024-05-25 17:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 17:45:25] [INFO ] [Real]Absence check using state equation in 11417 ms returned sat
[2024-05-25 17:45:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:45:26] [INFO ] [Nat]Absence check using 65 positive place invariants in 182 ms returned sat
[2024-05-25 17:45:27] [INFO ] [Nat]Absence check using 65 positive and 1432 generalized place invariants in 486 ms returned sat
[2024-05-25 17:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 17:45:37] [INFO ] [Nat]Absence check using state equation in 10658 ms returned sat
[2024-05-25 17:45:37] [INFO ] State equation strengthened by 10210 read => feed constraints.
[2024-05-25 17:45:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 17:45:44] [INFO ] [Nat]Added 10210 Read/Feed constraints in 6538 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2025 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2025 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8283/8283 places, 19544/19544 transitions.
Applied a total of 0 rules in 2042 ms. Remains 8283 /8283 variables (removed 0) and now considering 19544/19544 (removed 0) transitions.
[2024-05-25 17:45:48] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
[2024-05-25 17:45:48] [INFO ] Invariant cache hit.
[2024-05-25 17:45:49] [INFO ] Implicit Places using invariants in 829 ms returned []
Implicit Place search using SMT only with invariants took 836 ms to find 0 implicit places.
[2024-05-25 17:45:49] [INFO ] Flow matrix only has 17978 transitions (discarded 1566 similar events)
[2024-05-25 17:45:49] [INFO ] Invariant cache hit.
[2024-05-25 17:46:02] [INFO ] Dead Transitions using invariants and state equation in 13386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16266 ms. Remains : 8283/8283 places, 19544/19544 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C05-UpperBounds-05 in 96708 ms.
[2024-05-25 17:46:04] [INFO ] Flatten gal took : 1010 ms
[2024-05-25 17:46:04] [INFO ] Applying decomposition
[2024-05-25 17:46:05] [INFO ] Flatten gal took : 764 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/graph3020982390046413606.txt' '-o' '/tmp/graph3020982390046413606.bin' '-w' '/tmp/graph3020982390046413606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3020982390046413606.bin' '-l' '-1' '-v' '-w' '/tmp/graph3020982390046413606.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:46:07] [INFO ] Decomposing Gal with order
[2024-05-25 17:46:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:46:15] [INFO ] Removed a total of 27715 redundant transitions.
[2024-05-25 17:46:16] [INFO ] Flatten gal took : 7750 ms
[2024-05-25 17:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 17870 labels/synchronizations in 2913 ms.
[2024-05-25 17:46:21] [INFO ] Time to serialize gal into /tmp/UpperBounds2889862270444778591.gal : 203 ms
[2024-05-25 17:46:21] [INFO ] Time to serialize properties into /tmp/UpperBounds6065271317229478998.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/UpperBounds2889862270444778591.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6065271317229478998.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/UpperBounds6065271317229478998.prop.
ITS-tools command line returned an error code 137
[2024-05-25 18:00:05] [INFO ] Flatten gal took : 4526 ms
[2024-05-25 18:00:05] [INFO ] Time to serialize gal into /tmp/UpperBounds17888902826381560895.gal : 343 ms
[2024-05-25 18:00:05] [INFO ] Time to serialize properties into /tmp/UpperBounds550170006410619554.prop : 3 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/UpperBounds17888902826381560895.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds550170006410619554.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/UpperBounds550170006410619554.prop.
ITS-tools command line returned an error code 137
[2024-05-25 18:17:46] [INFO ] Flatten gal took : 3184 ms
[2024-05-25 18:17:47] [INFO ] Input system was already deterministic with 19544 transitions.
[2024-05-25 18:17:47] [INFO ] Transformed 8283 places.
[2024-05-25 18:17:48] [INFO ] Transformed 19544 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 18:18:21] [INFO ] Time to serialize gal into /tmp/UpperBounds1427397720176584945.gal : 101 ms
[2024-05-25 18:18:21] [INFO ] Time to serialize properties into /tmp/UpperBounds12964249750898384076.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/UpperBounds1427397720176584945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12964249750898384076.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/UpperBounds12964249750898384076.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 2841372 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16211716 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-S32C05"
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-S32C05, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372100106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C05.tgz
mv MultiCrashLeafsetExtension-PT-S32C05 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;