About the Execution of LTSMin+red for GPPP-PT-C0100N0000100000
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-167838856500877.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 GPPP-PT-C0100N0000100000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856500877
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000100000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000100000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678658088824
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=GPPP-PT-C0100N0000100000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:54:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 21:54:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:54:50] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-12 21:54:50] [INFO ] Transformed 33 places.
[2023-03-12 21:54:50] [INFO ] Transformed 22 transitions.
[2023-03-12 21:54:50] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 21:54:50] [INFO ] Computed 12 place invariants in 13 ms
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-08 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-02 200000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10064 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=592 ) properties (out of 13) seen :3835
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-05 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-01 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :458
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :484
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :820
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :450
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :459
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :491
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :804
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :405
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :459
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :473
[2023-03-12 21:54:50] [INFO ] Invariant cache hit.
[2023-03-12 21:54:50] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-12 21:54:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-12 21:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:54:50] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-12 21:54:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:54:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:54:50] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
[2023-03-12 21:54:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:54:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:54:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 21:54:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:54:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-12 21:54:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 21:54:56] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4975 ms returned unknown
[2023-03-12 21:54:56] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-12 21:54:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-12 21:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:54:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 21:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:54:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:54:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 21:55:01] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4977 ms returned unknown
[2023-03-12 21:55:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:01] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 21:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 21:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:02] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 839 ms returned sat
[2023-03-12 21:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:06] [INFO ] [Nat]Absence check using state equation in 4144 ms returned unknown
[2023-03-12 21:55:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 21:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 21:55:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 21:55:11] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4986 ms returned unknown
[2023-03-12 21:55:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 21:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 21:55:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:11] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 413 ms returned sat
[2023-03-12 21:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:11] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-12 21:55:11] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-12 21:55:11] [INFO ] Added : 17 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 27 ms.
[2023-03-12 21:55:11] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 21:55:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:11] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 21:55:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:16] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4063 ms returned sat
[2023-03-12 21:55:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:17] [INFO ] [Nat]Absence check using state equation in 918 ms returned unknown
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 21:55:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 21:55:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 21:55:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 21:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 21:55:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:18] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 849 ms returned sat
[2023-03-12 21:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:22] [INFO ] [Nat]Absence check using state equation in 4124 ms returned sat
[2023-03-12 21:55:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: 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)
Current structural bounds on expressions (after SMT) : [2, 700, 200000, 450, 700, 900, 3500, 400, 400, 2, 450] Max seen :[2, 10, 1592, 3, 7, 6, 10, 400, 400, 2, 3]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-13 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-11 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Applied a total of 4 rules in 22 ms. Remains 31 /33 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 31 cols
[2023-03-12 21:55:22] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 21:55:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 31/33 places, 20/22 transitions.
[2023-03-12 21:55:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000098 steps, including 342 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 7) seen :1640
Incomplete Best-First random walk after 1000000 steps, including 56 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 7) seen :278
Incomplete Best-First random walk after 1000001 steps, including 80 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 7) seen :1619
Incomplete Best-First random walk after 1000001 steps, including 58 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 7) seen :255
Incomplete Best-First random walk after 1000001 steps, including 57 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 7) seen :279
Incomplete Best-First random walk after 1000001 steps, including 50 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 7) seen :182
Incomplete Best-First random walk after 1000001 steps, including 57 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties (out of 7) seen :215
Incomplete Best-First random walk after 1000001 steps, including 58 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 7) seen :179
[2023-03-12 21:55:25] [INFO ] Invariant cache hit.
[2023-03-12 21:55:25] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:25] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 21:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:25] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 21:55:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:25] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using state equation in 504 ms returned unsat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 21:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using state equation in 37 ms returned unsat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-12 21:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using state equation in 19 ms returned unsat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 21:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using state equation in 42 ms returned unsat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 21:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using state equation in 33 ms returned unsat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 21:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using state equation in 30 ms returned unsat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 21:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 21:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 21:55:27] [INFO ] [Nat]Absence check using state equation in 30 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1592, 4, 10, 10, 10, 4] Max seen :[10, 1592, 4, 10, 10, 10, 4]
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-04 1592 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36750 ms.
ITS solved all properties within timeout
BK_STOP 1678658127926
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="GPPP-PT-C0100N0000100000"
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 GPPP-PT-C0100N0000100000, 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-167838856500877"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 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 '
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 ;