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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 17K Apr 29 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 29 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 29 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 9 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:17 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 16M 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-S32C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652869932752

Running Version 202205111006
[2022-05-18 10:32:13] [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 10:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 10:32:14] [INFO ] Load time of PNML (sax parser for PT used): 753 ms
[2022-05-18 10:32:14] [INFO ] Transformed 13544 places.
[2022-05-18 10:32:14] [INFO ] Transformed 21807 transitions.
[2022-05-18 10:32:14] [INFO ] Parsed PT model containing 13544 places and 21807 transitions in 985 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Normalized transition count is 20751 out of 21807 initially.
// Phase 1: matrix 20751 rows 13544 cols
[2022-05-18 10:32:16] [INFO ] Computed 1333 place invariants in 1608 ms
Incomplete random walk after 10000 steps, including 472 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 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 67 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 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 67 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :3
[2022-05-18 10:32:18] [INFO ] Flow matrix only has 20751 transitions (discarded 1056 similar events)
// Phase 1: matrix 20751 rows 13544 cols
[2022-05-18 10:32:19] [INFO ] Computed 1333 place invariants in 1491 ms
[2022-05-18 10:32:21] [INFO ] [Real]Absence check using 74 positive place invariants in 303 ms returned sat
[2022-05-18 10:32:22] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 860 ms returned sat
[2022-05-18 10:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:32:24] [INFO ] [Real]Absence check using state equation in 2308 ms returned unknown
[2022-05-18 10:32:26] [INFO ] [Real]Absence check using 74 positive place invariants in 269 ms returned sat
[2022-05-18 10:32:26] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 360 ms returned unsat
[2022-05-18 10:32:28] [INFO ] [Real]Absence check using 74 positive place invariants in 270 ms returned sat
[2022-05-18 10:32:28] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 710 ms returned sat
[2022-05-18 10:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:32:31] [INFO ] [Real]Absence check using state equation in 2736 ms returned unknown
[2022-05-18 10:32:32] [INFO ] [Real]Absence check using 74 positive place invariants in 278 ms returned sat
[2022-05-18 10:32:33] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 466 ms returned unsat
[2022-05-18 10:32:35] [INFO ] [Real]Absence check using 74 positive place invariants in 290 ms returned sat
[2022-05-18 10:32:35] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 351 ms returned unsat
[2022-05-18 10:32:37] [INFO ] [Real]Absence check using 74 positive place invariants in 262 ms returned sat
[2022-05-18 10:32:37] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 751 ms returned sat
[2022-05-18 10:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:32:40] [INFO ] [Real]Absence check using state equation in 2627 ms returned unknown
[2022-05-18 10:32:42] [INFO ] [Real]Absence check using 74 positive place invariants in 261 ms returned sat
[2022-05-18 10:32:42] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 724 ms returned sat
[2022-05-18 10:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:32:45] [INFO ] [Real]Absence check using state equation in 2681 ms returned unknown
[2022-05-18 10:32:47] [INFO ] [Real]Absence check using 74 positive place invariants in 266 ms returned sat
[2022-05-18 10:32:47] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 689 ms returned sat
[2022-05-18 10:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:32:50] [INFO ] [Real]Absence check using state equation in 2822 ms returned unknown
[2022-05-18 10:32:52] [INFO ] [Real]Absence check using 74 positive place invariants in 275 ms returned sat
[2022-05-18 10:32:52] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 395 ms returned unsat
[2022-05-18 10:32:54] [INFO ] [Real]Absence check using 74 positive place invariants in 268 ms returned sat
[2022-05-18 10:32:54] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 758 ms returned sat
[2022-05-18 10:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:32:57] [INFO ] [Real]Absence check using state equation in 2784 ms returned unknown
[2022-05-18 10:32:59] [INFO ] [Real]Absence check using 74 positive place invariants in 284 ms returned sat
[2022-05-18 10:32:59] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 481 ms returned unsat
[2022-05-18 10:33:01] [INFO ] [Real]Absence check using 74 positive place invariants in 266 ms returned sat
[2022-05-18 10:33:02] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 793 ms returned sat
[2022-05-18 10:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:33:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 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: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 10:33:06] [INFO ] [Real]Absence check using 74 positive place invariants in 292 ms returned sat
[2022-05-18 10:33:06] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 467 ms returned unsat
[2022-05-18 10:33:08] [INFO ] [Real]Absence check using 74 positive place invariants in 309 ms returned sat
[2022-05-18 10:33:09] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 457 ms returned unsat
[2022-05-18 10:33:10] [INFO ] [Real]Absence check using 74 positive place invariants in 267 ms returned sat
[2022-05-18 10:33:11] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 740 ms returned sat
[2022-05-18 10:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:33: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 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 10:33:15] [INFO ] [Real]Absence check using 74 positive place invariants in 288 ms returned sat
[2022-05-18 10:33:16] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 913 ms returned sat
[2022-05-18 10:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:33:19] [INFO ] [Real]Absence check using state equation in 2611 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 99, 1, 1, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 13544 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13544/13544 places, 21807/21807 transitions.
Graph (complete) has 52829 edges and 13544 vertex of which 13504 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.54 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 2110 transitions
Trivial Post-agglo rules discarded 2110 transitions
Performed 2110 trivial Post agglomeration. Transition count delta: 2110
Iterating post reduction 0 with 2110 rules applied. Total rules applied 2111 place count 13504 transition count 19697
Reduce places removed 2110 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2112 rules applied. Total rules applied 4223 place count 11394 transition count 19695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4225 place count 11392 transition count 19695
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 4225 place count 11392 transition count 19563
Deduced a syphon composed of 132 places in 19 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 4489 place count 11260 transition count 19563
Discarding 1978 places :
Symmetric choice reduction at 3 with 1978 rule applications. Total rules 6467 place count 9282 transition count 17585
Iterating global reduction 3 with 1978 rules applied. Total rules applied 8445 place count 9282 transition count 17585
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8445 place count 9282 transition count 17583
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8449 place count 9280 transition count 17583
Discarding 988 places :
Symmetric choice reduction at 3 with 988 rule applications. Total rules 9437 place count 8292 transition count 15607
Iterating global reduction 3 with 988 rules applied. Total rules applied 10425 place count 8292 transition count 15607
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 27 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 10491 place count 8259 transition count 15574
Free-agglomeration rule (complex) applied 578 times.
Iterating global reduction 3 with 578 rules applied. Total rules applied 11069 place count 8259 transition count 15984
Reduce places removed 578 places and 0 transitions.
Iterating post reduction 3 with 578 rules applied. Total rules applied 11647 place count 7681 transition count 15984
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 4 with 66 rules applied. Total rules applied 11713 place count 7681 transition count 15984
Applied a total of 11713 rules in 16060 ms. Remains 7681 /13544 variables (removed 5863) and now considering 15984/21807 (removed 5823) transitions.
Finished structural reductions, in 1 iterations. Remains : 7681/13544 places, 15984/21807 transitions.
Normalized transition count is 14418 out of 15984 initially.
// Phase 1: matrix 14418 rows 7681 cols
[2022-05-18 10:33:35] [INFO ] Computed 1293 place invariants in 690 ms
Incomplete random walk after 1000000 steps, including 76541 resets, run finished after 28244 ms. (steps per millisecond=35 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000000 steps, including 7088 resets, run finished after 3875 ms. (steps per millisecond=258 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 4107 ms. (steps per millisecond=243 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3962 ms. (steps per millisecond=252 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3907 ms. (steps per millisecond=255 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3945 ms. (steps per millisecond=253 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3847 ms. (steps per millisecond=259 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3770 ms. (steps per millisecond=265 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3758 ms. (steps per millisecond=266 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3697 ms. (steps per millisecond=270 ) properties (out of 9) seen :2
[2022-05-18 10:34:39] [INFO ] Flow matrix only has 14418 transitions (discarded 1566 similar events)
// Phase 1: matrix 14418 rows 7681 cols
[2022-05-18 10:34:39] [INFO ] Computed 1293 place invariants in 664 ms
[2022-05-18 10:34:40] [INFO ] [Real]Absence check using 65 positive place invariants in 210 ms returned sat
[2022-05-18 10:34:41] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 429 ms returned sat
[2022-05-18 10:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:34:50] [INFO ] [Real]Absence check using state equation in 9230 ms returned sat
[2022-05-18 10:34:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:34:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 210 ms returned sat
[2022-05-18 10:34:52] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 409 ms returned sat
[2022-05-18 10:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:35:01] [INFO ] [Nat]Absence check using state equation in 9415 ms returned sat
[2022-05-18 10:35:01] [INFO ] State equation strengthened by 7042 read => feed constraints.
[2022-05-18 10:35:02] [INFO ] [Nat]Added 7042 Read/Feed constraints in 1085 ms returned unsat
[2022-05-18 10:35:03] [INFO ] [Real]Absence check using 65 positive place invariants in 217 ms returned sat
[2022-05-18 10:35:04] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 255 ms returned unsat
[2022-05-18 10:35:04] [INFO ] [Real]Absence check using 65 positive place invariants in 214 ms returned sat
[2022-05-18 10:35:05] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 134 ms returned unsat
[2022-05-18 10:35:06] [INFO ] [Real]Absence check using 65 positive place invariants in 202 ms returned sat
[2022-05-18 10:35:06] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 411 ms returned sat
[2022-05-18 10:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:35:15] [INFO ] [Real]Absence check using state equation in 9084 ms returned sat
[2022-05-18 10:35:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:35:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 180 ms returned sat
[2022-05-18 10:35:17] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 426 ms returned sat
[2022-05-18 10:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:35:26] [INFO ] [Nat]Absence check using state equation in 9510 ms returned sat
[2022-05-18 10:35:27] [INFO ] [Nat]Added 7042 Read/Feed constraints in 691 ms returned unsat
[2022-05-18 10:35:28] [INFO ] [Real]Absence check using 65 positive place invariants in 204 ms returned sat
[2022-05-18 10:35:28] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 413 ms returned sat
[2022-05-18 10:35:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:35:37] [INFO ] [Real]Absence check using state equation in 8454 ms returned sat
[2022-05-18 10:35:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:35:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 188 ms returned sat
[2022-05-18 10:35:38] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 439 ms returned sat
[2022-05-18 10:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:35:47] [INFO ] [Nat]Absence check using state equation in 8808 ms returned sat
[2022-05-18 10:35:48] [INFO ] [Nat]Added 7042 Read/Feed constraints in 858 ms returned unsat
[2022-05-18 10:35:49] [INFO ] [Real]Absence check using 65 positive place invariants in 207 ms returned sat
[2022-05-18 10:35:49] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 400 ms returned sat
[2022-05-18 10:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:35:59] [INFO ] [Real]Absence check using state equation in 9276 ms returned sat
[2022-05-18 10:35:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:36:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 185 ms returned sat
[2022-05-18 10:36:00] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 437 ms returned sat
[2022-05-18 10:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:36:10] [INFO ] [Nat]Absence check using state equation in 9427 ms returned sat
[2022-05-18 10:36:11] [INFO ] [Nat]Added 7042 Read/Feed constraints in 1011 ms returned unsat
[2022-05-18 10:36:12] [INFO ] [Real]Absence check using 65 positive place invariants in 212 ms returned sat
[2022-05-18 10:36:12] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 429 ms returned sat
[2022-05-18 10:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:36:20] [INFO ] [Real]Absence check using state equation in 8049 ms returned sat
[2022-05-18 10:36:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:36:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 177 ms returned sat
[2022-05-18 10:36:22] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 401 ms returned sat
[2022-05-18 10:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:36:31] [INFO ] [Nat]Absence check using state equation in 8824 ms returned sat
[2022-05-18 10:36:32] [INFO ] [Nat]Added 7042 Read/Feed constraints in 886 ms returned unsat
[2022-05-18 10:36:33] [INFO ] [Real]Absence check using 65 positive place invariants in 208 ms returned sat
[2022-05-18 10:36:33] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 418 ms returned sat
[2022-05-18 10:36:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:36:41] [INFO ] [Real]Absence check using state equation in 8318 ms returned sat
[2022-05-18 10:36:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:36:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 189 ms returned sat
[2022-05-18 10:36:43] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 422 ms returned sat
[2022-05-18 10:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:36:52] [INFO ] [Nat]Absence check using state equation in 9141 ms returned sat
[2022-05-18 10:36:53] [INFO ] [Nat]Added 7042 Read/Feed constraints in 633 ms returned unsat
[2022-05-18 10:36:54] [INFO ] [Real]Absence check using 65 positive place invariants in 204 ms returned sat
[2022-05-18 10:36:54] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 388 ms returned sat
[2022-05-18 10:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:37:03] [INFO ] [Real]Absence check using state equation in 8453 ms returned sat
[2022-05-18 10:37:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:37:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 203 ms returned sat
[2022-05-18 10:37:04] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 422 ms returned sat
[2022-05-18 10:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:37:14] [INFO ] [Nat]Absence check using state equation in 9975 ms returned sat
[2022-05-18 10:37:15] [INFO ] [Nat]Added 7042 Read/Feed constraints in 971 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 1, 1, 0, 0, 0, 0, 0, 0] Max seen :[0, 1, 1, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 301954 ms.

BK_STOP 1652870235905

--------------------
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-S32C02"
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-S32C02, 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-165271821400797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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