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.r103-tall-167814478700773.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 lolaxred
Input is DLCround-PT-12b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478700773
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 5.9K Feb 25 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 DLCround-PT-12b-UpperBounds-00
FORMULA_NAME DLCround-PT-12b-UpperBounds-01
FORMULA_NAME DLCround-PT-12b-UpperBounds-02
FORMULA_NAME DLCround-PT-12b-UpperBounds-03
FORMULA_NAME DLCround-PT-12b-UpperBounds-04
FORMULA_NAME DLCround-PT-12b-UpperBounds-05
FORMULA_NAME DLCround-PT-12b-UpperBounds-06
FORMULA_NAME DLCround-PT-12b-UpperBounds-07
FORMULA_NAME DLCround-PT-12b-UpperBounds-08
FORMULA_NAME DLCround-PT-12b-UpperBounds-09
FORMULA_NAME DLCround-PT-12b-UpperBounds-10
FORMULA_NAME DLCround-PT-12b-UpperBounds-11
FORMULA_NAME DLCround-PT-12b-UpperBounds-12
FORMULA_NAME DLCround-PT-12b-UpperBounds-13
FORMULA_NAME DLCround-PT-12b-UpperBounds-14
FORMULA_NAME DLCround-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678279158787

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-12b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 12:39:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 12:39:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:39:20] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2023-03-08 12:39:20] [INFO ] Transformed 4848 places.
[2023-03-08 12:39:20] [INFO ] Transformed 7836 transitions.
[2023-03-08 12:39:20] [INFO ] Found NUPN structural information;
[2023-03-08 12:39:20] [INFO ] Parsed PT model containing 4848 places and 7836 transitions and 22188 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 7836 rows 4848 cols
[2023-03-08 12:39:21] [INFO ] Computed 277 place invariants in 72 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 16) seen :10
FORMULA DLCround-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
[2023-03-08 12:39:21] [INFO ] Invariant cache hit.
[2023-03-08 12:39:22] [INFO ] [Real]Absence check using 277 positive place invariants in 328 ms returned sat
[2023-03-08 12:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:39:25] [INFO ] [Real]Absence check using state equation in 3007 ms returned sat
[2023-03-08 12:39:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:39:26] [INFO ] [Nat]Absence check using 277 positive place invariants in 307 ms returned sat
[2023-03-08 12:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:39:30] [INFO ] [Nat]Absence check using state equation in 3596 ms returned sat
[2023-03-08 12:39:33] [INFO ] Deduced a trap composed of 147 places in 2695 ms of which 8 ms to minimize.
[2023-03-08 12:39:33] [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.verifyPossible(DeadlockTester.java:916)
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-08 12:39:34] [INFO ] [Real]Absence check using 277 positive place invariants in 298 ms returned sat
[2023-03-08 12:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:39:37] [INFO ] [Real]Absence check using state equation in 3344 ms returned sat
[2023-03-08 12:39:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:39:38] [INFO ] [Nat]Absence check using 277 positive place invariants in 297 ms returned sat
[2023-03-08 12:39:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:39:42] [INFO ] [Nat]Absence check using state equation in 3392 ms returned sat
[2023-03-08 12:39:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
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-08 12:39:43] [INFO ] [Real]Absence check using 277 positive place invariants in 297 ms returned sat
[2023-03-08 12:39:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:39:47] [INFO ] [Real]Absence check using state equation in 3537 ms returned sat
[2023-03-08 12:39:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:39:48] [INFO ] [Nat]Absence check using 277 positive place invariants in 290 ms returned sat
[2023-03-08 12:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:39:51] [INFO ] [Nat]Absence check using state equation in 3435 ms returned sat
[2023-03-08 12:39:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
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-08 12:39:53] [INFO ] [Real]Absence check using 277 positive place invariants in 285 ms returned sat
[2023-03-08 12:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:39:56] [INFO ] [Real]Absence check using state equation in 3312 ms returned sat
[2023-03-08 12:39:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:39:57] [INFO ] [Nat]Absence check using 277 positive place invariants in 304 ms returned sat
[2023-03-08 12:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:40:01] [INFO ] [Nat]Absence check using state equation in 3384 ms returned sat
[2023-03-08 12:40:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
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-08 12:40:03] [INFO ] [Real]Absence check using 277 positive place invariants in 301 ms returned sat
[2023-03-08 12:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:40:06] [INFO ] [Real]Absence check using state equation in 3301 ms returned sat
[2023-03-08 12:40:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:40:07] [INFO ] [Nat]Absence check using 277 positive place invariants in 284 ms returned sat
[2023-03-08 12:40:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:40:10] [INFO ] [Nat]Absence check using state equation in 3398 ms returned sat
[2023-03-08 12:40:11] [INFO ] Computed and/alt/rep : 7332/14297/7332 causal constraints (skipped 503 transitions) in 369 ms.
[2023-03-08 12:40:11] [INFO ] Added : 0 causal constraints over 0 iterations in 370 ms. Result :unknown
[2023-03-08 12:40:12] [INFO ] [Real]Absence check using 277 positive place invariants in 288 ms returned sat
[2023-03-08 12:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:40:15] [INFO ] [Real]Absence check using state equation in 3342 ms returned sat
[2023-03-08 12:40:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:40:17] [INFO ] [Nat]Absence check using 277 positive place invariants in 306 ms returned sat
[2023-03-08 12:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:40:20] [INFO ] [Nat]Absence check using state equation in 3302 ms returned sat
[2023-03-08 12:40:21] [INFO ] Computed and/alt/rep : 7332/14297/7332 causal constraints (skipped 503 transitions) in 321 ms.
[2023-03-08 12:40:21] [INFO ] Added : 0 causal constraints over 0 iterations in 331 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA DLCround-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 4848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Graph (trivial) has 4435 edges and 4848 vertex of which 792 / 4848 are part of one of the 56 SCC in 16 ms
Free SCC test removed 736 places
Drop transitions removed 822 transitions
Reduce isomorphic transitions removed 822 transitions.
Drop transitions removed 1716 transitions
Trivial Post-agglo rules discarded 1716 transitions
Performed 1716 trivial Post agglomeration. Transition count delta: 1716
Iterating post reduction 0 with 1716 rules applied. Total rules applied 1717 place count 4112 transition count 5298
Reduce places removed 1716 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 1801 rules applied. Total rules applied 3518 place count 2396 transition count 5213
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 42 rules applied. Total rules applied 3560 place count 2360 transition count 5207
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 3565 place count 2358 transition count 5204
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 3570 place count 2355 transition count 5202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3571 place count 2354 transition count 5202
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 3571 place count 2354 transition count 5197
Deduced a syphon composed of 5 places in 85 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 3581 place count 2349 transition count 5197
Discarding 673 places :
Symmetric choice reduction at 6 with 673 rule applications. Total rules 4254 place count 1676 transition count 4524
Iterating global reduction 6 with 673 rules applied. Total rules applied 4927 place count 1676 transition count 4524
Performed 302 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 302 Pre rules applied. Total rules applied 4927 place count 1676 transition count 4222
Deduced a syphon composed of 302 places in 31 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 6 with 604 rules applied. Total rules applied 5531 place count 1374 transition count 4222
Discarding 99 places :
Symmetric choice reduction at 6 with 99 rule applications. Total rules 5630 place count 1275 transition count 2662
Iterating global reduction 6 with 99 rules applied. Total rules applied 5729 place count 1275 transition count 2662
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 5763 place count 1275 transition count 2628
Performed 336 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 7 with 672 rules applied. Total rules applied 6435 place count 939 transition count 2279
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 6448 place count 939 transition count 2266
Renaming transitions due to excessive name length > 1024 char.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -142
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 6474 place count 926 transition count 2408
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 6485 place count 926 transition count 2397
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 6489 place count 922 transition count 2291
Iterating global reduction 9 with 4 rules applied. Total rules applied 6493 place count 922 transition count 2291
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 6497 place count 922 transition count 2287
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 6505 place count 918 transition count 2333
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 10 with 57 rules applied. Total rules applied 6562 place count 918 transition count 2276
Discarding 26 places :
Symmetric choice reduction at 10 with 26 rule applications. Total rules 6588 place count 892 transition count 2250
Iterating global reduction 10 with 26 rules applied. Total rules applied 6614 place count 892 transition count 2250
Discarding 26 places :
Symmetric choice reduction at 10 with 26 rule applications. Total rules 6640 place count 866 transition count 1830
Iterating global reduction 10 with 26 rules applied. Total rules applied 6666 place count 866 transition count 1830
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 6692 place count 866 transition count 1804
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 6718 place count 853 transition count 1791
Discarding 13 places :
Symmetric choice reduction at 11 with 13 rule applications. Total rules 6731 place count 840 transition count 1581
Iterating global reduction 11 with 13 rules applied. Total rules applied 6744 place count 840 transition count 1581
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 6757 place count 840 transition count 1568
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 6763 place count 837 transition count 1592
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 6768 place count 837 transition count 1587
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 13 with 18 rules applied. Total rules applied 6786 place count 837 transition count 1569
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 6792 place count 834 transition count 1592
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 6795 place count 834 transition count 1589
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 14 with 15 rules applied. Total rules applied 6810 place count 834 transition count 1574
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 6814 place count 832 transition count 1592
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 6817 place count 832 transition count 1589
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 15 with 15 rules applied. Total rules applied 6832 place count 832 transition count 1574
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 6836 place count 830 transition count 1593
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 6839 place count 830 transition count 1590
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 16 with 15 rules applied. Total rules applied 6854 place count 830 transition count 1575
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 6858 place count 828 transition count 1593
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 6861 place count 828 transition count 1590
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 17 with 15 rules applied. Total rules applied 6876 place count 828 transition count 1575
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 6880 place count 826 transition count 1593
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 6882 place count 826 transition count 1591
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 18 with 9 rules applied. Total rules applied 6891 place count 826 transition count 1582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 6893 place count 825 transition count 1593
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 6895 place count 825 transition count 1591
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 19 with 9 rules applied. Total rules applied 6904 place count 825 transition count 1582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 6906 place count 824 transition count 1593
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 6907 place count 824 transition count 1592
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 20 with 10 rules applied. Total rules applied 6917 place count 824 transition count 1582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 6919 place count 823 transition count 1593
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 6921 place count 823 transition count 1591
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 21 with 9 rules applied. Total rules applied 6930 place count 823 transition count 1582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 6932 place count 822 transition count 1594
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 6933 place count 822 transition count 1593
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 22 with 10 rules applied. Total rules applied 6943 place count 822 transition count 1583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 6945 place count 821 transition count 1594
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 6947 place count 821 transition count 1592
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 23 with 9 rules applied. Total rules applied 6956 place count 821 transition count 1583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 6958 place count 820 transition count 1594
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 6959 place count 820 transition count 1593
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 24 with 10 rules applied. Total rules applied 6969 place count 820 transition count 1583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 6971 place count 819 transition count 1594
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 6973 place count 819 transition count 1592
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 25 with 9 rules applied. Total rules applied 6982 place count 819 transition count 1583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 6984 place count 818 transition count 1594
Free-agglomeration rule applied 506 times with reduction of 264 identical transitions.
Iterating global reduction 25 with 506 rules applied. Total rules applied 7490 place count 818 transition count 824
Reduce places removed 506 places and 0 transitions.
Drop transitions removed 572 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 576 transitions.
Graph (complete) has 542 edges and 312 vertex of which 79 are kept as prefixes of interest. Removing 233 places using SCC suffix rule.2 ms
Discarding 233 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Iterating post reduction 25 with 1083 rules applied. Total rules applied 8573 place count 79 transition count 166
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 26 with 12 rules applied. Total rules applied 8585 place count 79 transition count 154
Discarding 34 places :
Symmetric choice reduction at 27 with 34 rule applications. Total rules 8619 place count 45 transition count 103
Iterating global reduction 27 with 34 rules applied. Total rules applied 8653 place count 45 transition count 103
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 27 with 15 rules applied. Total rules applied 8668 place count 45 transition count 88
Applied a total of 8668 rules in 2705 ms. Remains 45 /4848 variables (removed 4803) and now considering 88/7836 (removed 7748) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2705 ms. Remains : 45/4848 places, 88/7836 transitions.
Normalized transition count is 60 out of 88 initially.
// Phase 1: matrix 60 rows 45 cols
[2023-03-08 12:40:25] [INFO ] Computed 24 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1722 ms. (steps per millisecond=580 ) properties (out of 2) seen :2
FORMULA DLCround-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 66515 ms.
ITS solved all properties within timeout

BK_STOP 1678279227770

--------------------
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="DLCround-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DLCround-PT-12b, 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 r103-tall-167814478700773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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