fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419500857
Last Updated
May 14, 2023

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16198.212 3600000.00 12670156.00 4020.30 TF?TT?TFTFFT?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.r233-tall-167856419500857.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 MultiCrashLeafsetExtension-PT-S24C09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419500857
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 11K Feb 26 03:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 03:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679640184629

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=MultiCrashLeafsetExtension-PT-S24C09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 06:43:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 06:43:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 06:43:06] [INFO ] Load time of PNML (sax parser for PT used): 588 ms
[2023-03-24 06:43:06] [INFO ] Transformed 16538 places.
[2023-03-24 06:43:07] [INFO ] Transformed 24169 transitions.
[2023-03-24 06:43:07] [INFO ] Parsed PT model containing 16538 places and 24169 transitions and 90398 arcs in 771 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Support contains 129 out of 16538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16538/16538 places, 24169/24169 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 16493 transition count 24169
Applied a total of 45 rules in 744 ms. Remains 16493 /16538 variables (removed 45) and now considering 24169/24169 (removed 0) transitions.
[2023-03-24 06:43:08] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
// Phase 1: matrix 23569 rows 16493 cols
[2023-03-24 06:43:10] [INFO ] Computed 1146 place invariants in 2004 ms
[2023-03-24 06:43:11] [INFO ] Implicit Places using invariants in 3584 ms returned []
Implicit Place search using SMT only with invariants took 3608 ms to find 0 implicit places.
[2023-03-24 06:43:11] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
[2023-03-24 06:43:11] [INFO ] Invariant cache hit.
[2023-03-24 06:43:12] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16493/16538 places, 24169/24169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5697 ms. Remains : 16493/16538 places, 24169/24169 transitions.
Support contains 129 out of 16493 places after structural reductions.
[2023-03-24 06:43:14] [INFO ] Flatten gal took : 964 ms
[2023-03-24 06:43:15] [INFO ] Flatten gal took : 737 ms
[2023-03-24 06:43:16] [INFO ] Input system was already deterministic with 24169 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 75) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) 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 68) 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 68) 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 68) 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 68) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 67) 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 67) 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 67) 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 67) 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 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 67) 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 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 67) 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 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) 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 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) 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 67) 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 67) 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 67) 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 67) seen :0
Running SMT prover for 67 properties.
[2023-03-24 06:43:18] [INFO ] Flow matrix only has 23569 transitions (discarded 600 similar events)
[2023-03-24 06:43:18] [INFO ] Invariant cache hit.
[2023-03-24 06:43:33] [INFO ] [Real]Absence check using 47 positive place invariants in 192 ms returned sat
[2023-03-24 06:43:33] [INFO ] [Real]Absence check using 47 positive and 1099 generalized place invariants in 671 ms returned sat
[2023-03-24 06:43:33] [INFO ] After 15655ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:64
[2023-03-24 06:43:47] [INFO ] [Nat]Absence check using 47 positive place invariants in 189 ms returned sat
[2023-03-24 06:43:47] [INFO ] [Nat]Absence check using 47 positive and 1099 generalized place invariants in 638 ms returned sat
[2023-03-24 06:43:58] [INFO ] After 7769ms SMT Verify possible using state equation in natural domain returned unsat :53 sat :13
[2023-03-24 06:43:58] [INFO ] State equation strengthened by 7402 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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-24 06:43:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:43:58] [INFO ] After 25144ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:64
Fused 67 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 16493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16493/16493 places, 24169/24169 transitions.
Graph (complete) has 52825 edges and 16493 vertex of which 16492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.47 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5382 transitions
Trivial Post-agglo rules discarded 5382 transitions
Performed 5382 trivial Post agglomeration. Transition count delta: 5382
Iterating post reduction 0 with 5382 rules applied. Total rules applied 5383 place count 16492 transition count 18787
Reduce places removed 5382 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 5391 rules applied. Total rules applied 10774 place count 11110 transition count 18778
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 10783 place count 11101 transition count 18778
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 448 Pre rules applied. Total rules applied 10783 place count 11101 transition count 18330
Deduced a syphon composed of 448 places in 18 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 3 with 896 rules applied. Total rules applied 11679 place count 10653 transition count 18330
Discarding 4932 places :
Symmetric choice reduction at 3 with 4932 rule applications. Total rules 16611 place count 5721 transition count 13398
Iterating global reduction 3 with 4932 rules applied. Total rules applied 21543 place count 5721 transition count 13398
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 21543 place count 5721 transition count 13393
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21553 place count 5716 transition count 13393
Discarding 532 places :
Symmetric choice reduction at 3 with 532 rule applications. Total rules 22085 place count 5184 transition count 8605
Iterating global reduction 3 with 532 rules applied. Total rules applied 22617 place count 5184 transition count 8605
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 22667 place count 5159 transition count 8580
Free-agglomeration rule (complex) applied 351 times.
Iterating global reduction 3 with 351 rules applied. Total rules applied 23018 place count 5159 transition count 12237
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 3 with 351 rules applied. Total rules applied 23369 place count 4808 transition count 12237
Partial Free-agglomeration rule applied 325 times.
Drop transitions removed 325 transitions
Iterating global reduction 4 with 325 rules applied. Total rules applied 23694 place count 4808 transition count 12237
Applied a total of 23694 rules in 5464 ms. Remains 4808 /16493 variables (removed 11685) and now considering 12237/24169 (removed 11932) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5474 ms. Remains : 4808/16493 places, 12237/24169 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 678 ms. (steps per millisecond=14 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :1
Running SMT prover for 8 properties.
[2023-03-24 06:44:06] [INFO ] Flow matrix only has 11351 transitions (discarded 886 similar events)
// Phase 1: matrix 11351 rows 4808 cols
[2023-03-24 06:44:06] [INFO ] Computed 1145 place invariants in 323 ms
[2023-03-24 06:44:07] [INFO ] After 894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-24 06:44:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-24 06:44:08] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 295 ms returned sat
[2023-03-24 06:44:18] [INFO ] After 8993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-24 06:44:18] [INFO ] State equation strengthened by 7154 read => feed constraints.
[2023-03-24 06:44:32] [INFO ] After 14099ms SMT Verify possible using 7154 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-24 06:44:32] [INFO ] After 14100ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-24 06:44:32] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 12 out of 4808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4808/4808 places, 12237/12237 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 4808 transition count 12233
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 4804 transition count 12233
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 4804 transition count 12231
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 4802 transition count 12231
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 19 place count 4802 transition count 12392
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 26 place count 4795 transition count 12392
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 34 place count 4787 transition count 12384
Iterating global reduction 3 with 8 rules applied. Total rules applied 42 place count 4787 transition count 12384
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 4787 transition count 12384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 4786 transition count 12383
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 4786 transition count 12383
Applied a total of 45 rules in 2615 ms. Remains 4786 /4808 variables (removed 22) and now considering 12383/12237 (removed -146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2615 ms. Remains : 4786/4808 places, 12383/12237 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-24 06:44:36] [INFO ] Flow matrix only has 11497 transitions (discarded 886 similar events)
// Phase 1: matrix 11497 rows 4786 cols
[2023-03-24 06:44:36] [INFO ] Computed 1145 place invariants in 311 ms
[2023-03-24 06:44:37] [INFO ] After 787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-24 06:44:38] [INFO ] [Nat]Absence check using 49 positive place invariants in 66 ms returned sat
[2023-03-24 06:44:38] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 311 ms returned sat
[2023-03-24 06:44:48] [INFO ] After 9452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-24 06:44:48] [INFO ] State equation strengthened by 7322 read => feed constraints.
[2023-03-24 06:45:02] [INFO ] After 13989ms SMT Verify possible using 7322 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-24 06:45:02] [INFO ] After 13991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-24 06:45:02] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 48 ms.
Support contains 10 out of 4786 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4786/4786 places, 12383/12383 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4786 transition count 12381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4784 transition count 12381
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 4784 transition count 12380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 4783 transition count 12380
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 4782 transition count 12379
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 4782 transition count 12379
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 4782 transition count 12379
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 4781 transition count 12378
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 4781 transition count 12378
Applied a total of 11 rules in 2421 ms. Remains 4781 /4786 variables (removed 5) and now considering 12378/12383 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2424 ms. Remains : 4781/4786 places, 12378/12383 transitions.
Successfully simplified 54 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 06:45:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-24 06:45:05] [INFO ] Flatten gal took : 557 ms
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 06:45:06] [INFO ] Flatten gal took : 611 ms
[2023-03-24 06:45:07] [INFO ] Input system was already deterministic with 24169 transitions.
Support contains 17 out of 16493 places (down from 21) after GAL structural reductions.
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 13869 stabilizing places and 18968 stable transitions
Graph (complete) has 65909 edges and 16493 vertex of which 16492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.77 ms
Starting structural reductions in LTL mode, iteration 0 : 16493/16493 places, 24169/24169 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16492 transition count 24169
Applied a total of 1 rules in 414 ms. Remains 16492 /16493 variables (removed 1) and now considering 24169/24169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 16492/16493 places, 24169/24169 transitions.
[2023-03-24 06:45:08] [INFO ] Flatten gal took : 539 ms
[2023-03-24 06:45:09] [INFO ] Flatten gal took : 596 ms
[2023-03-24 06:45:10] [INFO ] Input system was already deterministic with 24169 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16493/16493 places, 24169/24169 transitions.
Graph (complete) has 65909 edges and 16493 vertex of which 16492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.50 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5399 transitions
Trivial Post-agglo rules discarded 5399 transitions
Performed 5399 trivial Post agglomeration. Transition count delta: 5399
Iterating post reduction 0 with 5399 rules applied. Total rules applied 5400 place count 16492 transition count 18770
Reduce places removed 5399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5400 rules applied. Total rules applied 10800 place count 11093 transition count 18769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10801 place count 11092 transition count 18769
Performed 449 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 449 Pre rules applied. Total rules applied 10801 place count 11092 transition count 18320
Deduced a syphon composed of 449 places in 15 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 3 with 898 rules applied. Total rules applied 11699 place count 10643 transition count 18320
Discarding 4949 places :
Symmetric choice reduction at 3 with 4949 rule applications. Total rules 16648 place count 5694 transition count 13371
Iterating global reduction 3 with 4949 rules applied. Total rules applied 21597 place count 5694 transition count 13371
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 21597 place count 5694 transition count 13354
Deduced a syphon composed of 17 places in 9 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 21631 place count 5677 transition count 13354
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 22180 place count 5128 transition count 8413
Iterating global reduction 3 with 549 rules applied. Total rules applied 22729 place count 5128 transition count 8413
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 22779 place count 5103 transition count 8388
Applied a total of 22779 rules in 2912 ms. Remains 5103 /16493 variables (removed 11390) and now considering 8388/24169 (removed 15781) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2913 ms. Remains : 5103/16493 places, 8388/24169 transitions.
[2023-03-24 06:45:13] [INFO ] Flatten gal took : 183 ms
[2023-03-24 06:45:13] [INFO ] Flatten gal took : 200 ms
[2023-03-24 06:45:13] [INFO ] Input system was already deterministic with 8388 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16493/16493 places, 24169/24169 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16492 transition count 24169
Applied a total of 1 rules in 410 ms. Remains 16492 /16493 variables (removed 1) and now considering 24169/24169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 16492/16493 places, 24169/24169 transitions.
[2023-03-24 06:45:14] [INFO ] Flatten gal took : 531 ms
[2023-03-24 06:45:15] [INFO ] Flatten gal took : 597 ms
[2023-03-24 06:45:16] [INFO ] Input system was already deterministic with 24169 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16493/16493 places, 24169/24169 transitions.
Graph (complete) has 65909 edges and 16493 vertex of which 16492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.28 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5399 transitions
Trivial Post-agglo rules discarded 5399 transitions
Performed 5399 trivial Post agglomeration. Transition count delta: 5399
Iterating post reduction 0 with 5399 rules applied. Total rules applied 5400 place count 16492 transition count 18770
Reduce places removed 5399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5400 rules applied. Total rules applied 10800 place count 11093 transition count 18769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10801 place count 11092 transition count 18769
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 450 Pre rules applied. Total rules applied 10801 place count 11092 transition count 18319
Deduced a syphon composed of 450 places in 16 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 11701 place count 10642 transition count 18319
Discarding 4949 places :
Symmetric choice reduction at 3 with 4949 rule applications. Total rules 16650 place count 5693 transition count 13370
Iterating global reduction 3 with 4949 rules applied. Total rules applied 21599 place count 5693 transition count 13370
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 21599 place count 5693 transition count 13353
Deduced a syphon composed of 17 places in 9 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 21633 place count 5676 transition count 13353
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 22182 place count 5127 transition count 8412
Iterating global reduction 3 with 549 rules applied. Total rules applied 22731 place count 5127 transition count 8412
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 22781 place count 5102 transition count 8387
Applied a total of 22781 rules in 2776 ms. Remains 5102 /16493 variables (removed 11391) and now considering 8387/24169 (removed 15782) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2777 ms. Remains : 5102/16493 places, 8387/24169 transitions.
[2023-03-24 06:45:19] [INFO ] Flatten gal took : 177 ms
[2023-03-24 06:45:19] [INFO ] Flatten gal took : 203 ms
[2023-03-24 06:45:20] [INFO ] Input system was already deterministic with 8387 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23212 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23212 steps, saw 10957 distinct states, run finished after 3003 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:45:23] [INFO ] Flow matrix only has 7787 transitions (discarded 600 similar events)
// Phase 1: matrix 7787 rows 5102 cols
[2023-03-24 06:45:23] [INFO ] Computed 1145 place invariants in 296 ms
[2023-03-24 06:45:24] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2023-03-24 06:45:24] [INFO ] [Real]Absence check using 49 positive and 1096 generalized place invariants in 301 ms returned sat
[2023-03-24 06:45:28] [INFO ] After 4092ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 06:45:28] [INFO ] State equation strengthened by 3010 read => feed constraints.
[2023-03-24 06:45:29] [INFO ] After 568ms SMT Verify possible using 3010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:45:29] [INFO ] After 5646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:45:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2023-03-24 06:45:30] [INFO ] [Nat]Absence check using 49 positive and 1096 generalized place invariants in 322 ms returned sat
[2023-03-24 06:45:34] [INFO ] After 4348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:45:35] [INFO ] After 819ms SMT Verify possible using 3010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 06:45:35] [INFO ] After 1224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-24 06:45:36] [INFO ] After 6764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 5102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5102/5102 places, 8387/8387 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5102 transition count 12442
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4765 transition count 12442
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 4765 transition count 12442
Applied a total of 699 rules in 1949 ms. Remains 4765 /5102 variables (removed 337) and now considering 12442/8387 (removed -4055) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1949 ms. Remains : 4765/5102 places, 12442/8387 transitions.
Finished random walk after 2536 steps, including 45 resets, run visited all 1 properties in 125 ms. (steps per millisecond=20 )
FORMULA MultiCrashLeafsetExtension-PT-S24C09-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 16493/16493 places, 24169/24169 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16492 transition count 24169
Applied a total of 1 rules in 410 ms. Remains 16492 /16493 variables (removed 1) and now considering 24169/24169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 16492/16493 places, 24169/24169 transitions.
[2023-03-24 06:45:39] [INFO ] Flatten gal took : 535 ms
[2023-03-24 06:45:39] [INFO ] Flatten gal took : 642 ms
[2023-03-24 06:45:40] [INFO ] Input system was already deterministic with 24169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16493/16493 places, 24169/24169 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16492 transition count 24169
Applied a total of 1 rules in 415 ms. Remains 16492 /16493 variables (removed 1) and now considering 24169/24169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 16492/16493 places, 24169/24169 transitions.
[2023-03-24 06:45:41] [INFO ] Flatten gal took : 535 ms
[2023-03-24 06:45:42] [INFO ] Flatten gal took : 591 ms
[2023-03-24 06:45:43] [INFO ] Input system was already deterministic with 24169 transitions.
[2023-03-24 06:45:44] [INFO ] Flatten gal took : 571 ms
[2023-03-24 06:45:44] [INFO ] Flatten gal took : 590 ms
[2023-03-24 06:45:44] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-24 06:45:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16493 places, 24169 transitions and 90353 arcs took 91 ms.
Total runtime 158755 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/514/ctl_0_ --ctl=/tmp/514/ctl_1_ --ctl=/tmp/514/ctl_2_ --ctl=/tmp/514/ctl_3_ --ctl=/tmp/514/ctl_4_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 176628 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16285576 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="MultiCrashLeafsetExtension-PT-S24C09"
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 MultiCrashLeafsetExtension-PT-S24C09, 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 r233-tall-167856419500857"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C09.tgz
mv MultiCrashLeafsetExtension-PT-S24C09 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;