Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 29K Feb 26 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 26 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Feb 26 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 290K Feb 26 11:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 423K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Feb 26 11:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Feb 26 11:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 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 FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678537500153

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 12:25:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 12:25:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:25:02] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-11 12:25:02] [INFO ] Transformed 3271 places.
[2023-03-11 12:25:02] [INFO ] Transformed 2753 transitions.
[2023-03-11 12:25:02] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 11 places and 0 transitions.
// Phase 1: matrix 2753 rows 3260 cols
[2023-03-11 12:25:02] [INFO ] Computed 748 place invariants in 236 ms
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 8 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 15) seen :69
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :17
[2023-03-11 12:25:02] [INFO ] Invariant cache hit.
[2023-03-11 12:25:03] [INFO ] [Real]Absence check using 61 positive place invariants in 66 ms returned sat
[2023-03-11 12:25:03] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 185 ms returned sat
[2023-03-11 12:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:04] [INFO ] [Real]Absence check using state equation in 1375 ms returned sat
[2023-03-11 12:25:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:25:05] [INFO ] [Nat]Absence check using 61 positive place invariants in 63 ms returned sat
[2023-03-11 12:25:05] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 188 ms returned sat
[2023-03-11 12:25:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:07] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2023-03-11 12:25:07] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 182 ms.
[2023-03-11 12:25:12] [INFO ] Deduced a trap composed of 45 places in 2220 ms of which 11 ms to minimize.
[2023-03-11 12:25:12] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 12:25:12] [INFO ] [Real]Absence check using 61 positive place invariants in 66 ms returned sat
[2023-03-11 12:25:12] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 146 ms returned unsat
[2023-03-11 12:25:13] [INFO ] [Real]Absence check using 61 positive place invariants in 57 ms returned sat
[2023-03-11 12:25:13] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 143 ms returned unsat
[2023-03-11 12:25:13] [INFO ] [Real]Absence check using 61 positive place invariants in 55 ms returned sat
[2023-03-11 12:25:14] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 202 ms returned sat
[2023-03-11 12:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:15] [INFO ] [Real]Absence check using state equation in 1530 ms returned sat
[2023-03-11 12:25:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:25:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 58 ms returned sat
[2023-03-11 12:25:16] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 190 ms returned sat
[2023-03-11 12:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:17] [INFO ] [Nat]Absence check using state equation in 1559 ms returned sat
[2023-03-11 12:25:18] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 157 ms.
[2023-03-11 12:25:20] [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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 12:25:21] [INFO ] [Real]Absence check using 61 positive place invariants in 57 ms returned sat
[2023-03-11 12:25:21] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 205 ms returned sat
[2023-03-11 12:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:22] [INFO ] [Real]Absence check using state equation in 1521 ms returned sat
[2023-03-11 12:25:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:25:23] [INFO ] [Nat]Absence check using 61 positive place invariants in 58 ms returned sat
[2023-03-11 12:25:23] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 196 ms returned sat
[2023-03-11 12:25:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:24] [INFO ] [Nat]Absence check using state equation in 1444 ms returned sat
[2023-03-11 12:25:25] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 152 ms.
[2023-03-11 12:25:30] [INFO ] Deduced a trap composed of 45 places in 2278 ms of which 4 ms to minimize.
[2023-03-11 12:25:30] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 12:25:30] [INFO ] [Real]Absence check using 61 positive place invariants in 54 ms returned sat
[2023-03-11 12:25:30] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 200 ms returned sat
[2023-03-11 12:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:32] [INFO ] [Real]Absence check using state equation in 1525 ms returned sat
[2023-03-11 12:25:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:25:32] [INFO ] [Nat]Absence check using 61 positive place invariants in 54 ms returned sat
[2023-03-11 12:25:33] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 197 ms returned sat
[2023-03-11 12:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:34] [INFO ] [Nat]Absence check using state equation in 1588 ms returned sat
[2023-03-11 12:25:34] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 138 ms.
[2023-03-11 12:25:39] [INFO ] Deduced a trap composed of 45 places in 2229 ms of which 3 ms to minimize.
[2023-03-11 12:25: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: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 12:25:40] [INFO ] [Real]Absence check using 61 positive place invariants in 55 ms returned sat
[2023-03-11 12:25:40] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 209 ms returned unsat
[2023-03-11 12:25:40] [INFO ] [Real]Absence check using 61 positive place invariants in 54 ms returned sat
[2023-03-11 12:25:40] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 201 ms returned sat
[2023-03-11 12:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:42] [INFO ] [Real]Absence check using state equation in 1419 ms returned sat
[2023-03-11 12:25:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:25:42] [INFO ] [Nat]Absence check using 61 positive place invariants in 58 ms returned sat
[2023-03-11 12:25:42] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 206 ms returned sat
[2023-03-11 12:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:44] [INFO ] [Nat]Absence check using state equation in 1466 ms returned sat
[2023-03-11 12:25:44] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 152 ms.
[2023-03-11 12:25:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 12:25:47] [INFO ] [Real]Absence check using 61 positive place invariants in 54 ms returned sat
[2023-03-11 12:25:47] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 120 ms returned unsat
Current structural bounds on expressions (after SMT) : [361, 21, 2, 1065, 722, 722, 2, 4537, 1] Max seen :[4, 21, 2, 7, 8, 6, 2, 14, 1]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 105 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 2525 are kept as prefixes of interest. Removing 735 places using SCC suffix rule.8 ms
Discarding 735 places :
Also discarding 695 output transitions
Drop transitions removed 695 transitions
Discarding 378 places :
Implicit places reduction removed 378 places
Drop transitions removed 1050 transitions
Trivial Post-agglo rules discarded 1050 transitions
Performed 1050 trivial Post agglomeration. Transition count delta: 1050
Iterating post reduction 0 with 1428 rules applied. Total rules applied 1429 place count 2147 transition count 1008
Reduce places removed 1050 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 1092 rules applied. Total rules applied 2521 place count 1097 transition count 966
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 2563 place count 1055 transition count 966
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 2563 place count 1055 transition count 798
Deduced a syphon composed of 168 places in 1 ms
Ensure Unique test removed 63 places
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 399 rules applied. Total rules applied 2962 place count 824 transition count 798
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3004 place count 824 transition count 756
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3046 place count 782 transition count 756
Discarding 147 places :
Symmetric choice reduction at 5 with 147 rule applications. Total rules 3193 place count 635 transition count 609
Iterating global reduction 5 with 147 rules applied. Total rules applied 3340 place count 635 transition count 609
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 84 rules applied. Total rules applied 3424 place count 593 transition count 567
Reduce places removed 21 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 6 with 63 rules applied. Total rules applied 3487 place count 572 transition count 525
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 3529 place count 530 transition count 525
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 3529 place count 530 transition count 504
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 3571 place count 509 transition count 504
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 3574 place count 506 transition count 441
Iterating global reduction 8 with 3 rules applied. Total rules applied 3577 place count 506 transition count 441
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 8 with 42 rules applied. Total rules applied 3619 place count 485 transition count 420
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 21 Pre rules applied. Total rules applied 3619 place count 485 transition count 399
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 3661 place count 464 transition count 399
Discarding 42 places :
Symmetric choice reduction at 9 with 42 rule applications. Total rules 3703 place count 422 transition count 357
Iterating global reduction 9 with 42 rules applied. Total rules applied 3745 place count 422 transition count 357
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 9 with 105 rules applied. Total rules applied 3850 place count 401 transition count 273
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 10 with 42 rules applied. Total rules applied 3892 place count 359 transition count 273
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 11 with 63 rules applied. Total rules applied 3955 place count 317 transition count 252
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 11 with 42 rules applied. Total rules applied 3997 place count 317 transition count 210
Ensure Unique test removed 21 places
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 11 with 63 rules applied. Total rules applied 4060 place count 254 transition count 210
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 12 with 21 rules applied. Total rules applied 4081 place count 233 transition count 189
Applied a total of 4081 rules in 296 ms. Remains 233 /3260 variables (removed 3027) and now considering 189/2753 (removed 2564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 233/3260 places, 189/2753 transitions.
// Phase 1: matrix 189 rows 233 cols
[2023-03-11 12:25:48] [INFO ] Computed 44 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 5263 resets, run finished after 4213 ms. (steps per millisecond=237 ) properties (out of 5) seen :73
Incomplete Best-First random walk after 1000001 steps, including 401 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 5) seen :25
Incomplete Best-First random walk after 1000001 steps, including 299 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 5) seen :52
Incomplete Best-First random walk after 1000001 steps, including 251 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 5) seen :79
Incomplete Best-First random walk after 1000001 steps, including 251 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 5) seen :81
Incomplete Best-First random walk after 1000001 steps, including 343 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 5) seen :39
[2023-03-11 12:25:57] [INFO ] Invariant cache hit.
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 7 ms returned sat
[2023-03-11 12:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 6 ms returned sat
[2023-03-11 12:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 6 ms returned sat
[2023-03-11 12:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using state equation in 47 ms returned unsat
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 6 ms returned sat
[2023-03-11 12:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 6 ms returned sat
[2023-03-11 12:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:57] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : [21, 21, 21, 21, 21] Max seen :[21, 21, 21, 21, 21]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 56207 ms.
ITS solved all properties within timeout

BK_STOP 1678537558889

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="FamilyReunion-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, 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 r169-tall-167838855800405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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