Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 37K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 12 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 12 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 12 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 12 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 6.3K May 11 19:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 11 19:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 11 16:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 16:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 39M May 12 08:13 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 gen-UpperBounds-00
FORMULA_NAME gen-UpperBounds-01
FORMULA_NAME gen-UpperBounds-02
FORMULA_NAME gen-UpperBounds-03
FORMULA_NAME gen-UpperBounds-04
FORMULA_NAME gen-UpperBounds-05
FORMULA_NAME gen-UpperBounds-06
FORMULA_NAME gen-UpperBounds-07
FORMULA_NAME gen-UpperBounds-08
FORMULA_NAME gen-UpperBounds-09
FORMULA_NAME gen-UpperBounds-10
FORMULA_NAME gen-UpperBounds-11
FORMULA_NAME gen-UpperBounds-12
FORMULA_NAME gen-UpperBounds-13
FORMULA_NAME gen-UpperBounds-14
FORMULA_NAME gen-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621384752395

Running Version 0
[2021-05-19 00:39:20] [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]
[2021-05-19 00:39:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 00:39:21] [INFO ] Load time of PNML (sax parser for PT used): 983 ms
[2021-05-19 00:39:21] [INFO ] Transformed 18180 places.
[2021-05-19 00:39:21] [INFO ] Transformed 28411 transitions.
[2021-05-19 00:39:21] [INFO ] Parsed PT model containing 18180 places and 28411 transitions in 1153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Normalized transition count is 27355 out of 28411 initially.
// Phase 1: matrix 27355 rows 18180 cols
[2021-05-19 00:39:26] [INFO ] Computed 1473 place invariants in 3945 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :2
[2021-05-19 00:39:27] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18180 cols
[2021-05-19 00:39:31] [INFO ] Computed 1473 place invariants in 3653 ms
[2021-05-19 00:39:37] [INFO ] [Real]Absence check using 78 positive place invariants in 517 ms returned sat
[2021-05-19 00:39:38] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 997 ms returned sat
[2021-05-19 00:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:39:39] [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 0
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 00:39:41] [INFO ] [Real]Absence check using 78 positive place invariants in 510 ms returned sat
[2021-05-19 00:39:42] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 953 ms returned sat
[2021-05-19 00:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:39:44] [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 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 00:39:46] [INFO ] [Real]Absence check using 78 positive place invariants in 520 ms returned sat
[2021-05-19 00:39:47] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 958 ms returned sat
[2021-05-19 00:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:39:49] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 00:39:51] [INFO ] [Real]Absence check using 78 positive place invariants in 504 ms returned sat
[2021-05-19 00:39:52] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 540 ms returned unsat
[2021-05-19 00:39:54] [INFO ] [Real]Absence check using 78 positive place invariants in 503 ms returned sat
[2021-05-19 00:39:55] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 975 ms returned sat
[2021-05-19 00:39:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:39:57] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 00:39:59] [INFO ] [Real]Absence check using 78 positive place invariants in 517 ms returned sat
[2021-05-19 00:40:00] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 563 ms returned unsat
[2021-05-19 00:40:02] [INFO ] [Real]Absence check using 78 positive place invariants in 515 ms returned sat
[2021-05-19 00:40:03] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1004 ms returned sat
[2021-05-19 00:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:40:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 00:40:08] [INFO ] [Real]Absence check using 78 positive place invariants in 526 ms returned sat
[2021-05-19 00:40:09] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 989 ms returned unsat
[2021-05-19 00:40:11] [INFO ] [Real]Absence check using 78 positive place invariants in 513 ms returned sat
[2021-05-19 00:40:12] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 562 ms returned unsat
[2021-05-19 00:40:15] [INFO ] [Real]Absence check using 78 positive place invariants in 503 ms returned sat
[2021-05-19 00:40:16] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 984 ms returned sat
[2021-05-19 00:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:40:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 00:40:20] [INFO ] [Real]Absence check using 78 positive place invariants in 491 ms returned sat
[2021-05-19 00:40:20] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 963 ms returned sat
[2021-05-19 00:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:40:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 00:40:25] [INFO ] [Real]Absence check using 78 positive place invariants in 497 ms returned sat
[2021-05-19 00:40:26] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 994 ms returned sat
[2021-05-19 00:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:40:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 00:40:29] [INFO ] [Real]Absence check using 78 positive place invariants in 508 ms returned sat
[2021-05-19 00:40:30] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 557 ms returned unsat
[2021-05-19 00:40:33] [INFO ] [Real]Absence check using 78 positive place invariants in 514 ms returned sat
[2021-05-19 00:40:33] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 555 ms returned unsat
[2021-05-19 00:40:36] [INFO ] [Real]Absence check using 78 positive place invariants in 525 ms returned sat
[2021-05-19 00:40:36] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 550 ms returned unsat
[2021-05-19 00:40:39] [INFO ] [Real]Absence check using 78 positive place invariants in 507 ms returned sat
[2021-05-19 00:40:40] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 972 ms returned sat
[2021-05-19 00:40:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:40: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 15
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 99, 1, 1, 1, 99, 1, 1, 1, 1, 99, 1, 1, 1, 1] Max seen :[0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0]
FORMULA gen-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 18180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18180/18180 places, 28411/28411 transitions.
Graph (complete) has 66065 edges and 18180 vertex of which 18136 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.52 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions removed 4221 transitions
Trivial Post-agglo rules discarded 4221 transitions
Performed 4221 trivial Post agglomeration. Transition count delta: 4221
Iterating post reduction 0 with 4221 rules applied. Total rules applied 4222 place count 18136 transition count 24190
Reduce places removed 4221 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8446 place count 13915 transition count 24187
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8449 place count 13912 transition count 24187
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 264 Pre rules applied. Total rules applied 8449 place count 13912 transition count 23923
Deduced a syphon composed of 264 places in 27 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 3 with 528 rules applied. Total rules applied 8977 place count 13648 transition count 23923
Discarding 3957 places :
Symmetric choice reduction at 3 with 3957 rule applications. Total rules 12934 place count 9691 transition count 19966
Iterating global reduction 3 with 3957 rules applied. Total rules applied 16891 place count 9691 transition count 19966
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 16891 place count 9691 transition count 19960
Deduced a syphon composed of 6 places in 22 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 16903 place count 9685 transition count 19960
Discarding 987 places :
Symmetric choice reduction at 3 with 987 rule applications. Total rules 17890 place count 8698 transition count 16012
Iterating global reduction 3 with 987 rules applied. Total rules applied 18877 place count 8698 transition count 16012
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 15 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 18943 place count 8665 transition count 15979
Free-agglomeration rule (complex) applied 579 times.
Iterating global reduction 3 with 579 rules applied. Total rules applied 19522 place count 8665 transition count 18361
Reduce places removed 579 places and 0 transitions.
Iterating post reduction 3 with 579 rules applied. Total rules applied 20101 place count 8086 transition count 18361
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 4 with 66 rules applied. Total rules applied 20167 place count 8086 transition count 18361
Applied a total of 20167 rules in 13811 ms. Remains 8086 /18180 variables (removed 10094) and now considering 18361/28411 (removed 10050) transitions.
Finished structural reductions, in 1 iterations. Remains : 8086/18180 places, 18361/28411 transitions.
Normalized transition count is 16795 out of 18361 initially.
// Phase 1: matrix 16795 rows 8086 cols
[2021-05-19 00:40:56] [INFO ] Computed 1429 place invariants in 999 ms
Interrupted random walk after 575548 steps, including 22892 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen :{2=1, 4=1, 7=1}
Interrupted Best-First random walk after 828132 steps, including 3031 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen :{2=1}
Interrupted Best-First random walk after 803859 steps, including 2943 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen :{2=1, 4=1, 7=1}
Interrupted Best-First random walk after 835149 steps, including 3057 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen :{2=1, 4=1, 7=1}
Interrupted Best-First random walk after 831001 steps, including 3042 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen :{2=1, 4=1}
Interrupted Best-First random walk after 822670 steps, including 3011 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen :{2=1, 4=1, 7=1}
Interrupted Best-First random walk after 825931 steps, including 3023 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen :{2=1, 4=1, 7=1}
Interrupted Best-First random walk after 812691 steps, including 2975 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen :{2=1, 4=1, 7=1}
Interrupted Best-First random walk after 811806 steps, including 2972 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen :{2=1, 4=1, 7=1}
Interrupted Best-First random walk after 818318 steps, including 2995 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen :{2=1, 7=1}
[2021-05-19 00:42:11] [INFO ] Flow matrix only has 16795 transitions (discarded 1566 similar events)
// Phase 1: matrix 16795 rows 8086 cols
[2021-05-19 00:42:12] [INFO ] Computed 1429 place invariants in 1005 ms
[2021-05-19 00:42:13] [INFO ] [Real]Absence check using 65 positive place invariants in 178 ms returned sat
[2021-05-19 00:42:14] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 440 ms returned sat
[2021-05-19 00:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:42:23] [INFO ] [Real]Absence check using state equation in 9518 ms returned sat
[2021-05-19 00:42:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:42:25] [INFO ] [Nat]Absence check using 65 positive place invariants in 181 ms returned sat
[2021-05-19 00:42:25] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 440 ms returned sat
[2021-05-19 00:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:42:36] [INFO ] [Nat]Absence check using state equation in 10388 ms returned sat
[2021-05-19 00:42:36] [INFO ] State equation strengthened by 9187 read => feed constraints.
[2021-05-19 00:42:39] [INFO ] [Nat]Added 9187 Read/Feed constraints in 3547 ms returned unsat
[2021-05-19 00:42:40] [INFO ] [Real]Absence check using 65 positive place invariants in 176 ms returned sat
[2021-05-19 00:42:41] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 433 ms returned sat
[2021-05-19 00:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:42:51] [INFO ] [Real]Absence check using state equation in 10653 ms returned sat
[2021-05-19 00:42:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:42:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 180 ms returned sat
[2021-05-19 00:42:53] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 417 ms returned sat
[2021-05-19 00:42:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:43:04] [INFO ] [Nat]Absence check using state equation in 10710 ms returned sat
[2021-05-19 00:43:08] [INFO ] [Nat]Added 9187 Read/Feed constraints in 3973 ms returned unsat
[2021-05-19 00:43:09] [INFO ] [Real]Absence check using 65 positive place invariants in 173 ms returned sat
[2021-05-19 00:43:09] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 197 ms returned unsat
[2021-05-19 00:43:10] [INFO ] [Real]Absence check using 65 positive place invariants in 174 ms returned sat
[2021-05-19 00:43:11] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 430 ms returned sat
[2021-05-19 00:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:43:20] [INFO ] [Real]Absence check using state equation in 9328 ms returned sat
[2021-05-19 00:43:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:43:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 177 ms returned sat
[2021-05-19 00:43:22] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 442 ms returned sat
[2021-05-19 00:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:43:32] [INFO ] [Nat]Absence check using state equation in 9981 ms returned sat
[2021-05-19 00:43:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 00:43:36] [INFO ] [Nat]Added 9187 Read/Feed constraints in 4225 ms returned unsat
[2021-05-19 00:43:37] [INFO ] [Real]Absence check using 65 positive place invariants in 176 ms returned sat
[2021-05-19 00:43:37] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 312 ms returned unsat
[2021-05-19 00:43:38] [INFO ] [Real]Absence check using 65 positive place invariants in 173 ms returned sat
[2021-05-19 00:43:39] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 424 ms returned sat
[2021-05-19 00:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:43:50] [INFO ] [Real]Absence check using state equation in 10928 ms returned sat
[2021-05-19 00:43:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:43:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 181 ms returned sat
[2021-05-19 00:43:52] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 440 ms returned sat
[2021-05-19 00:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:44:02] [INFO ] [Nat]Absence check using state equation in 10398 ms returned sat
[2021-05-19 00:44:06] [INFO ] [Nat]Added 9187 Read/Feed constraints in 3553 ms returned unsat
[2021-05-19 00:44:07] [INFO ] [Real]Absence check using 65 positive place invariants in 173 ms returned sat
[2021-05-19 00:44:07] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 426 ms returned sat
[2021-05-19 00:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:44:16] [INFO ] [Real]Absence check using state equation in 9370 ms returned sat
[2021-05-19 00:44:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:44:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 176 ms returned sat
[2021-05-19 00:44:18] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 431 ms returned sat
[2021-05-19 00:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:44:29] [INFO ] [Nat]Absence check using state equation in 11183 ms returned sat
[2021-05-19 00:44:34] [INFO ] [Nat]Added 9187 Read/Feed constraints in 4063 ms returned unsat
[2021-05-19 00:44:34] [INFO ] [Real]Absence check using 65 positive place invariants in 171 ms returned sat
[2021-05-19 00:44:35] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 83 ms returned unsat
[2021-05-19 00:44:36] [INFO ] [Real]Absence check using 65 positive place invariants in 172 ms returned sat
[2021-05-19 00:44:36] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 445 ms returned sat
[2021-05-19 00:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:44:46] [INFO ] [Real]Absence check using state equation in 9775 ms returned sat
[2021-05-19 00:44:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:44:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 173 ms returned sat
[2021-05-19 00:44:48] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 420 ms returned sat
[2021-05-19 00:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:44:57] [INFO ] [Nat]Absence check using state equation in 9354 ms returned sat
[2021-05-19 00:45:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 00:45:04] [INFO ] [Nat]Added 9187 Read/Feed constraints in 7099 ms returned unknown
Current structural bounds on expressions (after SMT) : [0, 0, 1, 0, 1, 0, 0, 1, 1] Max seen :[0, 0, 1, 0, 1, 0, 0, 1, 0]
FORMULA gen-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 8086 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8086/8086 places, 18361/18361 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8086 transition count 18359
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 8084 transition count 18359
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 8081 transition count 18356
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 8081 transition count 18356
Applied a total of 10 rules in 5002 ms. Remains 8081 /8086 variables (removed 5) and now considering 18356/18361 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 8081/8086 places, 18356/18361 transitions.
Normalized transition count is 16790 out of 18356 initially.
// Phase 1: matrix 16790 rows 8081 cols
[2021-05-19 00:45:10] [INFO ] Computed 1429 place invariants in 977 ms
Interrupted random walk after 563527 steps, including 22420 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen :{}
Interrupted Best-First random walk after 809431 steps, including 2963 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen :{}
[2021-05-19 00:45:45] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2021-05-19 00:45:46] [INFO ] Computed 1429 place invariants in 975 ms
[2021-05-19 00:45:47] [INFO ] [Real]Absence check using 65 positive place invariants in 170 ms returned sat
[2021-05-19 00:45:47] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 426 ms returned sat
[2021-05-19 00:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:45:58] [INFO ] [Real]Absence check using state equation in 10157 ms returned sat
[2021-05-19 00:45:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:45:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 178 ms returned sat
[2021-05-19 00:46:00] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 454 ms returned sat
[2021-05-19 00:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:46:10] [INFO ] [Nat]Absence check using state equation in 10201 ms returned sat
[2021-05-19 00:46:10] [INFO ] State equation strengthened by 9187 read => feed constraints.
[2021-05-19 00:46:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 00:46:17] [INFO ] [Nat]Added 9187 Read/Feed constraints in 6762 ms returned unsat
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA gen-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621385187896

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156900731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;