About the Execution of ITS-Tools for SharedMemory-COL-000200
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.r357-smll-167891806700589.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 itstools
Input is SharedMemory-COL-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r357-smll-167891806700589
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.6K Feb 26 21:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 21:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 07:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 07:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 27 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 27 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 27 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 27 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 20K Mar 5 18:23 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 SharedMemory-COL-000200-UpperBounds-00
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-01
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-02
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-03
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-04
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-05
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-06
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-07
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-08
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-09
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-10
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-11
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-12
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-13
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-14
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679334815839
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000200
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-20 17:53:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 17:53:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 17:53:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-20 17:53:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 17:53:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 923 ms
[2023-03-20 17:53:40] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 40801 PT places and 120400.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2023-03-20 17:53:40] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 9 ms.
[2023-03-20 17:53:40] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 5 rows 6 cols
[2023-03-20 17:53:40] [INFO ] Computed 3 place invariants in 5 ms
FORMULA SharedMemory-COL-000200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-20 17:53:40] [INFO ] Invariant cache hit.
[2023-03-20 17:53:40] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-20 17:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-20 17:53:40] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-20 17:53:40] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2023-03-20 17:53:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-20 17:53:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:53:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 17:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-20 17:53:40] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 17:53:40] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2023-03-20 17:53:40] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 17:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-20 17:53:40] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 17:53:41] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-20 17:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-20 17:53:41] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 17:53:41] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-20 17:53:41] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 17:53:41] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-20 17:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-20 17:53:41] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 17:53:41] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-20 17:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-20 17:53:41] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 17:53:41] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-20 17:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-20 17:53:41] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 17:53:41] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-20 17:53:41] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:53:41] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-20 17:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-20 17:53:41] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 17:53:41] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 17:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 17:53:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-20 17:53:41] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 17:53:41] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [200, 1, 200, 1, 200, 1, 200, 200, 200, 1, 200]
Domain [P(200), P(200)] of place Ext_Mem_Acc breaks symmetries in sort P
[2023-03-20 17:53:42] [INFO ] Unfolded HLPN to a Petri net with 40801 places and 80400 transitions 320800 arcs in 907 ms.
[2023-03-20 17:53:42] [INFO ] Unfolded 11 HLPN properties in 18 ms.
Deduced a syphon composed of 200 places in 94 ms
Reduce places removed 200 places and 200 transitions.
Finished random walk after 891 steps, including 0 resets, run visited all 11 properties in 30080 ms. (steps per millisecond=0 )
FORMULA SharedMemory-COL-000200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 7) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 7) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :45
// Phase 1: matrix 80200 rows 40601 cols
[2023-03-20 17:55:10] [INFO ] Computed 401 place invariants in 55706 ms
[2023-03-20 17:55:15] [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 0
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.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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) : [200, 200, 200, 200, 200, 200, 200] Max seen :[64, 64, 64, 199, 199, 64, 64]
Support contains 400 out of 40601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40601/40601 places, 80200/80200 transitions.
Performed 16314 Post agglomeration using F-continuation condition.
Performed 34910 Post agglomeration using F-continuation condition.
Performed 39800 Post agglomeration using F-continuation condition.Transition count delta: 39800
Iterating post reduction 0 with 39800 rules applied. Total rules applied 39800 place count 40601 transition count 40400
Reduce places removed 40001 places and 0 transitions.
Ensure Unique test removed 39600 transitions
Reduce isomorphic transitions removed 39600 transitions.
Iterating post reduction 1 with 79601 rules applied. Total rules applied 119401 place count 600 transition count 800
Applied a total of 119401 rules in 68919 ms. Remains 600 /40601 variables (removed 40001) and now considering 800/80200 (removed 79400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68920 ms. Remains : 600/40601 places, 800/80200 transitions.
// Phase 1: matrix 800 rows 600 cols
[2023-03-20 17:56:54] [INFO ] Computed 200 place invariants in 2 ms
Finished random walk after 354491 steps, including 1 resets, run visited all 7 properties in 30001 ms. (steps per millisecond=11 )
Interrupted Best-First random walk after 384975 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=76 ) properties seen 1000
FORMULA SharedMemory-COL-000200-UpperBounds-15 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-13 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 378625 steps, including 1 resets, run visited all 2 properties in 5001 ms. (steps per millisecond=75 )
FORMULA SharedMemory-COL-000200-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 235191 ms.
BK_STOP 1679335055319
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="SharedMemory-COL-000200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is SharedMemory-COL-000200, 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 r357-smll-167891806700589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000200.tgz
mv SharedMemory-COL-000200 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 ;