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

About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S32C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7500.936 3600000.00 3663840.00 8143.00 FTT?TTFTTFFTFFTT 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.r234-tall-167856421000902.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 marciexred
Input is MultiCrashLeafsetExtension-PT-S32C03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856421000902
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 14K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K 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.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 119K Feb 26 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K 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 18M 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-S32C03-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679641933022

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 07:12:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 07:12:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 07:12:15] [INFO ] Load time of PNML (sax parser for PT used): 612 ms
[2023-03-24 07:12:15] [INFO ] Transformed 15862 places.
[2023-03-24 07:12:15] [INFO ] Transformed 25109 transitions.
[2023-03-24 07:12:15] [INFO ] Parsed PT model containing 15862 places and 25109 transitions and 104566 arcs in 796 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 319 resets, run finished after 825 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 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 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 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 4 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 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 8441 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8441 steps, saw 4037 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 16 properties.
[2023-03-24 07:12:19] [INFO ] Flow matrix only has 24053 transitions (discarded 1056 similar events)
// Phase 1: matrix 24053 rows 15862 cols
[2023-03-24 07:12:21] [INFO ] Computed 1403 place invariants in 2117 ms
[2023-03-24 07:12:26] [INFO ] After 4981ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-24 07:12:31] [INFO ] [Nat]Absence check using 76 positive place invariants in 110 ms returned sat
[2023-03-24 07:12:32] [INFO ] [Nat]Absence check using 76 positive and 1327 generalized place invariants in 1108 ms returned sat
[2023-03-24 07:12:52] [INFO ] After 18216ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :3
[2023-03-24 07:12:52] [INFO ] State equation strengthened by 8098 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.Application.startNoEx(Application.java:902)
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 07:12:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:12:52] [INFO ] After 25186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 15862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Graph (complete) has 59447 edges and 15862 vertex of which 15820 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.44 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 3146 transitions
Trivial Post-agglo rules discarded 3146 transitions
Performed 3146 trivial Post agglomeration. Transition count delta: 3146
Iterating post reduction 0 with 3146 rules applied. Total rules applied 3147 place count 15820 transition count 21963
Reduce places removed 3146 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 3164 rules applied. Total rules applied 6311 place count 12674 transition count 21945
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 6329 place count 12656 transition count 21945
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 6329 place count 12656 transition count 21748
Deduced a syphon composed of 197 places in 23 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 6723 place count 12459 transition count 21748
Discarding 2964 places :
Symmetric choice reduction at 3 with 2964 rule applications. Total rules 9687 place count 9495 transition count 18784
Iterating global reduction 3 with 2964 rules applied. Total rules applied 12651 place count 9495 transition count 18784
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12651 place count 9495 transition count 18782
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12655 place count 9493 transition count 18782
Discarding 982 places :
Symmetric choice reduction at 3 with 982 rule applications. Total rules 13637 place count 8511 transition count 15836
Iterating global reduction 3 with 982 rules applied. Total rules applied 14619 place count 8511 transition count 15836
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 24 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 14683 place count 8479 transition count 15804
Free-agglomeration rule (complex) applied 568 times.
Iterating global reduction 3 with 568 rules applied. Total rules applied 15251 place count 8479 transition count 17200
Reduce places removed 568 places and 0 transitions.
Iterating post reduction 3 with 568 rules applied. Total rules applied 15819 place count 7911 transition count 17200
Partial Free-agglomeration rule applied 131 times.
Drop transitions removed 131 transitions
Iterating global reduction 4 with 131 rules applied. Total rules applied 15950 place count 7911 transition count 17200
Applied a total of 15950 rules in 15821 ms. Remains 7911 /15862 variables (removed 7951) and now considering 17200/25109 (removed 7909) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15825 ms. Remains : 7911/15862 places, 17200/25109 transitions.
Incomplete random walk after 10000 steps, including 522 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-24 07:13:08] [INFO ] Flow matrix only has 15648 transitions (discarded 1552 similar events)
// Phase 1: matrix 15648 rows 7911 cols
[2023-03-24 07:13:09] [INFO ] Computed 1361 place invariants in 737 ms
[2023-03-24 07:13:10] [INFO ] [Real]Absence check using 65 positive place invariants in 141 ms returned sat
[2023-03-24 07:13:11] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 480 ms returned sat
[2023-03-24 07:13:22] [INFO ] After 11484ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-24 07:13:22] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-24 07:13:24] [INFO ] After 1379ms SMT Verify possible using 8098 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 07:13:24] [INFO ] After 14656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 07:13:25] [INFO ] [Nat]Absence check using 65 positive place invariants in 155 ms returned sat
[2023-03-24 07:13:25] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 506 ms returned sat
[2023-03-24 07:13:42] [INFO ] After 16511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 07:13:49] [INFO ] After 6511ms SMT Verify possible using 8098 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 07:13:49] [INFO ] After 6514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-24 07:13:49] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 14 out of 7911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7911/7911 places, 17200/17200 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7911 transition count 17199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7910 transition count 17199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 7910 transition count 17198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 7909 transition count 17198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 6 place count 7907 transition count 17196
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 7907 transition count 17196
Applied a total of 8 rules in 5871 ms. Remains 7907 /7911 variables (removed 4) and now considering 17196/17200 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5872 ms. Remains : 7907/7911 places, 17196/17200 transitions.
Incomplete random walk after 10000 steps, including 522 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 3) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 07:13:55] [INFO ] Flow matrix only has 15644 transitions (discarded 1552 similar events)
// Phase 1: matrix 15644 rows 7907 cols
[2023-03-24 07:13:56] [INFO ] Computed 1361 place invariants in 741 ms
[2023-03-24 07:13:57] [INFO ] [Real]Absence check using 65 positive place invariants in 123 ms returned sat
[2023-03-24 07:13:57] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 532 ms returned sat
[2023-03-24 07:14:06] [INFO ] After 8882ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-24 07:14:07] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-24 07:14:08] [INFO ] After 1031ms SMT Verify possible using 8098 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 07:14:08] [INFO ] After 11602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 07:14:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 123 ms returned sat
[2023-03-24 07:14:09] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 480 ms returned sat
[2023-03-24 07:14:22] [INFO ] After 12618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 07:14:23] [INFO ] After 1621ms SMT Verify possible using 8098 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-24 07:14:38] [INFO ] Deduced a trap composed of 284 places in 13712 ms of which 20 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.Application.startNoEx(Application.java:902)
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 07:14:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:14:38] [INFO ] After 30224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 7907 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7907/7907 places, 17196/17196 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 7907 transition count 17193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 7904 transition count 17193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 7904 transition count 17191
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 7902 transition count 17191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 7901 transition count 17190
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 30 place count 7901 transition count 17172
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 48 place count 7883 transition count 17172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 7879 transition count 17168
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 7879 transition count 17168
Applied a total of 56 rules in 7395 ms. Remains 7879 /7907 variables (removed 28) and now considering 17168/17196 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7395 ms. Remains : 7879/7907 places, 17168/17196 transitions.
Incomplete random walk after 10000 steps, including 523 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 14726 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 14726 steps, saw 6749 distinct states, run finished after 3003 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 07:14:49] [INFO ] Flow matrix only has 15602 transitions (discarded 1566 similar events)
// Phase 1: matrix 15602 rows 7879 cols
[2023-03-24 07:14:49] [INFO ] Computed 1361 place invariants in 719 ms
[2023-03-24 07:14:50] [INFO ] [Real]Absence check using 65 positive place invariants in 141 ms returned sat
[2023-03-24 07:14:51] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 476 ms returned sat
[2023-03-24 07:15:01] [INFO ] After 12014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 07:15:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 140 ms returned sat
[2023-03-24 07:15:03] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 466 ms returned sat
[2023-03-24 07:15:14] [INFO ] After 11323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 07:15:14] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-24 07:15:16] [INFO ] After 1871ms SMT Verify possible using 8098 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 07:15:29] [INFO ] Deduced a trap composed of 273 places in 12485 ms of which 9 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.Application.startNoEx(Application.java:902)
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 07:15:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 07:15:29] [INFO ] After 27654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 7879 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7879/7879 places, 17168/17168 transitions.
Applied a total of 0 rules in 2019 ms. Remains 7879 /7879 variables (removed 0) and now considering 17168/17168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2019 ms. Remains : 7879/7879 places, 17168/17168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7879/7879 places, 17168/17168 transitions.
Applied a total of 0 rules in 2044 ms. Remains 7879 /7879 variables (removed 0) and now considering 17168/17168 (removed 0) transitions.
[2023-03-24 07:15:33] [INFO ] Flow matrix only has 15602 transitions (discarded 1566 similar events)
[2023-03-24 07:15:33] [INFO ] Invariant cache hit.
[2023-03-24 07:15:34] [INFO ] Implicit Places using invariants in 705 ms returned []
Implicit Place search using SMT only with invariants took 706 ms to find 0 implicit places.
[2023-03-24 07:15:34] [INFO ] Flow matrix only has 15602 transitions (discarded 1566 similar events)
[2023-03-24 07:15:34] [INFO ] Invariant cache hit.
[2023-03-24 07:15:35] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3450 ms. Remains : 7879/7879 places, 17168/17168 transitions.
Graph (trivial) has 6882 edges and 7879 vertex of which 33 / 7879 are part of one of the 1 SCC in 8 ms
Free SCC test removed 32 places
Drop transitions removed 1116 transitions
Ensure Unique test removed 1506 transitions
Reduce isomorphic transitions removed 2622 transitions.
Graph (complete) has 39107 edges and 7847 vertex of which 7817 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.5 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 641 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node14DetectsThatNode17CanReplaceNode16.Node17IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 451 rules applied. Total rules applied 453 place count 7175 transition count 14095
Ensure Unique test removed 1 places
Reduce places removed 450 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 449 transitions.
Drop transitions removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 1 with 1347 rules applied. Total rules applied 1800 place count 6725 transition count 13198
Ensure Unique test removed 1 places
Reduce places removed 449 places and 0 transitions.
Drop transitions removed 56 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 448 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 1289 rules applied. Total rules applied 3089 place count 6276 transition count 12358
Ensure Unique test removed 56 places
Reduce places removed 448 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 392 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 3 with 1230 rules applied. Total rules applied 4319 place count 5828 transition count 11576
Ensure Unique test removed 2 places
Reduce places removed 392 places and 0 transitions.
Drop transitions removed 52 transitions
Ensure Unique test removed 338 transitions
Reduce isomorphic transitions removed 390 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 4 with 1120 rules applied. Total rules applied 5439 place count 5436 transition count 10848
Ensure Unique test removed 52 places
Reduce places removed 390 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 338 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 5 with 1064 rules applied. Total rules applied 6503 place count 5046 transition count 10174
Ensure Unique test removed 2 places
Reduce places removed 338 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 336 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 6 with 962 rules applied. Total rules applied 7465 place count 4708 transition count 9550
Ensure Unique test removed 48 places
Reduce places removed 336 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 288 transitions.
Drop transitions removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 7 with 910 rules applied. Total rules applied 8375 place count 4372 transition count 8976
Ensure Unique test removed 2 places
Reduce places removed 288 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 286 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 8 with 816 rules applied. Total rules applied 9191 place count 4084 transition count 8448
Ensure Unique test removed 44 places
Reduce places removed 286 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 9 with 768 rules applied. Total rules applied 9959 place count 3798 transition count 7966
Ensure Unique test removed 2 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 10 with 682 rules applied. Total rules applied 10641 place count 3556 transition count 7526
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 11 with 638 rules applied. Total rules applied 11279 place count 3316 transition count 7128
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 12 with 560 rules applied. Total rules applied 11839 place count 3116 transition count 6768
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 13 with 519 rules applied. Total rules applied 12358 place count 2918 transition count 6447
Ensure Unique test removed 2 places
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 159 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 14 with 447 rules applied. Total rules applied 12805 place count 2757 transition count 6161
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 15 with 412 rules applied. Total rules applied 13217 place count 2598 transition count 5908
Ensure Unique test removed 1 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 16 with 351 rules applied. Total rules applied 13568 place count 2471 transition count 5684
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 17 with 320 rules applied. Total rules applied 13888 place count 2345 transition count 5490
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 18 with 266 rules applied. Total rules applied 14154 place count 2247 transition count 5322
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 19 with 238 rules applied. Total rules applied 14392 place count 2151 transition count 5180
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 20 with 192 rules applied. Total rules applied 14584 place count 2079 transition count 5060
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 21 with 168 rules applied. Total rules applied 14752 place count 2009 transition count 4962
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 22 with 130 rules applied. Total rules applied 14882 place count 1959 transition count 4882
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 23 with 110 rules applied. Total rules applied 14992 place count 1911 transition count 4820
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 24 with 80 rules applied. Total rules applied 15072 place count 1879 transition count 4772
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 25 with 64 rules applied. Total rules applied 15136 place count 1849 transition count 4738
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 26 with 42 rules applied. Total rules applied 15178 place count 1831 transition count 4714
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 27 with 30 rules applied. Total rules applied 15208 place count 1815 transition count 4700
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 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 28 with 16 rules applied. Total rules applied 15224 place count 1807 transition count 4692
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 29 with 9 rules applied. Total rules applied 15233 place count 1801 transition count 4689
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 15237 place count 1798 transition count 4688
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 198 Pre rules applied. Total rules applied 15237 place count 1798 transition count 4490
Deduced a syphon composed of 198 places in 1 ms
Ensure Unique test removed 198 places
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 31 with 594 rules applied. Total rules applied 15831 place count 1402 transition count 4490
Discarding 224 places :
Symmetric choice reduction at 31 with 224 rule applications. Total rules 16055 place count 1178 transition count 4266
Iterating global reduction 31 with 224 rules applied. Total rules applied 16279 place count 1178 transition count 4266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 16279 place count 1178 transition count 4265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 16281 place count 1177 transition count 4265
Discarding 991 places :
Symmetric choice reduction at 31 with 991 rule applications. Total rules 17272 place count 186 transition count 1292
Iterating global reduction 31 with 991 rules applied. Total rules applied 18263 place count 186 transition count 1292
Ensure Unique test removed 991 transitions
Reduce isomorphic transitions removed 991 transitions.
Iterating post reduction 31 with 991 rules applied. Total rules applied 19254 place count 186 transition count 301
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 32 with 68 rules applied. Total rules applied 19322 place count 151 transition count 268
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 32 with 6 rules applied. Total rules applied 19328 place count 151 transition count 262
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 32 with 6 rules applied. Total rules applied 19334 place count 145 transition count 262
Discarding 30 places :
Symmetric choice reduction at 33 with 30 rule applications. Total rules 19364 place count 115 transition count 172
Ensure Unique test removed 30 places
Iterating global reduction 33 with 60 rules applied. Total rules applied 19424 place count 85 transition count 172
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 19454 place count 85 transition count 142
Discarding 30 places :
Symmetric choice reduction at 34 with 30 rule applications. Total rules 19484 place count 55 transition count 52
Iterating global reduction 34 with 30 rules applied. Total rules applied 19514 place count 55 transition count 52
Discarding 30 places :
Symmetric choice reduction at 34 with 30 rule applications. Total rules 19544 place count 25 transition count 22
Iterating global reduction 34 with 30 rules applied. Total rules applied 19574 place count 25 transition count 22
Applied a total of 19574 rules in 15552 ms. Remains 25 /7879 variables (removed 7854) and now considering 22/17168 (removed 17146) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 25 cols
[2023-03-24 07:15:50] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-24 07:15:50] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-24 07:15:50] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-24 07:15:50] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 07:15:50] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-24 07:15:50] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2023-03-24 07:15:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-24 07:15:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7879 places, 17168 transitions and 93030 arcs took 73 ms.
[2023-03-24 07:15:51] [INFO ] Flatten gal took : 907 ms
Total runtime 217474 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 7879 NrTr: 17168 NrArc: 93030)

parse formulas
formulas created successfully
place and transition orderings generation:0m29.148sec

net check time: 0m 0.016sec

init dd package: 0m 2.653sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8611768 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062240 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 1.094sec

26024 30305 47811 64492 81335 96876 112009 112022 126821 143290

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-S32C03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856421000902"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C03.tgz
mv MultiCrashLeafsetExtension-PT-S32C03 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;