fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821300781
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16215.107 2763740.00 2886849.00 34105.00 1 1 1 1 1 ? 1 1 1 1 ? 1 ? 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821300781.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S24C11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821300781
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 13K Apr 29 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 29 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 29 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 9 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 19M May 10 09:34 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-S24C11-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652863360769

Running Version 202205111006
[2022-05-18 08:42:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 08:42:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 08:42:42] [INFO ] Load time of PNML (sax parser for PT used): 798 ms
[2022-05-18 08:42:42] [INFO ] Transformed 19254 places.
[2022-05-18 08:42:42] [INFO ] Transformed 27973 transitions.
[2022-05-18 08:42:42] [INFO ] Parsed PT model containing 19254 places and 27973 transitions in 1023 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Normalized transition count is 27373 out of 27973 initially.
// Phase 1: matrix 27373 rows 19254 cols
[2022-05-18 08:42:45] [INFO ] Computed 1299 place invariants in 2653 ms
Incomplete random walk after 10000 steps, including 89 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 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 18 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 18 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 18 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :1
[2022-05-18 08:42:47] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19254 cols
[2022-05-18 08:42:49] [INFO ] Computed 1299 place invariants in 2496 ms
[2022-05-18 08:42:52] [INFO ] [Real]Absence check using 76 positive place invariants in 627 ms returned sat
[2022-05-18 08:42:53] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 986 ms returned sat
[2022-05-18 08:42:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:42:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 08:42:57] [INFO ] [Real]Absence check using 76 positive place invariants in 571 ms returned sat
[2022-05-18 08:42:58] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 256 ms returned unsat
[2022-05-18 08:43:00] [INFO ] [Real]Absence check using 76 positive place invariants in 565 ms returned sat
[2022-05-18 08:43:01] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 253 ms returned unsat
[2022-05-18 08:43:03] [INFO ] [Real]Absence check using 76 positive place invariants in 594 ms returned sat
[2022-05-18 08:43:04] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 812 ms returned unsat
[2022-05-18 08:43:07] [INFO ] [Real]Absence check using 76 positive place invariants in 573 ms returned sat
[2022-05-18 08:43:08] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 1091 ms returned sat
[2022-05-18 08:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:43: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 4
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 08:43:12] [INFO ] [Real]Absence check using 76 positive place invariants in 579 ms returned sat
[2022-05-18 08:43:13] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 1005 ms returned sat
[2022-05-18 08:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:43: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 08:43:17] [INFO ] [Real]Absence check using 76 positive place invariants in 610 ms returned sat
[2022-05-18 08:43:18] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 1063 ms returned unsat
[2022-05-18 08:43:20] [INFO ] [Real]Absence check using 76 positive place invariants in 579 ms returned sat
[2022-05-18 08:43:21] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 260 ms returned unsat
[2022-05-18 08:43:23] [INFO ] [Real]Absence check using 76 positive place invariants in 600 ms returned sat
[2022-05-18 08:43:23] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 267 ms returned unsat
[2022-05-18 08:43:26] [INFO ] [Real]Absence check using 76 positive place invariants in 554 ms returned sat
[2022-05-18 08:43:26] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 260 ms returned unsat
[2022-05-18 08:43:29] [INFO ] [Real]Absence check using 76 positive place invariants in 563 ms returned sat
[2022-05-18 08:43:30] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 1065 ms returned sat
[2022-05-18 08:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:43:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 08:43:34] [INFO ] [Real]Absence check using 76 positive place invariants in 555 ms returned sat
[2022-05-18 08:43:35] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 1008 ms returned sat
[2022-05-18 08:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:43:36] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 08:43:39] [INFO ] [Real]Absence check using 76 positive place invariants in 574 ms returned sat
[2022-05-18 08:43:40] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 1236 ms returned sat
[2022-05-18 08:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:43: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: Broken pipe")... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 08:43:44] [INFO ] [Real]Absence check using 76 positive place invariants in 579 ms returned sat
[2022-05-18 08:43:45] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 818 ms returned unsat
[2022-05-18 08:43:47] [INFO ] [Real]Absence check using 76 positive place invariants in 567 ms returned sat
[2022-05-18 08:43:47] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 251 ms returned unsat
[2022-05-18 08:43:50] [INFO ] [Real]Absence check using 76 positive place invariants in 574 ms returned sat
[2022-05-18 08:43:50] [INFO ] [Real]Absence check using 76 positive and 1223 generalized place invariants in 257 ms returned unsat
Current structural bounds on expressions (after SMT) : [25, 1, 1, 1, 25, 25, 1, 1, 1, 1, 25, 25, 75, 1, 1, 1] Max seen :[0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 19254 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 19254/19254 places, 27973/27973 transitions.
Graph (complete) has 60623 edges and 19254 vertex of which 19204 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.60 ms
Discarding 50 places :
Also discarding 0 output transitions
Drop transitions removed 6583 transitions
Trivial Post-agglo rules discarded 6583 transitions
Performed 6583 trivial Post agglomeration. Transition count delta: 6583
Iterating post reduction 0 with 6583 rules applied. Total rules applied 6584 place count 19204 transition count 21390
Reduce places removed 6583 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 6596 rules applied. Total rules applied 13180 place count 12621 transition count 21377
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 13193 place count 12608 transition count 21377
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13193 place count 12608 transition count 20828
Deduced a syphon composed of 549 places in 23 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14291 place count 12059 transition count 20828
Discarding 6045 places :
Symmetric choice reduction at 3 with 6045 rule applications. Total rules 20336 place count 6014 transition count 14783
Iterating global reduction 3 with 6045 rules applied. Total rules applied 26381 place count 6014 transition count 14783
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 26381 place count 6014 transition count 14765
Deduced a syphon composed of 18 places in 14 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 26417 place count 5996 transition count 14765
Discarding 545 places :
Symmetric choice reduction at 3 with 545 rule applications. Total rules 26962 place count 5451 transition count 8770
Iterating global reduction 3 with 545 rules applied. Total rules applied 27507 place count 5451 transition count 8770
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27557 place count 5426 transition count 8745
Free-agglomeration rule (complex) applied 341 times.
Iterating global reduction 3 with 341 rules applied. Total rules applied 27898 place count 5426 transition count 13854
Reduce places removed 341 places and 0 transitions.
Iterating post reduction 3 with 341 rules applied. Total rules applied 28239 place count 5085 transition count 13854
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 4 with 99 rules applied. Total rules applied 28338 place count 5085 transition count 13854
Applied a total of 28338 rules in 6391 ms. Remains 5085 /19254 variables (removed 14169) and now considering 13854/27973 (removed 14119) transitions.
Finished structural reductions, in 1 iterations. Remains : 5085/19254 places, 13854/27973 transitions.
Normalized transition count is 12968 out of 13854 initially.
// Phase 1: matrix 12968 rows 5085 cols
[2022-05-18 08:43:57] [INFO ] Computed 1249 place invariants in 332 ms
Interrupted random walk after 508518 steps, including 7504 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 2
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 539426 steps, including 1085 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
Interrupted Best-First random walk after 538422 steps, including 1083 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
Interrupted Best-First random walk after 541337 steps, including 1089 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen 0
Interrupted Best-First random walk after 543234 steps, including 1093 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen 0
[2022-05-18 08:44:47] [INFO ] Flow matrix only has 12968 transitions (discarded 886 similar events)
// Phase 1: matrix 12968 rows 5085 cols
[2022-05-18 08:44:48] [INFO ] Computed 1249 place invariants in 371 ms
[2022-05-18 08:44:48] [INFO ] [Real]Absence check using 49 positive place invariants in 121 ms returned sat
[2022-05-18 08:44:48] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 308 ms returned sat
[2022-05-18 08:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:44:55] [INFO ] [Real]Absence check using state equation in 6117 ms returned sat
[2022-05-18 08:44:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:44:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 117 ms returned sat
[2022-05-18 08:44:56] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 342 ms returned sat
[2022-05-18 08:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:45:03] [INFO ] [Nat]Absence check using state equation in 6556 ms returned sat
[2022-05-18 08:45:03] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2022-05-18 08:45:06] [INFO ] [Nat]Added 8602 Read/Feed constraints in 3128 ms returned sat
[2022-05-18 08:45:13] [INFO ] Deduced a trap composed of 531 places in 6879 ms of which 9 ms to minimize.
[2022-05-18 08:45:22] [INFO ] Deduced a trap composed of 490 places in 6904 ms of which 9 ms to minimize.
[2022-05-18 08:45:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 17057 ms
[2022-05-18 08:45:24] [INFO ] Computed and/alt/rep : 4621/6658/4621 causal constraints (skipped 8322 transitions) in 1283 ms.
[2022-05-18 08:45:27] [INFO ] Added : 13 causal constraints over 3 iterations in 4493 ms. Result :sat
[2022-05-18 08:45:28] [INFO ] [Real]Absence check using 49 positive place invariants in 118 ms returned sat
[2022-05-18 08:45:29] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 343 ms returned sat
[2022-05-18 08:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:45:35] [INFO ] [Real]Absence check using state equation in 6142 ms returned sat
[2022-05-18 08:45:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:45:36] [INFO ] [Nat]Absence check using 49 positive place invariants in 107 ms returned sat
[2022-05-18 08:45:36] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 322 ms returned sat
[2022-05-18 08:45:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:45:43] [INFO ] [Nat]Absence check using state equation in 7215 ms returned sat
[2022-05-18 08:45:46] [INFO ] [Nat]Added 8602 Read/Feed constraints in 2406 ms returned sat
[2022-05-18 08:45:47] [INFO ] Computed and/alt/rep : 4621/6658/4621 causal constraints (skipped 8322 transitions) in 1262 ms.
[2022-05-18 08:45:51] [INFO ] Added : 11 causal constraints over 3 iterations in 4360 ms. Result :sat
[2022-05-18 08:45:52] [INFO ] [Real]Absence check using 49 positive place invariants in 112 ms returned sat
[2022-05-18 08:45:52] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 328 ms returned sat
[2022-05-18 08:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:45:58] [INFO ] [Real]Absence check using state equation in 6079 ms returned sat
[2022-05-18 08:45:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:45:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 113 ms returned sat
[2022-05-18 08:45:59] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 317 ms returned sat
[2022-05-18 08:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:46:07] [INFO ] [Nat]Absence check using state equation in 7288 ms returned sat
[2022-05-18 08:46:10] [INFO ] [Nat]Added 8602 Read/Feed constraints in 2906 ms returned sat
[2022-05-18 08:46:11] [INFO ] Computed and/alt/rep : 4621/6658/4621 causal constraints (skipped 8322 transitions) in 1029 ms.
[2022-05-18 08:46:14] [INFO ] Added : 11 causal constraints over 3 iterations in 4330 ms. Result :sat
[2022-05-18 08:46:15] [INFO ] [Real]Absence check using 49 positive place invariants in 109 ms returned sat
[2022-05-18 08:46:16] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 309 ms returned sat
[2022-05-18 08:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:46:23] [INFO ] [Real]Absence check using state equation in 7420 ms returned sat
[2022-05-18 08:46:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:46:24] [INFO ] [Nat]Absence check using 49 positive place invariants in 110 ms returned sat
[2022-05-18 08:46:24] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 328 ms returned sat
[2022-05-18 08:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:46:34] [INFO ] [Nat]Absence check using state equation in 9552 ms returned sat
[2022-05-18 08:46:37] [INFO ] [Nat]Added 8602 Read/Feed constraints in 3363 ms returned sat
[2022-05-18 08:46:39] [INFO ] Computed and/alt/rep : 4621/6658/4621 causal constraints (skipped 8322 transitions) in 1061 ms.
[2022-05-18 08:46:41] [INFO ] Added : 10 causal constraints over 2 iterations in 3312 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 2] Max seen :[0, 0, 0, 0]
Support contains 4 out of 5085 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5085/5085 places, 13854/13854 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 5085 transition count 13852
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5083 transition count 13852
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5083 transition count 13850
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 5081 transition count 13850
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 5079 transition count 13848
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 5079 transition count 13848
Applied a total of 12 rules in 2105 ms. Remains 5079 /5085 variables (removed 6) and now considering 13848/13854 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 5079/5085 places, 13848/13854 transitions.
Normalized transition count is 12962 out of 13848 initially.
// Phase 1: matrix 12962 rows 5079 cols
[2022-05-18 08:46:46] [INFO ] Computed 1249 place invariants in 329 ms
Interrupted random walk after 504273 steps, including 7442 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 540522 steps, including 1088 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen 0
Interrupted Best-First random walk after 545868 steps, including 1098 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 538220 steps, including 1083 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
[2022-05-18 08:47:31] [INFO ] Flow matrix only has 12962 transitions (discarded 886 similar events)
// Phase 1: matrix 12962 rows 5079 cols
[2022-05-18 08:47:31] [INFO ] Computed 1249 place invariants in 360 ms
[2022-05-18 08:47:32] [INFO ] [Real]Absence check using 49 positive place invariants in 110 ms returned sat
[2022-05-18 08:47:32] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 313 ms returned sat
[2022-05-18 08:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:47:39] [INFO ] [Real]Absence check using state equation in 7085 ms returned sat
[2022-05-18 08:47:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:47:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 113 ms returned sat
[2022-05-18 08:47:40] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 323 ms returned sat
[2022-05-18 08:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:47:47] [INFO ] [Nat]Absence check using state equation in 7042 ms returned sat
[2022-05-18 08:47:48] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2022-05-18 08:47:51] [INFO ] [Nat]Added 8602 Read/Feed constraints in 2905 ms returned sat
[2022-05-18 08:47:52] [INFO ] Computed and/alt/rep : 4616/6651/4616 causal constraints (skipped 8321 transitions) in 970 ms.
[2022-05-18 08:47:55] [INFO ] Added : 11 causal constraints over 3 iterations in 4045 ms. Result :sat
[2022-05-18 08:47:56] [INFO ] [Real]Absence check using 49 positive place invariants in 106 ms returned sat
[2022-05-18 08:47:56] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 325 ms returned sat
[2022-05-18 08:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:48:03] [INFO ] [Real]Absence check using state equation in 6277 ms returned sat
[2022-05-18 08:48:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:48:04] [INFO ] [Nat]Absence check using 49 positive place invariants in 106 ms returned sat
[2022-05-18 08:48:04] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 306 ms returned sat
[2022-05-18 08:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:48:10] [INFO ] [Nat]Absence check using state equation in 5968 ms returned sat
[2022-05-18 08:48:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 08:48:14] [INFO ] [Nat]Added 8602 Read/Feed constraints in 4421 ms returned sat
[2022-05-18 08:48:22] [INFO ] Deduced a trap composed of 269 places in 7361 ms of which 5 ms to minimize.
[2022-05-18 08:48:30] [INFO ] Deduced a trap composed of 766 places in 7380 ms of which 5 ms to minimize.
[2022-05-18 08:48:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 16562 ms
[2022-05-18 08:48:32] [INFO ] Computed and/alt/rep : 4616/6651/4616 causal constraints (skipped 8321 transitions) in 1014 ms.
[2022-05-18 08:48:35] [INFO ] Added : 11 causal constraints over 3 iterations in 4046 ms. Result :sat
[2022-05-18 08:48:36] [INFO ] [Real]Absence check using 49 positive place invariants in 106 ms returned sat
[2022-05-18 08:48:36] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 307 ms returned sat
[2022-05-18 08:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:48:43] [INFO ] [Real]Absence check using state equation in 6520 ms returned sat
[2022-05-18 08:48:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:48:44] [INFO ] [Nat]Absence check using 49 positive place invariants in 106 ms returned sat
[2022-05-18 08:48:44] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 308 ms returned sat
[2022-05-18 08:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:48:50] [INFO ] [Nat]Absence check using state equation in 6410 ms returned sat
[2022-05-18 08:48:52] [INFO ] [Nat]Added 8602 Read/Feed constraints in 1807 ms returned sat
[2022-05-18 08:48:54] [INFO ] Computed and/alt/rep : 4616/6651/4616 causal constraints (skipped 8321 transitions) in 992 ms.
[2022-05-18 08:48:56] [INFO ] Added : 10 causal constraints over 2 iterations in 3185 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 2] Max seen :[0, 0, 0]
Support contains 3 out of 5079 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5079/5079 places, 13848/13848 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 5079 transition count 13847
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5078 transition count 13847
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5078 transition count 13847
Applied a total of 3 rules in 1761 ms. Remains 5078 /5079 variables (removed 1) and now considering 13847/13848 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 5078/5079 places, 13847/13848 transitions.
Normalized transition count is 12961 out of 13847 initially.
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:49:00] [INFO ] Computed 1249 place invariants in 348 ms
Interrupted random walk after 508998 steps, including 7515 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Interrupted Best-First random walk after 529299 steps, including 1065 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen 0
Interrupted Best-First random walk after 528296 steps, including 1063 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen 0
Interrupted Best-First random walk after 521094 steps, including 1048 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen 0
[2022-05-18 08:49:45] [INFO ] Flow matrix only has 12961 transitions (discarded 886 similar events)
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:49:45] [INFO ] Computed 1249 place invariants in 385 ms
[2022-05-18 08:49:46] [INFO ] [Real]Absence check using 49 positive place invariants in 119 ms returned sat
[2022-05-18 08:49:46] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 445 ms returned sat
[2022-05-18 08:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:49:57] [INFO ] [Real]Absence check using state equation in 10477 ms returned sat
[2022-05-18 08:49:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:49:58] [INFO ] [Nat]Absence check using 49 positive place invariants in 116 ms returned sat
[2022-05-18 08:49:58] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 350 ms returned sat
[2022-05-18 08:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:50:08] [INFO ] [Nat]Absence check using state equation in 9924 ms returned sat
[2022-05-18 08:50:08] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2022-05-18 08:50:11] [INFO ] [Nat]Added 8602 Read/Feed constraints in 3389 ms returned sat
[2022-05-18 08:50:13] [INFO ] Computed and/alt/rep : 4615/6650/4615 causal constraints (skipped 8321 transitions) in 1017 ms.
[2022-05-18 08:50:16] [INFO ] Added : 11 causal constraints over 3 iterations in 4204 ms. Result :sat
[2022-05-18 08:50:17] [INFO ] [Real]Absence check using 49 positive place invariants in 118 ms returned sat
[2022-05-18 08:50:17] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 371 ms returned sat
[2022-05-18 08:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:50:28] [INFO ] [Real]Absence check using state equation in 10505 ms returned sat
[2022-05-18 08:50:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:50:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 120 ms returned sat
[2022-05-18 08:50:29] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 416 ms returned sat
[2022-05-18 08:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:50:39] [INFO ] [Nat]Absence check using state equation in 9576 ms returned sat
[2022-05-18 08:50:42] [INFO ] [Nat]Added 8602 Read/Feed constraints in 3069 ms returned sat
[2022-05-18 08:50:43] [INFO ] Computed and/alt/rep : 4615/6650/4615 causal constraints (skipped 8321 transitions) in 1014 ms.
[2022-05-18 08:50:47] [INFO ] Added : 11 causal constraints over 3 iterations in 4176 ms. Result :sat
[2022-05-18 08:50:48] [INFO ] [Real]Absence check using 49 positive place invariants in 112 ms returned sat
[2022-05-18 08:50:48] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 360 ms returned sat
[2022-05-18 08:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:50:56] [INFO ] [Real]Absence check using state equation in 7843 ms returned sat
[2022-05-18 08:50:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:50:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 105 ms returned sat
[2022-05-18 08:50:57] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 293 ms returned sat
[2022-05-18 08:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:51:03] [INFO ] [Nat]Absence check using state equation in 5658 ms returned sat
[2022-05-18 08:51:06] [INFO ] [Nat]Added 8602 Read/Feed constraints in 3296 ms returned sat
[2022-05-18 08:51:07] [INFO ] Computed and/alt/rep : 4615/6650/4615 causal constraints (skipped 8321 transitions) in 1017 ms.
[2022-05-18 08:51:10] [INFO ] Added : 10 causal constraints over 2 iterations in 3302 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 2] Max seen :[0, 0, 0]
Support contains 3 out of 5078 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5078/5078 places, 13847/13847 transitions.
Applied a total of 0 rules in 844 ms. Remains 5078 /5078 variables (removed 0) and now considering 13847/13847 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5078/5078 places, 13847/13847 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5078/5078 places, 13847/13847 transitions.
Applied a total of 0 rules in 826 ms. Remains 5078 /5078 variables (removed 0) and now considering 13847/13847 (removed 0) transitions.
[2022-05-18 08:51:13] [INFO ] Flow matrix only has 12961 transitions (discarded 886 similar events)
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:51:13] [INFO ] Computed 1249 place invariants in 358 ms
[2022-05-18 08:51:19] [INFO ] Implicit Places using invariants in 5545 ms returned []
Implicit Place search using SMT only with invariants took 5546 ms to find 0 implicit places.
[2022-05-18 08:51:19] [INFO ] Flow matrix only has 12961 transitions (discarded 886 similar events)
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:51:19] [INFO ] Computed 1249 place invariants in 337 ms
[2022-05-18 08:51:27] [INFO ] Dead Transitions using invariants and state equation in 8206 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5078/5078 places, 13847/13847 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-05
Normalized transition count is 12961 out of 13847 initially.
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:51:27] [INFO ] Computed 1249 place invariants in 346 ms
Incomplete random walk after 10000 steps, including 147 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
[2022-05-18 08:51:28] [INFO ] Flow matrix only has 12961 transitions (discarded 886 similar events)
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:51:28] [INFO ] Computed 1249 place invariants in 400 ms
[2022-05-18 08:51:29] [INFO ] [Real]Absence check using 49 positive place invariants in 110 ms returned sat
[2022-05-18 08:51:29] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 347 ms returned sat
[2022-05-18 08:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:51:33] [INFO ] [Real]Absence check using state equation in 4067 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5078 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5078/5078 places, 13847/13847 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5078 transition count 13846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5077 transition count 13846
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 5077 transition count 13845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5076 transition count 13845
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 5075 transition count 13844
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 5075 transition count 13844
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 5075 transition count 13844
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 5074 transition count 13843
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 5074 transition count 13843
Applied a total of 9 rules in 3562 ms. Remains 5074 /5078 variables (removed 4) and now considering 13843/13847 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 5074/5078 places, 13843/13847 transitions.
Normalized transition count is 12957 out of 13843 initially.
// Phase 1: matrix 12957 rows 5074 cols
[2022-05-18 08:51:37] [INFO ] Computed 1249 place invariants in 383 ms
Interrupted random walk after 456506 steps, including 6736 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Interrupted Best-First random walk after 499720 steps, including 1005 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 0
[2022-05-18 08:52:12] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2022-05-18 08:52:13] [INFO ] Computed 1249 place invariants in 391 ms
[2022-05-18 08:52:13] [INFO ] [Real]Absence check using 49 positive place invariants in 138 ms returned sat
[2022-05-18 08:52:14] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 485 ms returned sat
[2022-05-18 08:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:52:24] [INFO ] [Real]Absence check using state equation in 9980 ms returned sat
[2022-05-18 08:52:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:52:25] [INFO ] [Nat]Absence check using 49 positive place invariants in 121 ms returned sat
[2022-05-18 08:52:25] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 441 ms returned sat
[2022-05-18 08:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:52:36] [INFO ] [Nat]Absence check using state equation in 10412 ms returned sat
[2022-05-18 08:52:36] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2022-05-18 08:52:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 08:52:40] [INFO ] [Nat]Added 8602 Read/Feed constraints in 4223 ms returned sat
[2022-05-18 08:52:42] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 8320 transitions) in 1075 ms.
[2022-05-18 08:52:45] [INFO ] Added : 11 causal constraints over 3 iterations in 4385 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5074 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 896 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5074/5074 places, 13843/13843 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 927 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
[2022-05-18 08:52:48] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2022-05-18 08:52:48] [INFO ] Computed 1249 place invariants in 365 ms
[2022-05-18 08:52:54] [INFO ] Implicit Places using invariants in 6251 ms returned []
Implicit Place search using SMT only with invariants took 6252 ms to find 0 implicit places.
[2022-05-18 08:52:54] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2022-05-18 08:52:54] [INFO ] Computed 1249 place invariants in 352 ms
[2022-05-18 08:53:03] [INFO ] Dead Transitions using invariants and state equation in 9202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5074/5074 places, 13843/13843 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-05 in 96499 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-10
Normalized transition count is 12961 out of 13847 initially.
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:53:04] [INFO ] Computed 1249 place invariants in 358 ms
Incomplete random walk after 10000 steps, including 147 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
[2022-05-18 08:53:04] [INFO ] Flow matrix only has 12961 transitions (discarded 886 similar events)
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:53:05] [INFO ] Computed 1249 place invariants in 356 ms
[2022-05-18 08:53:05] [INFO ] [Real]Absence check using 49 positive place invariants in 117 ms returned sat
[2022-05-18 08:53:06] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 389 ms returned sat
[2022-05-18 08:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:53:10] [INFO ] [Real]Absence check using state equation in 4033 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5078 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5078/5078 places, 13847/13847 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5078 transition count 13846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5077 transition count 13846
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 5077 transition count 13845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5076 transition count 13845
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 5075 transition count 13844
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 5075 transition count 13844
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 5075 transition count 13844
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 5074 transition count 13843
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 5074 transition count 13843
Applied a total of 9 rules in 3342 ms. Remains 5074 /5078 variables (removed 4) and now considering 13843/13847 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 5074/5078 places, 13843/13847 transitions.
Normalized transition count is 12957 out of 13843 initially.
// Phase 1: matrix 12957 rows 5074 cols
[2022-05-18 08:53:14] [INFO ] Computed 1249 place invariants in 393 ms
Interrupted random walk after 474063 steps, including 6998 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Interrupted Best-First random walk after 503590 steps, including 1013 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 0
[2022-05-18 08:53:49] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2022-05-18 08:53:49] [INFO ] Computed 1249 place invariants in 365 ms
[2022-05-18 08:53:50] [INFO ] [Real]Absence check using 49 positive place invariants in 112 ms returned sat
[2022-05-18 08:53:50] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 391 ms returned sat
[2022-05-18 08:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:53:58] [INFO ] [Real]Absence check using state equation in 8390 ms returned sat
[2022-05-18 08:53:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:53:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 116 ms returned sat
[2022-05-18 08:54:00] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 354 ms returned sat
[2022-05-18 08:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:54:09] [INFO ] [Nat]Absence check using state equation in 9038 ms returned sat
[2022-05-18 08:54:09] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2022-05-18 08:54:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 08:54:14] [INFO ] [Nat]Added 8602 Read/Feed constraints in 5438 ms returned sat
[2022-05-18 08:54:16] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 8320 transitions) in 1075 ms.
[2022-05-18 08:54:19] [INFO ] Added : 11 causal constraints over 3 iterations in 4444 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5074 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 1044 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5074/5074 places, 13843/13843 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 1117 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
[2022-05-18 08:54:22] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2022-05-18 08:54:23] [INFO ] Computed 1249 place invariants in 445 ms
[2022-05-18 08:54:28] [INFO ] Implicit Places using invariants in 5761 ms returned []
Implicit Place search using SMT only with invariants took 5772 ms to find 0 implicit places.
[2022-05-18 08:54:28] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2022-05-18 08:54:28] [INFO ] Computed 1249 place invariants in 377 ms
[2022-05-18 08:54:37] [INFO ] Dead Transitions using invariants and state equation in 8540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5074/5074 places, 13843/13843 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-10 in 93308 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-12
Normalized transition count is 12961 out of 13847 initially.
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:54:37] [INFO ] Computed 1249 place invariants in 358 ms
Incomplete random walk after 10000 steps, including 147 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
[2022-05-18 08:54:38] [INFO ] Flow matrix only has 12961 transitions (discarded 886 similar events)
// Phase 1: matrix 12961 rows 5078 cols
[2022-05-18 08:54:38] [INFO ] Computed 1249 place invariants in 366 ms
[2022-05-18 08:54:39] [INFO ] [Real]Absence check using 49 positive place invariants in 109 ms returned sat
[2022-05-18 08:54:39] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 348 ms returned sat
[2022-05-18 08:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:54:43] [INFO ] [Real]Absence check using state equation in 4105 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 5078 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5078/5078 places, 13847/13847 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 5078 transition count 13845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5076 transition count 13845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 5075 transition count 13844
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 5075 transition count 13844
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 5075 transition count 13843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 5074 transition count 13843
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 5073 transition count 13842
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 5073 transition count 13842
Applied a total of 10 rules in 2592 ms. Remains 5073 /5078 variables (removed 5) and now considering 13842/13847 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 5073/5078 places, 13842/13847 transitions.
Normalized transition count is 12956 out of 13842 initially.
// Phase 1: matrix 12956 rows 5073 cols
[2022-05-18 08:54:46] [INFO ] Computed 1249 place invariants in 351 ms
Interrupted random walk after 497270 steps, including 7340 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Interrupted Best-First random walk after 502030 steps, including 1010 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 0
[2022-05-18 08:55:21] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2022-05-18 08:55:21] [INFO ] Computed 1249 place invariants in 345 ms
[2022-05-18 08:55:22] [INFO ] [Real]Absence check using 49 positive place invariants in 103 ms returned sat
[2022-05-18 08:55:22] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 328 ms returned sat
[2022-05-18 08:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:55:29] [INFO ] [Real]Absence check using state equation in 6123 ms returned sat
[2022-05-18 08:55:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:55:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 112 ms returned sat
[2022-05-18 08:55:30] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 321 ms returned sat
[2022-05-18 08:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:55:37] [INFO ] [Nat]Absence check using state equation in 7561 ms returned sat
[2022-05-18 08:55:37] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2022-05-18 08:55:41] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 08:55:42] [INFO ] [Nat]Added 8602 Read/Feed constraints in 4941 ms returned sat
[2022-05-18 08:55:44] [INFO ] Computed and/alt/rep : 4611/6644/4611 causal constraints (skipped 8320 transitions) in 934 ms.
[2022-05-18 08:55:46] [INFO ] Added : 10 causal constraints over 2 iterations in 3253 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 5073 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 852 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 821 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2022-05-18 08:55:49] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2022-05-18 08:55:49] [INFO ] Computed 1249 place invariants in 369 ms
[2022-05-18 08:55:55] [INFO ] Implicit Places using invariants in 6553 ms returned []
Implicit Place search using SMT only with invariants took 6554 ms to find 0 implicit places.
[2022-05-18 08:55:55] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2022-05-18 08:55:56] [INFO ] Computed 1249 place invariants in 356 ms
[2022-05-18 08:56:04] [INFO ] Dead Transitions using invariants and state equation in 8626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5073/5073 places, 13842/13842 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C11-UpperBounds-12 in 87231 ms.
[2022-05-18 08:56:06] [INFO ] Flatten gal took : 1346 ms
[2022-05-18 08:56:06] [INFO ] Applying decomposition
[2022-05-18 08:56:07] [INFO ] Flatten gal took : 718 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5190275442216582774.txt' '-o' '/tmp/graph5190275442216582774.bin' '-w' '/tmp/graph5190275442216582774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5190275442216582774.bin' '-l' '-1' '-v' '-w' '/tmp/graph5190275442216582774.weights' '-q' '0' '-e' '0.001'
[2022-05-18 08:56:10] [INFO ] Decomposing Gal with order
[2022-05-18 08:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:56:18] [INFO ] Removed a total of 32130 redundant transitions.
[2022-05-18 08:56:19] [INFO ] Flatten gal took : 7372 ms
[2022-05-18 08:56:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6276 labels/synchronizations in 1349 ms.
[2022-05-18 08:56:22] [INFO ] Time to serialize gal into /tmp/UpperBounds11124353403440238457.gal : 325 ms
[2022-05-18 08:56:22] [INFO ] Time to serialize properties into /tmp/UpperBounds18010399287796793751.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11124353403440238457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18010399287796793751.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds18010399287796793751.prop.
ITS-tools command line returned an error code 137
[2022-05-18 09:04:42] [INFO ] Flatten gal took : 1714 ms
[2022-05-18 09:04:42] [INFO ] Time to serialize gal into /tmp/UpperBounds775112549676429888.gal : 273 ms
[2022-05-18 09:04:42] [INFO ] Time to serialize properties into /tmp/UpperBounds10418238100869259729.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds775112549676429888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10418238100869259729.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds10418238100869259729.prop.
ITS-tools command line returned an error code 137
[2022-05-18 09:16:44] [INFO ] Flatten gal took : 2893 ms
[2022-05-18 09:16:46] [INFO ] Input system was already deterministic with 13847 transitions.
[2022-05-18 09:16:46] [INFO ] Transformed 5078 places.
[2022-05-18 09:16:46] [INFO ] Transformed 13847 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-18 09:17:18] [INFO ] Time to serialize gal into /tmp/UpperBounds17027520104910392566.gal : 369 ms
[2022-05-18 09:17:18] [INFO ] Time to serialize properties into /tmp/UpperBounds14861303238870678556.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17027520104910392566.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14861303238870678556.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14861303238870678556.prop.
ITS-tools command line returned an error code 137
Total runtime 2761587 ms.

BK_STOP 1652866124509

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S24C11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C11, 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 r132-tall-165271821300781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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