About the Execution of LTSMin+red for Referendum-PT-1000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r520-tall-171662339000637.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Referendum-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339000637
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 40M
-rw-r--r-- 1 mcc users 1.4M Apr 11 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Apr 11 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 430K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 429K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7M Apr 11 22:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13M Apr 11 22:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.0M Apr 11 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 83K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 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 Referendum-PT-1000-UpperBounds-00
FORMULA_NAME Referendum-PT-1000-UpperBounds-01
FORMULA_NAME Referendum-PT-1000-UpperBounds-02
FORMULA_NAME Referendum-PT-1000-UpperBounds-03
FORMULA_NAME Referendum-PT-1000-UpperBounds-04
FORMULA_NAME Referendum-PT-1000-UpperBounds-05
FORMULA_NAME Referendum-PT-1000-UpperBounds-06
FORMULA_NAME Referendum-PT-1000-UpperBounds-07
FORMULA_NAME Referendum-PT-1000-UpperBounds-08
FORMULA_NAME Referendum-PT-1000-UpperBounds-09
FORMULA_NAME Referendum-PT-1000-UpperBounds-10
FORMULA_NAME Referendum-PT-1000-UpperBounds-11
FORMULA_NAME Referendum-PT-1000-UpperBounds-12
FORMULA_NAME Referendum-PT-1000-UpperBounds-13
FORMULA_NAME Referendum-PT-1000-UpperBounds-14
FORMULA_NAME Referendum-PT-1000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717262208403
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:16:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 17:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:16:49] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-01 17:16:49] [INFO ] Transformed 3001 places.
[2024-06-01 17:16:49] [INFO ] Transformed 2001 transitions.
[2024-06-01 17:16:49] [INFO ] Found NUPN structural information;
[2024-06-01 17:16:49] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 27 ms.
Reduction of identical properties reduced properties to check from 16 to 10
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1000, 1, 1000, 1000, 1, 1, 1, 1, 1, 1]
FORMULA Referendum-PT-1000-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1000, 1000, 1000, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2001 rows 3001 cols
[2024-06-01 17:16:50] [INFO ] Computed 1000 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1000, 1000, 1000, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (9 resets) in 2328 ms. (4 steps per ms)
FORMULA Referendum-PT-1000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-05 1000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-1000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 1041 ms. (19 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[518, 524] Max Struct:[1000, 1000]
[2024-06-01 17:16:53] [INFO ] Invariant cache hit.
[2024-06-01 17:16:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 236 ms returned sat
[2024-06-01 17:16:55] [INFO ] [Real]Absence check using state equation in 924 ms returned sat
[2024-06-01 17:16:55] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 132 ms.
[2024-06-01 17:16:58] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 17:16:59] [INFO ] [Real]Absence check using 1000 positive place invariants in 243 ms returned sat
[2024-06-01 17:17:00] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2024-06-01 17:17:00] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 114 ms.
[2024-06-01 17:17:03] [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 1
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[518, 524] Max Struct:[1000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[518, 524] Max Struct:[1000, 1000]
Support contains 2000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3000 transition count 2000
Applied a total of 1 rules in 338 ms. Remains 3000 /3001 variables (removed 1) and now considering 2000/2001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 3000/3001 places, 2000/2001 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2024-06-01 17:17:03] [INFO ] Computed 1000 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[518, 524] Max Struct:[1000, 1000]
RANDOM walk for 180043 steps (179 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 302990 steps (0 resets) in 10018 ms. (30 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[539, 536] Max Struct:[1000, 1000]
[2024-06-01 17:17:44] [INFO ] Invariant cache hit.
[2024-06-01 17:17:44] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2024-06-01 17:17:45] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2024-06-01 17:17:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 86 ms.
[2024-06-01 17:17:46] [INFO ] Added : 0 causal constraints over 0 iterations in 268 ms. Result :sat
Minimization took 271 ms.
[2024-06-01 17:17:47] [INFO ] [Real]Absence check using 1000 positive place invariants in 231 ms returned sat
[2024-06-01 17:17:48] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2024-06-01 17:17:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 87 ms.
[2024-06-01 17:17:48] [INFO ] Added : 0 causal constraints over 0 iterations in 260 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[539, 536] Max Struct:[1000, 1000]
FORMULA Referendum-PT-1000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1000]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 116 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2024-06-01 17:18:16] [INFO ] Computed 1000 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1000]
FORMULA Referendum-PT-1000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 647706 steps (647 resets) in 30001 ms. (21 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 116492 ms.
ITS solved all properties within timeout
BK_STOP 1717262326108
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Referendum-PT-1000"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Referendum-PT-1000, 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 r520-tall-171662339000637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-1000.tgz
mv Referendum-PT-1000 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 ;