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-167856419400799.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-S16C08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 15K Feb 26 03:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 03:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 03:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 03:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 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 6.3M 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-S16C08-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679617331518

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 00:22:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 00:22:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 00:22:13] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2023-03-24 00:22:13] [INFO ] Transformed 6876 places.
[2023-03-24 00:22:13] [INFO ] Transformed 9571 transitions.
[2023-03-24 00:22:13] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 119 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-24 00:22:16] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-24 00:22:16] [INFO ] Computed 649 place invariants in 481 ms
[2023-03-24 00:22:19] [INFO ] [Real]Absence check using 54 positive place invariants in 35 ms returned sat
[2023-03-24 00:22:19] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 356 ms returned sat
[2023-03-24 00:22:19] [INFO ] After 2665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-24 00:22:21] [INFO ] [Nat]Absence check using 54 positive place invariants in 33 ms returned sat
[2023-03-24 00:22:21] [INFO ] [Nat]Absence check using 54 positive and 595 generalized place invariants in 336 ms returned sat
[2023-03-24 00:22:44] [INFO ] After 22235ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2023-03-24 00:22:44] [INFO ] State equation strengthened by 2722 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 00:22:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:22:44] [INFO ] After 25139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 310 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.23 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 1537 transitions
Trivial Post-agglo rules discarded 1537 transitions
Performed 1537 trivial Post agglomeration. Transition count delta: 1537
Iterating post reduction 0 with 1537 rules applied. Total rules applied 1538 place count 6840 transition count 8034
Reduce places removed 1537 places and 0 transitions.
Performed 330 Post agglomeration using F-continuation condition.Transition count delta: 330
Iterating post reduction 1 with 1867 rules applied. Total rules applied 3405 place count 5303 transition count 7704
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 2 with 330 rules applied. Total rules applied 3735 place count 4973 transition count 7704
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 3735 place count 4973 transition count 7480
Deduced a syphon composed of 224 places in 12 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 4183 place count 4749 transition count 7480
Discarding 1847 places :
Symmetric choice reduction at 3 with 1847 rule applications. Total rules 6030 place count 2902 transition count 5633
Iterating global reduction 3 with 1847 rules applied. Total rules applied 7877 place count 2902 transition count 5633
Discarding 222 places :
Symmetric choice reduction at 3 with 222 rule applications. Total rules 8099 place count 2680 transition count 5411
Iterating global reduction 3 with 222 rules applied. Total rules applied 8321 place count 2680 transition count 5411
Discarding 138 places :
Symmetric choice reduction at 3 with 138 rule applications. Total rules 8459 place count 2542 transition count 4307
Iterating global reduction 3 with 138 rules applied. Total rules applied 8597 place count 2542 transition count 4307
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 8607 place count 2537 transition count 4302
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 8630 place count 2537 transition count 4279
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 8653 place count 2514 transition count 4279
Partial Free-agglomeration rule applied 225 times.
Drop transitions removed 225 transitions
Iterating global reduction 4 with 225 rules applied. Total rules applied 8878 place count 2514 transition count 4279
Applied a total of 8878 rules in 2007 ms. Remains 2514 /6876 variables (removed 4362) and now considering 4279/9571 (removed 5292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2008 ms. Remains : 2514/6876 places, 4279/9571 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 43839 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{5=1}
Probabilistic random walk after 43839 steps, saw 20313 distinct states, run finished after 3005 ms. (steps per millisecond=14 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-24 00:22:50] [INFO ] Flow matrix only has 3984 transitions (discarded 295 similar events)
// Phase 1: matrix 3984 rows 2514 cols
[2023-03-24 00:22:50] [INFO ] Computed 613 place invariants in 52 ms
[2023-03-24 00:22:51] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2023-03-24 00:22:51] [INFO ] [Real]Absence check using 31 positive and 582 generalized place invariants in 133 ms returned sat
[2023-03-24 00:22:51] [INFO ] After 697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 00:22:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2023-03-24 00:22:52] [INFO ] [Nat]Absence check using 31 positive and 582 generalized place invariants in 128 ms returned sat
[2023-03-24 00:23:02] [INFO ] After 9770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-24 00:23:02] [INFO ] State equation strengthened by 1756 read => feed constraints.
[2023-03-24 00:23:12] [INFO ] After 9960ms SMT Verify possible using 1756 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-24 00:23:17] [INFO ] Deduced a trap composed of 476 places in 1880 ms of which 10 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 00:23:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:23:17] [INFO ] After 25666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 13 ms.
Support contains 218 out of 2514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2514/2514 places, 4279/4279 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 0 with 8 rules applied. Total rules applied 8 place count 2514 transition count 4271
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 2506 transition count 4270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 2505 transition count 4270
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 18 place count 2505 transition count 4255
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 48 place count 2490 transition count 4255
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 75 place count 2463 transition count 4186
Iterating global reduction 3 with 27 rules applied. Total rules applied 102 place count 2463 transition count 4186
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 113 place count 2452 transition count 4098
Iterating global reduction 3 with 11 rules applied. Total rules applied 124 place count 2452 transition count 4098
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 2449 transition count 4095
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 152 place count 2449 transition count 4073
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 174 place count 2427 transition count 4073
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 201 place count 2427 transition count 4073
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 213 place count 2415 transition count 4061
Iterating global reduction 4 with 12 rules applied. Total rules applied 225 place count 2415 transition count 4061
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 232 place count 2408 transition count 4005
Iterating global reduction 4 with 7 rules applied. Total rules applied 239 place count 2408 transition count 4005
Applied a total of 239 rules in 733 ms. Remains 2408 /2514 variables (removed 106) and now considering 4005/4279 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 2408/2514 places, 4005/4279 transitions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-24 00:23:18] [INFO ] Flow matrix only has 3688 transitions (discarded 317 similar events)
// Phase 1: matrix 3688 rows 2408 cols
[2023-03-24 00:23:18] [INFO ] Computed 613 place invariants in 65 ms
[2023-03-24 00:23:19] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2023-03-24 00:23:19] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 121 ms returned sat
[2023-03-24 00:23:19] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-24 00:23:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 46 ms returned sat
[2023-03-24 00:23:20] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 124 ms returned sat
[2023-03-24 00:23:26] [INFO ] After 6271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 00:23:26] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-24 00:23:31] [INFO ] After 5069ms SMT Verify possible using 1588 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-24 00:23:35] [INFO ] Deduced a trap composed of 315 places in 1714 ms of which 7 ms to minimize.
[2023-03-24 00:23:38] [INFO ] Deduced a trap composed of 459 places in 1638 ms of which 4 ms to minimize.
[2023-03-24 00:23:40] [INFO ] Deduced a trap composed of 464 places in 1720 ms of which 4 ms to minimize.
[2023-03-24 00:23:43] [INFO ] Deduced a trap composed of 432 places in 1672 ms of which 3 ms to minimize.
[2023-03-24 00:23:44] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 11040 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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 00:23:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:23:44] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 16 ms.
Support contains 195 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 4005/4005 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2408 transition count 4000
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 2403 transition count 4000
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 2403 transition count 3998
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 2401 transition count 3998
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 2396 transition count 3979
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 2396 transition count 3979
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 2393 transition count 3955
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 2393 transition count 3955
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 2392 transition count 3954
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 2392 transition count 3954
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 2387 transition count 3949
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 2387 transition count 3949
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 2383 transition count 3917
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 2383 transition count 3917
Applied a total of 72 rules in 542 ms. Remains 2383 /2408 variables (removed 25) and now considering 3917/4005 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 2383/2408 places, 3917/4005 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 47883 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47883 steps, saw 22057 distinct states, run finished after 3002 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-24 00:23:48] [INFO ] Flow matrix only has 3600 transitions (discarded 317 similar events)
// Phase 1: matrix 3600 rows 2383 cols
[2023-03-24 00:23:48] [INFO ] Computed 613 place invariants in 66 ms
[2023-03-24 00:23:49] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2023-03-24 00:23:49] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 134 ms returned sat
[2023-03-24 00:23:49] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-24 00:23:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-24 00:23:50] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 127 ms returned sat
[2023-03-24 00:23:57] [INFO ] After 6987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-24 00:23:57] [INFO ] State equation strengthened by 1525 read => feed constraints.
[2023-03-24 00:24:01] [INFO ] After 4450ms SMT Verify possible using 1525 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-24 00:24:05] [INFO ] Deduced a trap composed of 525 places in 1586 ms of which 3 ms to minimize.
[2023-03-24 00:24:06] [INFO ] Deduced a trap composed of 555 places in 1650 ms of which 3 ms to minimize.
[2023-03-24 00:24:08] [INFO ] Deduced a trap composed of 485 places in 1679 ms of which 4 ms to minimize.
[2023-03-24 00:24:10] [INFO ] Deduced a trap composed of 517 places in 1668 ms of which 4 ms to minimize.
[2023-03-24 00:24:12] [INFO ] Deduced a trap composed of 508 places in 1609 ms of which 2 ms to minimize.
[2023-03-24 00:24:14] [INFO ] Deduced a trap composed of 436 places in 1681 ms of which 6 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 00:24:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:24:14] [INFO ] After 25298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 21 ms.
Support contains 195 out of 2383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2383/2383 places, 3917/3917 transitions.
Applied a total of 0 rules in 105 ms. Remains 2383 /2383 variables (removed 0) and now considering 3917/3917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2383/2383 places, 3917/3917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2383/2383 places, 3917/3917 transitions.
Applied a total of 0 rules in 98 ms. Remains 2383 /2383 variables (removed 0) and now considering 3917/3917 (removed 0) transitions.
[2023-03-24 00:24:15] [INFO ] Flow matrix only has 3600 transitions (discarded 317 similar events)
[2023-03-24 00:24:15] [INFO ] Invariant cache hit.
[2023-03-24 00:24:17] [INFO ] Implicit Places using invariants in 2453 ms returned [4, 7, 11, 12, 13, 14, 15, 16, 18, 26, 41, 53, 66, 83, 99, 115, 116, 117, 118, 119, 121, 122, 123, 124, 138, 149, 157, 163, 167, 170, 189, 195, 199, 200, 201, 202, 204, 205, 206, 209, 213, 220, 229, 242, 256, 270, 286, 288, 289, 290, 291, 292, 293, 306, 315, 321, 328, 330, 354, 361, 364, 368, 369, 370, 371, 372, 374, 376, 380, 387, 398, 411, 423, 435, 436, 437, 438, 439, 441, 442, 443, 452, 461, 465, 467, 469, 471, 501, 504, 506, 507, 508, 509, 510, 511, 512, 514, 516, 520, 526, 533, 541, 551, 561, 562, 565, 566, 567, 568, 569, 578, 585, 588, 590, 592, 594, 616, 622, 625, 626, 628, 630, 631, 632, 633, 635, 637, 642, 645, 650, 658, 666, 674, 675, 676, 677, 678, 679, 680, 681, 682, 687, 690, 692, 694, 696, 698, 725, 729, 730, 731, 732, 733, 734, 736, 740, 742, 744, 749, 756, 762, 768, 769, 770, 771, 772, 773, 774, 776, 781, 783, 785, 787, 789, 791, 812, 819, 823, 824, 825, 826, 827, 828, 830, 832, 834, 836, 840, 842, 847, 854, 858, 859, 860, 861, 863, 864, 866, 871, 875, 877, 880, 882, 884, 912, 915, 916, 917, 918, 921, 922, 923, 925, 927, 931, 933, 935, 937, 941, 946, 947, 950, 951, 952, 953, 957, 959, 964, 966, 968, 970, 994, 996, 1000, 1003, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1014, 1017, 1019, 1021, 1026, 1028, 1030, 1034, 1035, 1037, 1038, 1039, 1040, 1041, 1043, 1047, 1049, 1054, 1056, 1059, 1079, 1086, 1090, 1091, 1093, 1094, 1095, 1096, 1097, 1099, 1101, 1103, 1105, 1107, 1109, 1115, 1119, 1120, 1121, 1122, 1123, 1125, 1126, 1130, 1132, 1134, 1136, 1138, 1143, 1164, 1171, 1174, 1175, 1176, 1177, 1180, 1181, 1182, 1188, 1191, 1194, 1199, 1203, 1205, 1210, 1211, 1212, 1213, 1214, 1215, 1216, 1218, 1221, 1225, 1227, 1229, 1231, 1233, 1254, 1261, 1264, 1266, 1267, 1269, 1270, 1271, 1272, 1274, 1276, 1278, 1280, 1285, 1288, 1295, 1302, 1304, 1305, 1307, 1308, 1309, 1310, 1317, 1320, 1322, 1324, 1326, 1330, 1352, 1358, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1372, 1374, 1376, 1378, 1381, 1386, 1392, 1401, 1403, 1404, 1406, 1407, 1408, 1409, 1418, 1423, 1428, 1430, 1432, 1434, 1455, 1461, 1464, 1465, 1466, 1468, 1469, 1470, 1471, 1472, 1476, 1478, 1480, 1482, 1487, 1494, 1502, 1513, 1514, 1515, 1517, 1518, 1519, 1520, 1521, 1530, 1537, 1545, 1547, 1549, 1551, 1571, 1577, 1580, 1585, 1586, 1587, 1588, 1589, 1593, 1597, 1599, 1603, 1613, 1622, 1632, 1645, 1646, 1647, 1648, 1649, 1650, 1651, 1652, 1653, 1664, 1673, 1680, 1684, 1686, 1688, 1715, 1718, 1719, 1721, 1722, 1724, 1725, 1726, 1730, 1733, 1740, 1746, 1755, 1766, 1778, 1793, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1801, 1814, 1825, 1834, 1841, 1845, 1848, 1868, 1870, 1873, 1876, 1878, 1879, 1880, 1884, 1885, 1889, 1897, 1903, 1914, 1925, 1938, 1952, 1969, 1971, 1972, 1974, 1975, 1976, 1977, 1995, 2008, 2019, 2027, 2033, 2037, 2062]
Discarding 501 places :
Implicit Place search using SMT only with invariants took 2461 ms to find 501 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1882/2383 places, 3917/3917 transitions.
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 202 place count 1680 transition count 3715
Iterating global reduction 0 with 202 rules applied. Total rules applied 404 place count 1680 transition count 3715
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 603 place count 1481 transition count 3516
Iterating global reduction 0 with 199 rules applied. Total rules applied 802 place count 1481 transition count 3516
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 804 place count 1479 transition count 3500
Iterating global reduction 0 with 2 rules applied. Total rules applied 806 place count 1479 transition count 3500
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 808 place count 1479 transition count 3498
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 810 place count 1477 transition count 3498
Applied a total of 810 rules in 240 ms. Remains 1477 /1882 variables (removed 405) and now considering 3498/3917 (removed 419) transitions.
[2023-03-24 00:24:17] [INFO ] Flow matrix only has 3181 transitions (discarded 317 similar events)
// Phase 1: matrix 3181 rows 1477 cols
[2023-03-24 00:24:17] [INFO ] Computed 112 place invariants in 47 ms
[2023-03-24 00:24:18] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2023-03-24 00:24:18] [INFO ] Flow matrix only has 3181 transitions (discarded 317 similar events)
[2023-03-24 00:24:18] [INFO ] Invariant cache hit.
[2023-03-24 00:24:19] [INFO ] State equation strengthened by 1511 read => feed constraints.
[2023-03-24 00:24:43] [INFO ] Implicit Places using invariants and state equation in 25003 ms returned []
Implicit Place search using SMT with State Equation took 26019 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1477/2383 places, 3498/3917 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 28818 ms. Remains : 1477/2383 places, 3498/3917 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-24 00:24:44] [INFO ] Flow matrix only has 3181 transitions (discarded 317 similar events)
[2023-03-24 00:24:44] [INFO ] Invariant cache hit.
[2023-03-24 00:24:44] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-24 00:24:44] [INFO ] [Real]Absence check using 31 positive and 81 generalized place invariants in 46 ms returned sat
[2023-03-24 00:24:45] [INFO ] After 1526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 00:24:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-24 00:24:45] [INFO ] [Nat]Absence check using 31 positive and 81 generalized place invariants in 36 ms returned sat
[2023-03-24 00:24:48] [INFO ] After 2857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 00:24:48] [INFO ] State equation strengthened by 1511 read => feed constraints.
[2023-03-24 00:24:51] [INFO ] After 2513ms SMT Verify possible using 1511 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 00:24:52] [INFO ] Deduced a trap composed of 330 places in 785 ms of which 1 ms to minimize.
[2023-03-24 00:24:53] [INFO ] Deduced a trap composed of 445 places in 796 ms of which 2 ms to minimize.
[2023-03-24 00:24:54] [INFO ] Deduced a trap composed of 478 places in 778 ms of which 1 ms to minimize.
[2023-03-24 00:24:55] [INFO ] Deduced a trap composed of 302 places in 779 ms of which 2 ms to minimize.
[2023-03-24 00:24:56] [INFO ] Deduced a trap composed of 537 places in 762 ms of which 1 ms to minimize.
[2023-03-24 00:24:57] [INFO ] Deduced a trap composed of 425 places in 750 ms of which 2 ms to minimize.
[2023-03-24 00:24:58] [INFO ] Deduced a trap composed of 239 places in 808 ms of which 1 ms to minimize.
[2023-03-24 00:24:59] [INFO ] Deduced a trap composed of 245 places in 769 ms of which 2 ms to minimize.
[2023-03-24 00:25:00] [INFO ] Deduced a trap composed of 438 places in 804 ms of which 1 ms to minimize.
[2023-03-24 00:25:01] [INFO ] Deduced a trap composed of 249 places in 766 ms of which 2 ms to minimize.
[2023-03-24 00:25:02] [INFO ] Deduced a trap composed of 216 places in 753 ms of which 1 ms to minimize.
[2023-03-24 00:25:03] [INFO ] Deduced a trap composed of 218 places in 763 ms of which 1 ms to minimize.
[2023-03-24 00:25:05] [INFO ] Deduced a trap composed of 197 places in 774 ms of which 2 ms to minimize.
[2023-03-24 00:25:07] [INFO ] Deduced a trap composed of 243 places in 772 ms of which 1 ms to minimize.
[2023-03-24 00:25:08] [INFO ] Deduced a trap composed of 238 places in 775 ms of which 1 ms to minimize.
[2023-03-24 00:25:09] [INFO ] Deduced a trap composed of 476 places in 688 ms of which 2 ms to minimize.
[2023-03-24 00:25:10] [INFO ] Deduced a trap composed of 237 places in 784 ms of which 2 ms to minimize.
[2023-03-24 00:25:11] [INFO ] Deduced a trap composed of 225 places in 776 ms of which 2 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 00:25:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:25:11] [INFO ] After 25649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 6 ms.
Support contains 77 out of 1477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1477/1477 places, 3498/3498 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1477 transition count 3481
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 1460 transition count 3480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 1459 transition count 3480
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 36 place count 1459 transition count 3459
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 78 place count 1438 transition count 3459
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 114 place count 1402 transition count 3346
Iterating global reduction 3 with 36 rules applied. Total rules applied 150 place count 1402 transition count 3346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 150 place count 1402 transition count 3343
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 1399 transition count 3343
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 177 place count 1378 transition count 3175
Iterating global reduction 3 with 21 rules applied. Total rules applied 198 place count 1378 transition count 3175
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 212 place count 1371 transition count 3168
Free-agglomeration rule (complex) applied 59 times.
Iterating global reduction 3 with 59 rules applied. Total rules applied 271 place count 1371 transition count 3109
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 330 place count 1312 transition count 3109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 332 place count 1310 transition count 3107
Iterating global reduction 4 with 2 rules applied. Total rules applied 334 place count 1310 transition count 3107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 336 place count 1308 transition count 3091
Iterating global reduction 4 with 2 rules applied. Total rules applied 338 place count 1308 transition count 3091
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 366 place count 1308 transition count 3091
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 377 place count 1297 transition count 3080
Iterating global reduction 4 with 11 rules applied. Total rules applied 388 place count 1297 transition count 3080
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 399 place count 1286 transition count 2992
Iterating global reduction 4 with 11 rules applied. Total rules applied 410 place count 1286 transition count 2992
Applied a total of 410 rules in 428 ms. Remains 1286 /1477 variables (removed 191) and now considering 2992/3498 (removed 506) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 1286/1477 places, 2992/3498 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 00:25:12] [INFO ] Flow matrix only has 2619 transitions (discarded 373 similar events)
// Phase 1: matrix 2619 rows 1286 cols
[2023-03-24 00:25:12] [INFO ] Computed 112 place invariants in 33 ms
[2023-03-24 00:25:12] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-24 00:25:12] [INFO ] [Real]Absence check using 33 positive and 79 generalized place invariants in 16 ms returned sat
[2023-03-24 00:25:13] [INFO ] After 1060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 00:25:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-24 00:25:13] [INFO ] [Nat]Absence check using 33 positive and 79 generalized place invariants in 15 ms returned sat
[2023-03-24 00:25:15] [INFO ] After 1886ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 00:25:15] [INFO ] State equation strengthened by 1196 read => feed constraints.
[2023-03-24 00:25:17] [INFO ] After 1870ms SMT Verify possible using 1196 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 00:25:17] [INFO ] Deduced a trap composed of 374 places in 611 ms of which 1 ms to minimize.
[2023-03-24 00:25:18] [INFO ] Deduced a trap composed of 321 places in 670 ms of which 1 ms to minimize.
[2023-03-24 00:25:19] [INFO ] Deduced a trap composed of 189 places in 665 ms of which 1 ms to minimize.
[2023-03-24 00:25:20] [INFO ] Deduced a trap composed of 361 places in 668 ms of which 1 ms to minimize.
[2023-03-24 00:25:21] [INFO ] Deduced a trap composed of 353 places in 671 ms of which 1 ms to minimize.
[2023-03-24 00:25:21] [INFO ] Deduced a trap composed of 199 places in 637 ms of which 9 ms to minimize.
[2023-03-24 00:25:22] [INFO ] Deduced a trap composed of 467 places in 598 ms of which 1 ms to minimize.
[2023-03-24 00:25:23] [INFO ] Deduced a trap composed of 261 places in 627 ms of which 1 ms to minimize.
[2023-03-24 00:25:24] [INFO ] Deduced a trap composed of 241 places in 630 ms of which 1 ms to minimize.
[2023-03-24 00:25:25] [INFO ] Deduced a trap composed of 391 places in 671 ms of which 1 ms to minimize.
[2023-03-24 00:25:25] [INFO ] Deduced a trap composed of 300 places in 626 ms of which 2 ms to minimize.
[2023-03-24 00:25:26] [INFO ] Deduced a trap composed of 237 places in 614 ms of which 2 ms to minimize.
[2023-03-24 00:25:27] [INFO ] Deduced a trap composed of 388 places in 671 ms of which 1 ms to minimize.
[2023-03-24 00:25:28] [INFO ] Deduced a trap composed of 264 places in 673 ms of which 1 ms to minimize.
[2023-03-24 00:25:30] [INFO ] Deduced a trap composed of 307 places in 684 ms of which 1 ms to minimize.
[2023-03-24 00:25:31] [INFO ] Deduced a trap composed of 222 places in 692 ms of which 1 ms to minimize.
[2023-03-24 00:25:32] [INFO ] Deduced a trap composed of 199 places in 683 ms of which 1 ms to minimize.
[2023-03-24 00:25:33] [INFO ] Deduced a trap composed of 194 places in 638 ms of which 2 ms to minimize.
[2023-03-24 00:25:36] [INFO ] Deduced a trap composed of 192 places in 660 ms of which 2 ms to minimize.
[2023-03-24 00:25:37] [INFO ] Deduced a trap composed of 193 places in 673 ms of which 1 ms to minimize.
[2023-03-24 00:25:38] [INFO ] Deduced a trap composed of 242 places in 622 ms of which 2 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 00:25:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:25:38] [INFO ] After 25426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 5 ms.
Support contains 75 out of 1286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1286/1286 places, 2992/2992 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1285 transition count 2984
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1285 transition count 2984
Applied a total of 2 rules in 81 ms. Remains 1285 /1286 variables (removed 1) and now considering 2984/2992 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1285/1286 places, 2984/2992 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 64569 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64569 steps, saw 28693 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 00:25:41] [INFO ] Flow matrix only has 2611 transitions (discarded 373 similar events)
// Phase 1: matrix 2611 rows 1285 cols
[2023-03-24 00:25:41] [INFO ] Computed 112 place invariants in 38 ms
[2023-03-24 00:25:42] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-24 00:25:42] [INFO ] [Real]Absence check using 33 positive and 79 generalized place invariants in 26 ms returned sat
[2023-03-24 00:25:43] [INFO ] After 1060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 00:25:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-24 00:25:43] [INFO ] [Nat]Absence check using 33 positive and 79 generalized place invariants in 15 ms returned sat
[2023-03-24 00:25:44] [INFO ] After 1634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 00:25:44] [INFO ] State equation strengthened by 1189 read => feed constraints.
[2023-03-24 00:25:47] [INFO ] After 2719ms SMT Verify possible using 1189 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 00:25:48] [INFO ] Deduced a trap composed of 197 places in 652 ms of which 2 ms to minimize.
[2023-03-24 00:25:49] [INFO ] Deduced a trap composed of 438 places in 648 ms of which 1 ms to minimize.
[2023-03-24 00:25:50] [INFO ] Deduced a trap composed of 363 places in 642 ms of which 2 ms to minimize.
[2023-03-24 00:25:50] [INFO ] Deduced a trap composed of 300 places in 616 ms of which 2 ms to minimize.
[2023-03-24 00:25:51] [INFO ] Deduced a trap composed of 348 places in 611 ms of which 1 ms to minimize.
[2023-03-24 00:25:52] [INFO ] Deduced a trap composed of 170 places in 641 ms of which 1 ms to minimize.
[2023-03-24 00:25:53] [INFO ] Deduced a trap composed of 155 places in 624 ms of which 3 ms to minimize.
[2023-03-24 00:25:54] [INFO ] Deduced a trap composed of 144 places in 622 ms of which 2 ms to minimize.
[2023-03-24 00:25:55] [INFO ] Deduced a trap composed of 169 places in 648 ms of which 1 ms to minimize.
[2023-03-24 00:25:56] [INFO ] Deduced a trap composed of 167 places in 661 ms of which 1 ms to minimize.
[2023-03-24 00:25:57] [INFO ] Deduced a trap composed of 163 places in 646 ms of which 1 ms to minimize.
[2023-03-24 00:25:58] [INFO ] Deduced a trap composed of 198 places in 619 ms of which 1 ms to minimize.
[2023-03-24 00:25:59] [INFO ] Deduced a trap composed of 163 places in 645 ms of which 2 ms to minimize.
[2023-03-24 00:25:59] [INFO ] Deduced a trap composed of 211 places in 640 ms of which 2 ms to minimize.
[2023-03-24 00:26:00] [INFO ] Deduced a trap composed of 169 places in 638 ms of which 2 ms to minimize.
[2023-03-24 00:26:01] [INFO ] Deduced a trap composed of 177 places in 631 ms of which 1 ms to minimize.
[2023-03-24 00:26:02] [INFO ] Deduced a trap composed of 163 places in 661 ms of which 3 ms to minimize.
[2023-03-24 00:26:04] [INFO ] Deduced a trap composed of 345 places in 637 ms of which 1 ms to minimize.
[2023-03-24 00:26:05] [INFO ] Deduced a trap composed of 220 places in 646 ms of which 2 ms to minimize.
[2023-03-24 00:26:06] [INFO ] Deduced a trap composed of 248 places in 647 ms of which 2 ms to minimize.
[2023-03-24 00:26:07] [INFO ] Deduced a trap composed of 324 places in 586 ms of which 1 ms to minimize.
[2023-03-24 00:26:08] [INFO ] Deduced a trap composed of 174 places in 647 ms of which 1 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 00:26:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:26:08] [INFO ] After 25603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 11 ms.
Support contains 75 out of 1285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1285/1285 places, 2984/2984 transitions.
Applied a total of 0 rules in 54 ms. Remains 1285 /1285 variables (removed 0) and now considering 2984/2984 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1285/1285 places, 2984/2984 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1285/1285 places, 2984/2984 transitions.
Applied a total of 0 rules in 54 ms. Remains 1285 /1285 variables (removed 0) and now considering 2984/2984 (removed 0) transitions.
[2023-03-24 00:26:08] [INFO ] Flow matrix only has 2611 transitions (discarded 373 similar events)
[2023-03-24 00:26:08] [INFO ] Invariant cache hit.
[2023-03-24 00:26:09] [INFO ] Implicit Places using invariants in 1027 ms returned [8, 155, 220, 221, 268, 321, 397, 398, 424, 425, 473, 474, 493, 513, 528, 529, 542, 550, 566, 591, 602, 624, 637, 638, 659, 667, 673, 693, 694, 710, 711, 786, 850, 851, 934, 1037]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 1029 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1249/1285 places, 2984/2984 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1216 transition count 2951
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1216 transition count 2951
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 99 place count 1183 transition count 2918
Iterating global reduction 0 with 33 rules applied. Total rules applied 132 place count 1183 transition count 2918
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 144 place count 1171 transition count 2822
Iterating global reduction 0 with 12 rules applied. Total rules applied 156 place count 1171 transition count 2822
Applied a total of 156 rules in 131 ms. Remains 1171 /1249 variables (removed 78) and now considering 2822/2984 (removed 162) transitions.
[2023-03-24 00:26:09] [INFO ] Flow matrix only has 2449 transitions (discarded 373 similar events)
// Phase 1: matrix 2449 rows 1171 cols
[2023-03-24 00:26:09] [INFO ] Computed 76 place invariants in 31 ms
[2023-03-24 00:26:10] [INFO ] Implicit Places using invariants in 873 ms returned []
[2023-03-24 00:26:10] [INFO ] Flow matrix only has 2449 transitions (discarded 373 similar events)
[2023-03-24 00:26:10] [INFO ] Invariant cache hit.
[2023-03-24 00:26:11] [INFO ] State equation strengthened by 1105 read => feed constraints.
[2023-03-24 00:26:25] [INFO ] Implicit Places using invariants and state equation in 15076 ms returned []
Implicit Place search using SMT with State Equation took 15950 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1171/1285 places, 2822/2984 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17164 ms. Remains : 1171/1285 places, 2822/2984 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:26:25] [INFO ] Flow matrix only has 2449 transitions (discarded 373 similar events)
[2023-03-24 00:26:25] [INFO ] Invariant cache hit.
[2023-03-24 00:26:26] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-24 00:26:26] [INFO ] [Real]Absence check using 33 positive and 43 generalized place invariants in 9 ms returned sat
[2023-03-24 00:26:26] [INFO ] After 993ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:26:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-24 00:26:27] [INFO ] [Nat]Absence check using 33 positive and 43 generalized place invariants in 8 ms returned sat
[2023-03-24 00:26:27] [INFO ] After 741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:26:27] [INFO ] State equation strengthened by 1105 read => feed constraints.
[2023-03-24 00:26:28] [INFO ] After 536ms SMT Verify possible using 1105 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:26:29] [INFO ] Deduced a trap composed of 238 places in 492 ms of which 1 ms to minimize.
[2023-03-24 00:26:29] [INFO ] Deduced a trap composed of 155 places in 495 ms of which 1 ms to minimize.
[2023-03-24 00:26:30] [INFO ] Deduced a trap composed of 191 places in 517 ms of which 1 ms to minimize.
[2023-03-24 00:26:30] [INFO ] Deduced a trap composed of 168 places in 505 ms of which 1 ms to minimize.
[2023-03-24 00:26:31] [INFO ] Deduced a trap composed of 304 places in 522 ms of which 1 ms to minimize.
[2023-03-24 00:26:32] [INFO ] Deduced a trap composed of 153 places in 529 ms of which 1 ms to minimize.
[2023-03-24 00:26:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4483 ms
[2023-03-24 00:26:33] [INFO ] After 5091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-24 00:26:33] [INFO ] After 6105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1171/1171 places, 2822/2822 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1171 transition count 2811
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 1160 transition count 2811
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 22 place count 1160 transition count 2801
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 1150 transition count 2801
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 54 place count 1138 transition count 2782
Iterating global reduction 2 with 12 rules applied. Total rules applied 66 place count 1138 transition count 2782
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 66 place count 1138 transition count 2779
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 1135 transition count 2779
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 1125 transition count 2699
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 1125 transition count 2699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 1123 transition count 2697
Free-agglomeration rule (complex) applied 51 times.
Iterating global reduction 2 with 51 rules applied. Total rules applied 147 place count 1123 transition count 4298
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 198 place count 1072 transition count 4298
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 208 place count 1062 transition count 4288
Iterating global reduction 3 with 10 rules applied. Total rules applied 218 place count 1062 transition count 4288
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 220 place count 1062 transition count 4288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 221 place count 1061 transition count 4287
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 1061 transition count 4287
Applied a total of 222 rules in 433 ms. Remains 1061 /1171 variables (removed 110) and now considering 4287/2822 (removed -1465) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 1061/1171 places, 4287/2822 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 64017 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64017 steps, saw 27320 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:26:36] [INFO ] Flow matrix only has 3899 transitions (discarded 388 similar events)
// Phase 1: matrix 3899 rows 1061 cols
[2023-03-24 00:26:36] [INFO ] Computed 76 place invariants in 36 ms
[2023-03-24 00:26:36] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-24 00:26:36] [INFO ] [Real]Absence check using 33 positive and 43 generalized place invariants in 10 ms returned sat
[2023-03-24 00:26:37] [INFO ] After 1107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:26:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-24 00:26:38] [INFO ] [Nat]Absence check using 33 positive and 43 generalized place invariants in 8 ms returned sat
[2023-03-24 00:26:39] [INFO ] After 929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:26:39] [INFO ] State equation strengthened by 2680 read => feed constraints.
[2023-03-24 00:26:39] [INFO ] After 874ms SMT Verify possible using 2680 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:26:40] [INFO ] Deduced a trap composed of 186 places in 544 ms of which 1 ms to minimize.
[2023-03-24 00:26:41] [INFO ] Deduced a trap composed of 106 places in 655 ms of which 2 ms to minimize.
[2023-03-24 00:26:42] [INFO ] Deduced a trap composed of 93 places in 653 ms of which 2 ms to minimize.
[2023-03-24 00:26:43] [INFO ] Deduced a trap composed of 75 places in 620 ms of which 1 ms to minimize.
[2023-03-24 00:26:44] [INFO ] Deduced a trap composed of 107 places in 664 ms of which 1 ms to minimize.
[2023-03-24 00:26:45] [INFO ] Deduced a trap composed of 89 places in 640 ms of which 1 ms to minimize.
[2023-03-24 00:26:46] [INFO ] Deduced a trap composed of 87 places in 646 ms of which 1 ms to minimize.
[2023-03-24 00:26:47] [INFO ] Deduced a trap composed of 103 places in 653 ms of which 1 ms to minimize.
[2023-03-24 00:26:47] [INFO ] Deduced a trap composed of 91 places in 661 ms of which 1 ms to minimize.
[2023-03-24 00:26:48] [INFO ] Deduced a trap composed of 102 places in 653 ms of which 1 ms to minimize.
[2023-03-24 00:26:49] [INFO ] Deduced a trap composed of 95 places in 643 ms of which 1 ms to minimize.
[2023-03-24 00:26:50] [INFO ] Deduced a trap composed of 104 places in 634 ms of which 1 ms to minimize.
[2023-03-24 00:26:51] [INFO ] Deduced a trap composed of 170 places in 564 ms of which 11 ms to minimize.
[2023-03-24 00:26:52] [INFO ] Deduced a trap composed of 180 places in 546 ms of which 1 ms to minimize.
[2023-03-24 00:26:53] [INFO ] Deduced a trap composed of 88 places in 643 ms of which 1 ms to minimize.
[2023-03-24 00:26:53] [INFO ] Deduced a trap composed of 118 places in 661 ms of which 1 ms to minimize.
[2023-03-24 00:26:54] [INFO ] Deduced a trap composed of 104 places in 654 ms of which 1 ms to minimize.
[2023-03-24 00:26:55] [INFO ] Deduced a trap composed of 143 places in 645 ms of which 1 ms to minimize.
[2023-03-24 00:26:56] [INFO ] Deduced a trap composed of 113 places in 641 ms of which 1 ms to minimize.
[2023-03-24 00:26:56] [INFO ] Deduced a trap composed of 102 places in 655 ms of which 1 ms to minimize.
[2023-03-24 00:26:57] [INFO ] Deduced a trap composed of 103 places in 650 ms of which 1 ms to minimize.
[2023-03-24 00:26:58] [INFO ] Deduced a trap composed of 106 places in 630 ms of which 1 ms to minimize.
[2023-03-24 00:26:59] [INFO ] Deduced a trap composed of 173 places in 626 ms of which 1 ms to minimize.
[2023-03-24 00:27:00] [INFO ] Deduced a trap composed of 181 places in 516 ms of which 1 ms to minimize.
[2023-03-24 00:27:01] [INFO ] Deduced a trap composed of 192 places in 550 ms of which 1 ms to minimize.
[2023-03-24 00:27:01] [INFO ] Deduced a trap composed of 174 places in 539 ms of which 1 ms to minimize.
[2023-03-24 00:27:02] [INFO ] Deduced a trap composed of 168 places in 585 ms of which 1 ms to minimize.
[2023-03-24 00:27:02] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 23002 ms
[2023-03-24 00:27:02] [INFO ] After 23902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 00:27:02] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 4287/4287 transitions.
Applied a total of 0 rules in 102 ms. Remains 1061 /1061 variables (removed 0) and now considering 4287/4287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 1061/1061 places, 4287/4287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 4287/4287 transitions.
Applied a total of 0 rules in 102 ms. Remains 1061 /1061 variables (removed 0) and now considering 4287/4287 (removed 0) transitions.
[2023-03-24 00:27:03] [INFO ] Flow matrix only has 3899 transitions (discarded 388 similar events)
[2023-03-24 00:27:03] [INFO ] Invariant cache hit.
[2023-03-24 00:27:04] [INFO ] Implicit Places using invariants in 1365 ms returned [7, 16, 144, 229, 242, 243, 312, 319, 409, 418, 448, 474, 483, 484, 508, 523, 547, 621, 622, 673, 701, 769, 776, 870, 871, 936, 937]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 1369 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1034/1061 places, 4287/4287 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1013 transition count 4266
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1013 transition count 4266
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 63 place count 992 transition count 4245
Iterating global reduction 0 with 21 rules applied. Total rules applied 84 place count 992 transition count 4245
Applied a total of 84 rules in 159 ms. Remains 992 /1034 variables (removed 42) and now considering 4245/4287 (removed 42) transitions.
[2023-03-24 00:27:04] [INFO ] Flow matrix only has 3857 transitions (discarded 388 similar events)
// Phase 1: matrix 3857 rows 992 cols
[2023-03-24 00:27:04] [INFO ] Computed 49 place invariants in 27 ms
[2023-03-24 00:27:05] [INFO ] Implicit Places using invariants in 1161 ms returned []
[2023-03-24 00:27:05] [INFO ] Flow matrix only has 3857 transitions (discarded 388 similar events)
[2023-03-24 00:27:05] [INFO ] Invariant cache hit.
[2023-03-24 00:27:06] [INFO ] State equation strengthened by 2680 read => feed constraints.
[2023-03-24 00:27:27] [INFO ] Implicit Places using invariants and state equation in 21579 ms returned []
Implicit Place search using SMT with State Equation took 22740 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 992/1061 places, 4245/4287 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24371 ms. Remains : 992/1061 places, 4245/4287 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 66064 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66064 steps, saw 27956 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:27:30] [INFO ] Flow matrix only has 3857 transitions (discarded 388 similar events)
[2023-03-24 00:27:30] [INFO ] Invariant cache hit.
[2023-03-24 00:27:30] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-24 00:27:30] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-24 00:27:31] [INFO ] After 1047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:27:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2023-03-24 00:27:31] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-24 00:27:32] [INFO ] After 939ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:27:32] [INFO ] State equation strengthened by 2680 read => feed constraints.
[2023-03-24 00:27:33] [INFO ] After 1115ms SMT Verify possible using 2680 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:27:34] [INFO ] Deduced a trap composed of 145 places in 463 ms of which 1 ms to minimize.
[2023-03-24 00:27:35] [INFO ] Deduced a trap composed of 148 places in 463 ms of which 1 ms to minimize.
[2023-03-24 00:27:35] [INFO ] Deduced a trap composed of 157 places in 464 ms of which 1 ms to minimize.
[2023-03-24 00:27:36] [INFO ] Deduced a trap composed of 84 places in 550 ms of which 1 ms to minimize.
[2023-03-24 00:27:37] [INFO ] Deduced a trap composed of 78 places in 558 ms of which 1 ms to minimize.
[2023-03-24 00:27:37] [INFO ] Deduced a trap composed of 75 places in 562 ms of which 0 ms to minimize.
[2023-03-24 00:27:38] [INFO ] Deduced a trap composed of 84 places in 553 ms of which 0 ms to minimize.
[2023-03-24 00:27:39] [INFO ] Deduced a trap composed of 84 places in 558 ms of which 1 ms to minimize.
[2023-03-24 00:27:40] [INFO ] Deduced a trap composed of 76 places in 553 ms of which 1 ms to minimize.
[2023-03-24 00:27:41] [INFO ] Deduced a trap composed of 80 places in 547 ms of which 1 ms to minimize.
[2023-03-24 00:27:41] [INFO ] Deduced a trap composed of 80 places in 581 ms of which 2 ms to minimize.
[2023-03-24 00:27:42] [INFO ] Deduced a trap composed of 77 places in 550 ms of which 1 ms to minimize.
[2023-03-24 00:27:43] [INFO ] Deduced a trap composed of 73 places in 540 ms of which 1 ms to minimize.
[2023-03-24 00:27:44] [INFO ] Deduced a trap composed of 71 places in 552 ms of which 1 ms to minimize.
[2023-03-24 00:27:45] [INFO ] Deduced a trap composed of 81 places in 569 ms of which 1 ms to minimize.
[2023-03-24 00:27:45] [INFO ] Deduced a trap composed of 85 places in 554 ms of which 1 ms to minimize.
[2023-03-24 00:27:46] [INFO ] Deduced a trap composed of 88 places in 595 ms of which 1 ms to minimize.
[2023-03-24 00:27:47] [INFO ] Deduced a trap composed of 73 places in 584 ms of which 1 ms to minimize.
[2023-03-24 00:27:48] [INFO ] Deduced a trap composed of 82 places in 550 ms of which 1 ms to minimize.
[2023-03-24 00:27:48] [INFO ] Deduced a trap composed of 97 places in 578 ms of which 1 ms to minimize.
[2023-03-24 00:27:49] [INFO ] Deduced a trap composed of 90 places in 575 ms of which 1 ms to minimize.
[2023-03-24 00:27:50] [INFO ] Deduced a trap composed of 127 places in 574 ms of which 1 ms to minimize.
[2023-03-24 00:27:50] [INFO ] Deduced a trap composed of 165 places in 484 ms of which 1 ms to minimize.
[2023-03-24 00:27:51] [INFO ] Deduced a trap composed of 75 places in 560 ms of which 1 ms to minimize.
[2023-03-24 00:27:52] [INFO ] Deduced a trap composed of 74 places in 616 ms of which 1 ms to minimize.
[2023-03-24 00:27:53] [INFO ] Deduced a trap composed of 81 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:27:53] [INFO ] Deduced a trap composed of 85 places in 611 ms of which 1 ms to minimize.
[2023-03-24 00:27:54] [INFO ] Deduced a trap composed of 88 places in 644 ms of which 1 ms to minimize.
[2023-03-24 00:27:55] [INFO ] Deduced a trap composed of 83 places in 610 ms of which 1 ms to minimize.
[2023-03-24 00:27:56] [INFO ] Deduced a trap composed of 93 places in 633 ms of which 1 ms to minimize.
[2023-03-24 00:27:56] [INFO ] Deduced a trap composed of 181 places in 508 ms of which 1 ms to minimize.
[2023-03-24 00:27:56] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 22760 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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 00:27:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:27:56] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 4245/4245 transitions.
Applied a total of 0 rules in 103 ms. Remains 992 /992 variables (removed 0) and now considering 4245/4245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 992/992 places, 4245/4245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 4245/4245 transitions.
Applied a total of 0 rules in 104 ms. Remains 992 /992 variables (removed 0) and now considering 4245/4245 (removed 0) transitions.
[2023-03-24 00:27:56] [INFO ] Flow matrix only has 3857 transitions (discarded 388 similar events)
[2023-03-24 00:27:56] [INFO ] Invariant cache hit.
[2023-03-24 00:27:58] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2023-03-24 00:27:58] [INFO ] Flow matrix only has 3857 transitions (discarded 388 similar events)
[2023-03-24 00:27:58] [INFO ] Invariant cache hit.
[2023-03-24 00:27:59] [INFO ] State equation strengthened by 2680 read => feed constraints.
[2023-03-24 00:28:19] [INFO ] Implicit Places using invariants and state equation in 21644 ms returned []
Implicit Place search using SMT with State Equation took 22828 ms to find 0 implicit places.
[2023-03-24 00:28:20] [INFO ] Redundant transitions in 324 ms returned []
[2023-03-24 00:28:20] [INFO ] Flow matrix only has 3857 transitions (discarded 388 similar events)
[2023-03-24 00:28:20] [INFO ] Invariant cache hit.
[2023-03-24 00:28:21] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24744 ms. Remains : 992/992 places, 4245/4245 transitions.
[2023-03-24 00:28:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-24 00:28:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 992 places, 4245 transitions and 21100 arcs took 22 ms.
[2023-03-24 00:28:22] [INFO ] Flatten gal took : 312 ms
Total runtime 368989 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 --inv-bin-par --invariant=/tmp/995/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14009184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16087240 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 ReachabilityFireability -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-S16C08"
export BK_EXAMINATION="ReachabilityFireability"
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-S16C08, examination is ReachabilityFireability"
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-167856419400799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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