About the Execution of LTSMin+red for Philosophers-COL-005000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4146.531 | 866689.00 | 1796519.00 | 10575.30 | ????T????T?????? | normal |
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.r297-tall-167873950000153.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 Philosophers-COL-005000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950000153
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 17:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 17:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 03:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 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 227K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-00
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-01
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-02
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-03
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-04
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-05
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-06
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-07
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-08
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-09
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-10
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-11
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-12
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-13
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-14
FORMULA_NAME Philosophers-COL-005000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679456259275
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-005000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:37:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 03:37:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:37:41] [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-22 03:37:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 03:37:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2023-03-22 03:37:41] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25000 PT places and 25000.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
[2023-03-22 03:37:41] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 03:37:41] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10003 steps, including 1 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 79) seen :42
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 37) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 03:37:42] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 03:37:42] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-22 03:37:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 03:37:42] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :11
[2023-03-22 03:37:42] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :11
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-22 03:37:42] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :11
Fused 15 Parikh solutions to 10 different solutions.
Finished Parikh walk after 192 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=96 )
Parikh walk visited 11 properties in 383 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-22 03:37:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-22 03:37:42] [INFO ] Flatten gal took : 18 ms
FORMULA Philosophers-COL-005000-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-005000-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 03:37:42] [INFO ] Flatten gal took : 5 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5000) 5000) 5000)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 03:37:43] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions 80000 arcs in 217 ms.
[2023-03-22 03:37:43] [INFO ] Unfolded 14 HLPN properties in 29 ms.
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 124 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 03:37:44] [INFO ] Computed 10000 place invariants in 147 ms
[2023-03-22 03:37:47] [INFO ] Implicit Places using invariants in 2896 ms returned []
Implicit Place search using SMT only with invariants took 2899 ms to find 0 implicit places.
[2023-03-22 03:37:47] [INFO ] Invariant cache hit.
[2023-03-22 03:37:49] [INFO ] Dead Transitions using invariants and state equation in 2727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5756 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 25000 out of 25000 places after structural reductions.
[2023-03-22 03:37:52] [INFO ] Flatten gal took : 1270 ms
[2023-03-22 03:37:57] [INFO ] Flatten gal took : 1045 ms
[2023-03-22 03:38:03] [INFO ] Input system was already deterministic with 25000 transitions.
Interrupted random walk after 4345 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 34
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 660 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 654 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 721 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 485 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 658 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1167 ms. (steps per millisecond=0 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 489 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 488 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 502 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 501 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 670 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 666 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 660 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 536 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 667 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 499 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 504 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 683 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 503 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 504 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 666 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 494 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 662 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 683 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 515 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 510 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 494 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1348 ms. (steps per millisecond=0 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 655 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 482 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 662 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 488 ms. (steps per millisecond=2 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1021 ms. (steps per millisecond=0 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 508 ms. (steps per millisecond=1 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
[2023-03-22 03:38:56] [INFO ] Invariant cache hit.
[2023-03-22 03:39:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 7365 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:621)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-22 03:39:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:39:21] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 36 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 213 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Interrupted random walk after 4755 steps, including 1 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 651 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 658 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 658 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 487 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 657 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1161 ms. (steps per millisecond=0 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 506 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 487 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 493 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 489 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 657 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 660 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 652 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 658 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 491 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 491 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 675 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 484 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 487 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 661 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 488 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 659 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 657 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 485 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 488 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1343 ms. (steps per millisecond=0 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 669 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 481 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 658 ms. (steps per millisecond=1 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 487 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1003 ms. (steps per millisecond=0 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=2 ) properties (out of 35) seen :0
Probabilistic random walk after 32997 steps, saw 32995 distinct states, run finished after 153176 ms. (steps per millisecond=0 ) properties seen :1
Running SMT prover for 34 properties.
[2023-03-22 03:42:47] [INFO ] Invariant cache hit.
[2023-03-22 03:43:10] [INFO ] [Real]Absence check using 10000 positive place invariants in 8015 ms returned sat
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.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-22 03:43:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:43:12] [INFO ] After 25105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 34 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 170 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-22 03:43:14] [INFO ] Flatten gal took : 948 ms
[2023-03-22 03:43:19] [INFO ] Flatten gal took : 987 ms
[2023-03-22 03:43:25] [INFO ] Input system was already deterministic with 25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 53 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:26] [INFO ] Flatten gal took : 625 ms
[2023-03-22 03:43:27] [INFO ] Flatten gal took : 717 ms
[2023-03-22 03:43:28] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 52 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:29] [INFO ] Flatten gal took : 682 ms
[2023-03-22 03:43:30] [INFO ] Flatten gal took : 715 ms
[2023-03-22 03:43:31] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 52 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:32] [INFO ] Flatten gal took : 614 ms
[2023-03-22 03:43:33] [INFO ] Flatten gal took : 678 ms
[2023-03-22 03:43:34] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 820 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:36] [INFO ] Flatten gal took : 627 ms
[2023-03-22 03:43:37] [INFO ] Flatten gal took : 711 ms
[2023-03-22 03:43:38] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 524 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:40] [INFO ] Flatten gal took : 578 ms
[2023-03-22 03:43:40] [INFO ] Flatten gal took : 667 ms
[2023-03-22 03:43:42] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 487 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:43] [INFO ] Flatten gal took : 611 ms
[2023-03-22 03:43:44] [INFO ] Flatten gal took : 656 ms
[2023-03-22 03:43:45] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1286 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1286 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:47] [INFO ] Flatten gal took : 589 ms
[2023-03-22 03:43:48] [INFO ] Flatten gal took : 666 ms
[2023-03-22 03:43:49] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 431 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:50] [INFO ] Flatten gal took : 610 ms
[2023-03-22 03:43:51] [INFO ] Flatten gal took : 678 ms
[2023-03-22 03:43:52] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 46 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:53] [INFO ] Flatten gal took : 629 ms
[2023-03-22 03:43:54] [INFO ] Flatten gal took : 682 ms
[2023-03-22 03:43:55] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 43 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:43:56] [INFO ] Flatten gal took : 591 ms
[2023-03-22 03:43:56] [INFO ] Flatten gal took : 682 ms
[2023-03-22 03:43:58] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1227 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1228 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:44:00] [INFO ] Flatten gal took : 583 ms
[2023-03-22 03:44:00] [INFO ] Flatten gal took : 678 ms
[2023-03-22 03:44:02] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 468 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:44:03] [INFO ] Flatten gal took : 583 ms
[2023-03-22 03:44:04] [INFO ] Flatten gal took : 643 ms
[2023-03-22 03:44:05] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 430 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:44:06] [INFO ] Flatten gal took : 609 ms
[2023-03-22 03:44:07] [INFO ] Flatten gal took : 663 ms
[2023-03-22 03:44:08] [INFO ] Input system was already deterministic with 25000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 42 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-22 03:44:09] [INFO ] Flatten gal took : 606 ms
[2023-03-22 03:44:10] [INFO ] Flatten gal took : 684 ms
[2023-03-22 03:44:11] [INFO ] Input system was already deterministic with 25000 transitions.
[2023-03-22 03:44:12] [INFO ] Flatten gal took : 929 ms
[2023-03-22 03:44:17] [INFO ] Flatten gal took : 957 ms
[2023-03-22 03:44:21] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 107 ms.
[2023-03-22 03:44:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25000 places, 25000 transitions and 80000 arcs took 83 ms.
Total runtime 400992 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/489/ctl_0_ --ctl=/tmp/489/ctl_1_ --ctl=/tmp/489/ctl_2_ --ctl=/tmp/489/ctl_3_ --ctl=/tmp/489/ctl_4_ --ctl=/tmp/489/ctl_5_ --ctl=/tmp/489/ctl_6_ --ctl=/tmp/489/ctl_7_ --ctl=/tmp/489/ctl_8_ --ctl=/tmp/489/ctl_9_ --ctl=/tmp/489/ctl_10_ --ctl=/tmp/489/ctl_11_ --ctl=/tmp/489/ctl_12_ --ctl=/tmp/489/ctl_13_ --mu-par --mu-opt
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-00
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-01
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-02
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-03
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-05
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-06
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-07
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-08
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-10
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-11
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-12
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-13
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-14
Could not compute solution for formula : Philosophers-COL-005000-CTLCardinality-15
BK_STOP 1679457125964
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name Philosophers-COL-005000-CTLCardinality-00
ctl formula formula --ctl=/tmp/489/ctl_0_
ctl formula name Philosophers-COL-005000-CTLCardinality-01
ctl formula formula --ctl=/tmp/489/ctl_1_
ctl formula name Philosophers-COL-005000-CTLCardinality-02
ctl formula formula --ctl=/tmp/489/ctl_2_
ctl formula name Philosophers-COL-005000-CTLCardinality-03
ctl formula formula --ctl=/tmp/489/ctl_3_
ctl formula name Philosophers-COL-005000-CTLCardinality-05
ctl formula formula --ctl=/tmp/489/ctl_4_
ctl formula name Philosophers-COL-005000-CTLCardinality-06
ctl formula formula --ctl=/tmp/489/ctl_5_
ctl formula name Philosophers-COL-005000-CTLCardinality-07
ctl formula formula --ctl=/tmp/489/ctl_6_
ctl formula name Philosophers-COL-005000-CTLCardinality-08
ctl formula formula --ctl=/tmp/489/ctl_7_
ctl formula name Philosophers-COL-005000-CTLCardinality-10
ctl formula formula --ctl=/tmp/489/ctl_8_
ctl formula name Philosophers-COL-005000-CTLCardinality-11
ctl formula formula --ctl=/tmp/489/ctl_9_
ctl formula name Philosophers-COL-005000-CTLCardinality-12
ctl formula formula --ctl=/tmp/489/ctl_10_
ctl formula name Philosophers-COL-005000-CTLCardinality-13
ctl formula formula --ctl=/tmp/489/ctl_11_
ctl formula name Philosophers-COL-005000-CTLCardinality-14
ctl formula formula --ctl=/tmp/489/ctl_12_
ctl formula name Philosophers-COL-005000-CTLCardinality-15
ctl formula formula --ctl=/tmp/489/ctl_13_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.650 real 0.260 user 0.380 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 25000->25000 groups
pnml2lts-sym: Regrouping took 321.870 real 319.150 user 1.480 sys
pnml2lts-sym: state vector length is 25000; there are 25000 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
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="Philosophers-COL-005000"
export BK_EXAMINATION="CTLCardinality"
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 Philosophers-COL-005000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950000153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-005000.tgz
mv Philosophers-COL-005000 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;