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.r229-tall-167856413800828.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S24C05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413800828
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 15K Feb 26 03:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K 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.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 26 03:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 03:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K 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 12M 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-S24C05-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679580116941

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 14:01:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 14:01:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 14:01:59] [INFO ] Load time of PNML (sax parser for PT used): 486 ms
[2023-03-23 14:01:59] [INFO ] Transformed 11106 places.
[2023-03-23 14:01:59] [INFO ] Transformed 16561 transitions.
[2023-03-23 14:01:59] [INFO ] Parsed PT model containing 11106 places and 16561 transitions and 65150 arcs in 634 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 11106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 11068 transition count 16561
Discarding 2987 places :
Symmetric choice reduction at 1 with 2987 rule applications. Total rules 3025 place count 8081 transition count 13574
Iterating global reduction 1 with 2987 rules applied. Total rules applied 6012 place count 8081 transition count 13574
Discarding 2738 places :
Symmetric choice reduction at 1 with 2738 rule applications. Total rules 8750 place count 5343 transition count 10836
Iterating global reduction 1 with 2738 rules applied. Total rules applied 11488 place count 5343 transition count 10836
Discarding 535 places :
Symmetric choice reduction at 1 with 535 rule applications. Total rules 12023 place count 4808 transition count 8161
Iterating global reduction 1 with 535 rules applied. Total rules applied 12558 place count 4808 transition count 8161
Applied a total of 12558 rules in 3675 ms. Remains 4808 /11106 variables (removed 6298) and now considering 8161/16561 (removed 8400) transitions.
[2023-03-23 14:02:03] [INFO ] Flow matrix only has 7561 transitions (discarded 600 similar events)
// Phase 1: matrix 7561 rows 4808 cols
[2023-03-23 14:02:03] [INFO ] Computed 937 place invariants in 352 ms
[2023-03-23 14:02:06] [INFO ] Implicit Places using invariants in 3843 ms returned []
[2023-03-23 14:02:07] [INFO ] Flow matrix only has 7561 transitions (discarded 600 similar events)
[2023-03-23 14:02:07] [INFO ] Invariant cache hit.
[2023-03-23 14:02:10] [INFO ] Implicit Places using invariants and state equation in 3436 ms returned []
Implicit Place search using SMT with State Equation took 7307 ms to find 0 implicit places.
[2023-03-23 14:02:10] [INFO ] Flow matrix only has 7561 transitions (discarded 600 similar events)
[2023-03-23 14:02:10] [INFO ] Invariant cache hit.
[2023-03-23 14:02:15] [INFO ] Dead Transitions using invariants and state equation in 4972 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4808/11106 places, 8161/16561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15961 ms. Remains : 4808/11106 places, 8161/16561 transitions.
Support contains 51 out of 4808 places after structural reductions.
[2023-03-23 14:02:16] [INFO ] Flatten gal took : 499 ms
[2023-03-23 14:02:16] [INFO ] Flatten gal took : 272 ms
[2023-03-23 14:02:17] [INFO ] Input system was already deterministic with 8161 transitions.
Support contains 49 out of 4808 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-23 14:02:17] [INFO ] Flow matrix only has 7561 transitions (discarded 600 similar events)
[2023-03-23 14:02:17] [INFO ] Invariant cache hit.
[2023-03-23 14:02:19] [INFO ] [Real]Absence check using 47 positive place invariants in 63 ms returned sat
[2023-03-23 14:02:20] [INFO ] [Real]Absence check using 47 positive and 890 generalized place invariants in 293 ms returned sat
[2023-03-23 14:02:30] [INFO ] After 9179ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:17
[2023-03-23 14:02:30] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2023-03-23 14:02:31] [INFO ] After 497ms SMT Verify possible using 2862 Read/Feed constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-23 14:02:31] [INFO ] After 13125ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-23 14:02:32] [INFO ] [Nat]Absence check using 47 positive place invariants in 55 ms returned sat
[2023-03-23 14:02:33] [INFO ] [Nat]Absence check using 47 positive and 890 generalized place invariants in 285 ms returned sat
[2023-03-23 14:02:42] [INFO ] After 8340ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2023-03-23 14:02:50] [INFO ] After 7687ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :7 sat :12
[2023-03-23 14:02:55] [INFO ] Deduced a trap composed of 752 places in 4686 ms of which 15 ms to minimize.
[2023-03-23 14:03:00] [INFO ] Deduced a trap composed of 882 places in 4345 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-23 14:03:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:03:00] [INFO ] After 29072ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:18
Fused 19 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 19 out of 4808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4808/4808 places, 8161/8161 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 8160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 8160
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 254 Pre rules applied. Total rules applied 2 place count 4807 transition count 7906
Deduced a syphon composed of 254 places in 5 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 2 with 508 rules applied. Total rules applied 510 place count 4553 transition count 7906
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 515 place count 4548 transition count 7889
Iterating global reduction 2 with 5 rules applied. Total rules applied 520 place count 4548 transition count 7889
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 522 place count 4546 transition count 7879
Iterating global reduction 2 with 2 rules applied. Total rules applied 524 place count 4546 transition count 7879
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 5 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 578 place count 4519 transition count 7852
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 579 place count 4518 transition count 7851
Iterating global reduction 2 with 1 rules applied. Total rules applied 580 place count 4518 transition count 7851
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 581 place count 4517 transition count 7846
Iterating global reduction 2 with 1 rules applied. Total rules applied 582 place count 4517 transition count 7846
Free-agglomeration rule (complex) applied 322 times.
Iterating global reduction 2 with 322 rules applied. Total rules applied 904 place count 4517 transition count 9644
Reduce places removed 322 places and 0 transitions.
Iterating post reduction 2 with 322 rules applied. Total rules applied 1226 place count 4195 transition count 9644
Partial Free-agglomeration rule applied 169 times.
Drop transitions removed 169 transitions
Iterating global reduction 3 with 169 rules applied. Total rules applied 1395 place count 4195 transition count 9644
Applied a total of 1395 rules in 4178 ms. Remains 4195 /4808 variables (removed 613) and now considering 9644/8161 (removed -1483) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4180 ms. Remains : 4195/4808 places, 9644/8161 transitions.
Incomplete random walk after 10000 steps, including 315 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 14:03:05] [INFO ] Flow matrix only has 8780 transitions (discarded 864 similar events)
// Phase 1: matrix 8780 rows 4195 cols
[2023-03-23 14:03:05] [INFO ] Computed 937 place invariants in 229 ms
[2023-03-23 14:03:06] [INFO ] [Real]Absence check using 49 positive place invariants in 59 ms returned sat
[2023-03-23 14:03:06] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 245 ms returned sat
[2023-03-23 14:03:12] [INFO ] After 6395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 14:03:12] [INFO ] [Nat]Absence check using 49 positive place invariants in 59 ms returned sat
[2023-03-23 14:03:12] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 250 ms returned sat
[2023-03-23 14:03:18] [INFO ] After 5316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 14:03:18] [INFO ] State equation strengthened by 4958 read => feed constraints.
[2023-03-23 14:03:32] [INFO ] After 13560ms SMT Verify possible using 4958 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 14:03:37] [INFO ] After 18425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 14:03:37] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 13 ms.
Support contains 9 out of 4195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4195/4195 places, 9644/9644 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4195 transition count 9642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4193 transition count 9642
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 4193 transition count 9639
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 4190 transition count 9639
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 4187 transition count 9636
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 4187 transition count 9636
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 4187 transition count 9633
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 4184 transition count 9633
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 4183 transition count 9632
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 48 place count 4183 transition count 9652
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 72 place count 4159 transition count 9652
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 4158 transition count 9651
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 4158 transition count 9651
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 4158 transition count 9651
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 4157 transition count 9650
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 4157 transition count 9650
Applied a total of 77 rules in 2537 ms. Remains 4157 /4195 variables (removed 38) and now considering 9650/9644 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2538 ms. Remains : 4157/4195 places, 9650/9644 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 14:03:40] [INFO ] Flow matrix only has 8764 transitions (discarded 886 similar events)
// Phase 1: matrix 8764 rows 4157 cols
[2023-03-23 14:03:40] [INFO ] Computed 937 place invariants in 257 ms
[2023-03-23 14:03:41] [INFO ] [Real]Absence check using 49 positive place invariants in 66 ms returned sat
[2023-03-23 14:03:41] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 244 ms returned sat
[2023-03-23 14:03:46] [INFO ] After 4647ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-23 14:03:46] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-23 14:03:48] [INFO ] After 1337ms SMT Verify possible using 5002 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 14:03:48] [INFO ] After 7234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 14:03:48] [INFO ] [Nat]Absence check using 49 positive place invariants in 60 ms returned sat
[2023-03-23 14:03:48] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 237 ms returned sat
[2023-03-23 14:03:53] [INFO ] After 4808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 14:04:05] [INFO ] After 11554ms SMT Verify possible using 5002 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 14:04:16] [INFO ] Deduced a trap composed of 427 places in 4442 ms of which 12 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-23 14:04:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:04:16] [INFO ] After 28166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 14 ms.
Support contains 7 out of 4157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4157/4157 places, 9650/9650 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4157 transition count 9649
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4156 transition count 9649
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4155 transition count 9648
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4155 transition count 9648
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 4155 transition count 9647
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4154 transition count 9647
Applied a total of 6 rules in 805 ms. Remains 4154 /4157 variables (removed 3) and now considering 9647/9650 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 805 ms. Remains : 4154/4157 places, 9647/9650 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2184 stabilizing places and 2960 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(!(!p0 U p1)))))'
Support contains 3 out of 4808 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4808/4808 places, 8161/8161 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4795 transition count 8136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4795 transition count 8136
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4785 transition count 8094
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4785 transition count 8094
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 4783 transition count 8084
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 4783 transition count 8084
Applied a total of 50 rules in 1461 ms. Remains 4783 /4808 variables (removed 25) and now considering 8084/8161 (removed 77) transitions.
[2023-03-23 14:04:18] [INFO ] Flow matrix only has 7484 transitions (discarded 600 similar events)
// Phase 1: matrix 7484 rows 4783 cols
[2023-03-23 14:04:19] [INFO ] Computed 937 place invariants in 186 ms
[2023-03-23 14:04:22] [INFO ] Implicit Places using invariants in 3711 ms returned []
[2023-03-23 14:04:22] [INFO ] Flow matrix only has 7484 transitions (discarded 600 similar events)
[2023-03-23 14:04:22] [INFO ] Invariant cache hit.
[2023-03-23 14:04:25] [INFO ] Implicit Places using invariants and state equation in 3367 ms returned []
Implicit Place search using SMT with State Equation took 7096 ms to find 0 implicit places.
[2023-03-23 14:04:25] [INFO ] Flow matrix only has 7484 transitions (discarded 600 similar events)
[2023-03-23 14:04:25] [INFO ] Invariant cache hit.
[2023-03-23 14:04:30] [INFO ] Dead Transitions using invariants and state equation in 4705 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4783/4808 places, 8084/8161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13272 ms. Remains : 4783/4808 places, 8084/8161 transitions.
Stuttering acceptance computed with spot in 326 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s2068 1) (LT s2117 1)), p1:(LT s2557 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-00 finished in 13776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (!p0&&G((!p1||(!p0&&X((!p0 U (!p2||G(!p0))))))))))))'
Support contains 8 out of 4808 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4808/4808 places, 8161/8161 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4795 transition count 8136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4795 transition count 8136
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4785 transition count 8098
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4785 transition count 8098
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 4782 transition count 8083
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 4782 transition count 8083
Applied a total of 52 rules in 1466 ms. Remains 4782 /4808 variables (removed 26) and now considering 8083/8161 (removed 78) transitions.
[2023-03-23 14:04:32] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
// Phase 1: matrix 7483 rows 4782 cols
[2023-03-23 14:04:32] [INFO ] Computed 937 place invariants in 172 ms
[2023-03-23 14:04:37] [INFO ] Implicit Places using invariants in 4873 ms returned []
[2023-03-23 14:04:37] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2023-03-23 14:04:37] [INFO ] Invariant cache hit.
[2023-03-23 14:04:40] [INFO ] Implicit Places using invariants and state equation in 3503 ms returned []
Implicit Place search using SMT with State Equation took 8378 ms to find 0 implicit places.
[2023-03-23 14:04:40] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2023-03-23 14:04:40] [INFO ] Invariant cache hit.
[2023-03-23 14:04:45] [INFO ] Dead Transitions using invariants and state equation in 4733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4782/4808 places, 8083/8161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14580 ms. Remains : 4782/4808 places, 8083/8161 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, p0, p0, p0, (OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={} source=5 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(AND (GEQ s2494 1) (GEQ s2578 1)), p1:(AND (GEQ s2 1) (GEQ s671 1) (GEQ s2225 1) (GEQ s2226 1)), p2:(AND (GEQ s2274 1) (GEQ s2286 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1936 reset in 1112 ms.
Product exploration explored 100000 steps with 1934 reset in 1044 ms.
Computed a total of 2158 stabilizing places and 2882 stable transitions
Computed a total of 2158 stabilizing places and 2882 stable transitions
Detected a total of 2158/4782 stabilizing places and 2882/8083 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 464 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 786 ms :[true, (AND p0 p1), (OR (AND p0 p2) (AND p0 p1)), (OR (AND p0 p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 14:04:50] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2023-03-23 14:04:50] [INFO ] Invariant cache hit.
[2023-03-23 14:04:50] [INFO ] [Real]Absence check using 47 positive place invariants in 60 ms returned sat
[2023-03-23 14:04:51] [INFO ] [Real]Absence check using 47 positive and 890 generalized place invariants in 290 ms returned sat
[2023-03-23 14:04:51] [INFO ] After 1075ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-23 14:04:51] [INFO ] [Nat]Absence check using 47 positive place invariants in 49 ms returned sat
[2023-03-23 14:04:52] [INFO ] [Nat]Absence check using 47 positive and 890 generalized place invariants in 281 ms returned sat
[2023-03-23 14:05:01] [INFO ] After 8995ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-23 14:05:01] [INFO ] State equation strengthened by 2810 read => feed constraints.
[2023-03-23 14:05:04] [INFO ] After 2862ms SMT Verify possible using 2810 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-23 14:05:09] [INFO ] Deduced a trap composed of 754 places in 4781 ms of which 7 ms to minimize.
[2023-03-23 14:05:14] [INFO ] Deduced a trap composed of 699 places in 4710 ms of which 11 ms to minimize.
[2023-03-23 14:05:21] [INFO ] Deduced a trap composed of 2 places in 5131 ms of which 4 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.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-23 14:05:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:05:21] [INFO ] After 30172ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 8 out of 4782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4782/4782 places, 8083/8083 transitions.
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 266 Pre rules applied. Total rules applied 0 place count 4782 transition count 7817
Deduced a syphon composed of 266 places in 6 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 0 with 532 rules applied. Total rules applied 532 place count 4516 transition count 7817
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 582 place count 4491 transition count 7792
Free-agglomeration rule (complex) applied 286 times.
Iterating global reduction 0 with 286 rules applied. Total rules applied 868 place count 4491 transition count 7506
Reduce places removed 286 places and 0 transitions.
Iterating post reduction 0 with 286 rules applied. Total rules applied 1154 place count 4205 transition count 7506
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 1202 place count 4205 transition count 7506
Applied a total of 1202 rules in 1865 ms. Remains 4205 /4782 variables (removed 577) and now considering 7506/8083 (removed 577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1868 ms. Remains : 4205/4782 places, 7506/8083 transitions.
Incomplete random walk after 10000 steps, including 275 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 25206 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25206 steps, saw 11694 distinct states, run finished after 3004 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 14:05:26] [INFO ] Flow matrix only has 6620 transitions (discarded 886 similar events)
// Phase 1: matrix 6620 rows 4205 cols
[2023-03-23 14:05:26] [INFO ] Computed 937 place invariants in 157 ms
[2023-03-23 14:05:27] [INFO ] [Real]Absence check using 49 positive place invariants in 68 ms returned sat
[2023-03-23 14:05:27] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 242 ms returned sat
[2023-03-23 14:05:32] [INFO ] After 5657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 14:05:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2023-03-23 14:05:33] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 252 ms returned sat
[2023-03-23 14:05:39] [INFO ] After 5880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 14:05:39] [INFO ] State equation strengthened by 2810 read => feed constraints.
[2023-03-23 14:05:43] [INFO ] After 4331ms SMT Verify possible using 2810 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 14:05:46] [INFO ] After 7441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2033 ms.
[2023-03-23 14:05:48] [INFO ] After 16358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 4205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4205/4205 places, 7506/7506 transitions.
Applied a total of 0 rules in 374 ms. Remains 4205 /4205 variables (removed 0) and now considering 7506/7506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 4205/4205 places, 7506/7506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4205/4205 places, 7506/7506 transitions.
Applied a total of 0 rules in 372 ms. Remains 4205 /4205 variables (removed 0) and now considering 7506/7506 (removed 0) transitions.
[2023-03-23 14:05:49] [INFO ] Flow matrix only has 6620 transitions (discarded 886 similar events)
[2023-03-23 14:05:49] [INFO ] Invariant cache hit.
[2023-03-23 14:05:54] [INFO ] Implicit Places using invariants in 4616 ms returned []
[2023-03-23 14:05:54] [INFO ] Flow matrix only has 6620 transitions (discarded 886 similar events)
[2023-03-23 14:05:54] [INFO ] Invariant cache hit.
[2023-03-23 14:05:58] [INFO ] Implicit Places using invariants and state equation in 4498 ms returned []
Implicit Place search using SMT with State Equation took 9131 ms to find 0 implicit places.
[2023-03-23 14:05:59] [INFO ] Redundant transitions in 830 ms returned []
[2023-03-23 14:05:59] [INFO ] Flow matrix only has 6620 transitions (discarded 886 similar events)
[2023-03-23 14:05:59] [INFO ] Invariant cache hit.
[2023-03-23 14:06:04] [INFO ] Dead Transitions using invariants and state equation in 4686 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15031 ms. Remains : 4205/4205 places, 7506/7506 transitions.
Graph (trivial) has 2654 edges and 4205 vertex of which 25 / 4205 are part of one of the 1 SCC in 4 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 11924 edges and 4181 vertex of which 4159 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 384 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3573.t3900 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 3774 transition count 5777
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3532 transition count 5296
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3291 transition count 4856
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3051 transition count 4458
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 2851 transition count 4098
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2653 transition count 3776
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2491 transition count 3488
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2331 transition count 3234
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2203 transition count 3010
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2077 transition count 2816
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 1979 transition count 2648
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 1883 transition count 2506
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 1811 transition count 2386
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1741 transition count 2288
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1691 transition count 2208
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1643 transition count 2146
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1611 transition count 2098
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1581 transition count 2064
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1563 transition count 2040
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1547 transition count 2026
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1539 transition count 2018
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1532 transition count 2016
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1530 transition count 2016
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 250 Pre rules applied. Total rules applied 6250 place count 1530 transition count 1766
Deduced a syphon composed of 250 places in 0 ms
Ensure Unique test removed 248 places
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 23 with 748 rules applied. Total rules applied 6998 place count 1032 transition count 1766
Discarding 264 places :
Symmetric choice reduction at 23 with 264 rule applications. Total rules 7262 place count 768 transition count 1502
Iterating global reduction 23 with 264 rules applied. Total rules applied 7526 place count 768 transition count 1502
Discarding 46 places :
Symmetric choice reduction at 23 with 46 rule applications. Total rules 7572 place count 722 transition count 1272
Iterating global reduction 23 with 46 rules applied. Total rules applied 7618 place count 722 transition count 1272
Discarding 527 places :
Symmetric choice reduction at 23 with 527 rule applications. Total rules 8145 place count 195 transition count 745
Iterating global reduction 23 with 527 rules applied. Total rules applied 8672 place count 195 transition count 745
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 23 with 527 rules applied. Total rules applied 9199 place count 195 transition count 218
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 24 with 48 rules applied. Total rules applied 9247 place count 171 transition count 194
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 24 with 8 rules applied. Total rules applied 9255 place count 171 transition count 186
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 24 with 8 rules applied. Total rules applied 9263 place count 163 transition count 186
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 9265 place count 163 transition count 186
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 25 with 3 rules applied. Total rules applied 9268 place count 163 transition count 186
Applied a total of 9268 rules in 3005 ms. Remains 163 /4205 variables (removed 4042) and now considering 186/7506 (removed 7320) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 163 cols
[2023-03-23 14:06:07] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-23 14:06:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 14:06:07] [INFO ] [Real]Absence check using 3 positive and 37 generalized place invariants in 7 ms returned sat
[2023-03-23 14:06:07] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-23 14:06:07] [INFO ] After 112ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-23 14:06:07] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-23 14:06:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 14:06:07] [INFO ] [Nat]Absence check using 3 positive and 37 generalized place invariants in 6 ms returned sat
[2023-03-23 14:06:07] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 14:06:07] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-23 14:06:07] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p1))), (G (NOT (OR (AND p0 p2) (AND p0 p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1)]
Property proved to be true thanks to knowledge :(G (NOT (OR (AND p0 p2) (AND p0 p1))))
Knowledge based reduction with 9 factoid took 319 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01 finished in 96870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 4 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4808/4808 places, 8161/8161 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4808 transition count 8158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4805 transition count 8158
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 259 Pre rules applied. Total rules applied 6 place count 4805 transition count 7899
Deduced a syphon composed of 259 places in 5 ms
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 2 with 518 rules applied. Total rules applied 524 place count 4546 transition count 7899
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 535 place count 4535 transition count 7876
Iterating global reduction 2 with 11 rules applied. Total rules applied 546 place count 4535 transition count 7876
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 546 place count 4535 transition count 7873
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 552 place count 4532 transition count 7873
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 560 place count 4524 transition count 7833
Iterating global reduction 2 with 8 rules applied. Total rules applied 568 place count 4524 transition count 7833
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 6 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 622 place count 4497 transition count 7806
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 625 place count 4494 transition count 7803
Iterating global reduction 2 with 3 rules applied. Total rules applied 628 place count 4494 transition count 7803
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 628 place count 4494 transition count 7800
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 634 place count 4491 transition count 7800
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 637 place count 4488 transition count 7785
Iterating global reduction 2 with 3 rules applied. Total rules applied 640 place count 4488 transition count 7785
Applied a total of 640 rules in 2817 ms. Remains 4488 /4808 variables (removed 320) and now considering 7785/8161 (removed 376) transitions.
[2023-03-23 14:06:10] [INFO ] Flow matrix only has 7185 transitions (discarded 600 similar events)
// Phase 1: matrix 7185 rows 4488 cols
[2023-03-23 14:06:10] [INFO ] Computed 937 place invariants in 227 ms
[2023-03-23 14:06:16] [INFO ] Implicit Places using invariants in 5284 ms returned []
[2023-03-23 14:06:16] [INFO ] Flow matrix only has 7185 transitions (discarded 600 similar events)
[2023-03-23 14:06:16] [INFO ] Invariant cache hit.
[2023-03-23 14:06:19] [INFO ] Implicit Places using invariants and state equation in 3557 ms returned []
Implicit Place search using SMT with State Equation took 8864 ms to find 0 implicit places.
[2023-03-23 14:06:20] [INFO ] Redundant transitions in 844 ms returned []
[2023-03-23 14:06:20] [INFO ] Flow matrix only has 7185 transitions (discarded 600 similar events)
[2023-03-23 14:06:20] [INFO ] Invariant cache hit.
[2023-03-23 14:06:25] [INFO ] Dead Transitions using invariants and state equation in 4576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4488/4808 places, 7785/8161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17113 ms. Remains : 4488/4808 places, 7785/8161 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (LT s2150 1) (LT s2272 1)), p0:(AND (GEQ s2580 1) (GEQ s2611 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-05 finished in 17268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4808/4808 places, 8161/8161 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4808 transition count 8158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4805 transition count 8158
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 260 Pre rules applied. Total rules applied 6 place count 4805 transition count 7898
Deduced a syphon composed of 260 places in 5 ms
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 2 with 520 rules applied. Total rules applied 526 place count 4545 transition count 7898
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 537 place count 4534 transition count 7879
Iterating global reduction 2 with 11 rules applied. Total rules applied 548 place count 4534 transition count 7879
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 548 place count 4534 transition count 7875
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 556 place count 4530 transition count 7875
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 565 place count 4521 transition count 7830
Iterating global reduction 2 with 9 rules applied. Total rules applied 574 place count 4521 transition count 7830
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 630 place count 4493 transition count 7802
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 633 place count 4490 transition count 7799
Iterating global reduction 2 with 3 rules applied. Total rules applied 636 place count 4490 transition count 7799
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 636 place count 4490 transition count 7796
Deduced a syphon composed of 3 places in 12 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 642 place count 4487 transition count 7796
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 645 place count 4484 transition count 7781
Iterating global reduction 2 with 3 rules applied. Total rules applied 648 place count 4484 transition count 7781
Applied a total of 648 rules in 2552 ms. Remains 4484 /4808 variables (removed 324) and now considering 7781/8161 (removed 380) transitions.
[2023-03-23 14:06:27] [INFO ] Flow matrix only has 7181 transitions (discarded 600 similar events)
// Phase 1: matrix 7181 rows 4484 cols
[2023-03-23 14:06:27] [INFO ] Computed 937 place invariants in 199 ms
[2023-03-23 14:06:31] [INFO ] Implicit Places using invariants in 3732 ms returned []
[2023-03-23 14:06:31] [INFO ] Flow matrix only has 7181 transitions (discarded 600 similar events)
[2023-03-23 14:06:31] [INFO ] Invariant cache hit.
[2023-03-23 14:06:36] [INFO ] Implicit Places using invariants and state equation in 4851 ms returned []
Implicit Place search using SMT with State Equation took 8584 ms to find 0 implicit places.
[2023-03-23 14:06:36] [INFO ] Redundant transitions in 619 ms returned []
[2023-03-23 14:06:36] [INFO ] Flow matrix only has 7181 transitions (discarded 600 similar events)
[2023-03-23 14:06:36] [INFO ] Invariant cache hit.
[2023-03-23 14:06:41] [INFO ] Dead Transitions using invariants and state equation in 4946 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4484/4808 places, 7781/8161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16733 ms. Remains : 4484/4808 places, 7781/8161 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3627 1) (GEQ s4240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09 finished in 16839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4808/4808 places, 8161/8161 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4808 transition count 8158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4805 transition count 8158
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 260 Pre rules applied. Total rules applied 6 place count 4805 transition count 7898
Deduced a syphon composed of 260 places in 5 ms
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 2 with 520 rules applied. Total rules applied 526 place count 4545 transition count 7898
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 538 place count 4533 transition count 7874
Iterating global reduction 2 with 12 rules applied. Total rules applied 550 place count 4533 transition count 7874
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 550 place count 4533 transition count 7870
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 558 place count 4529 transition count 7870
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 567 place count 4520 transition count 7825
Iterating global reduction 2 with 9 rules applied. Total rules applied 576 place count 4520 transition count 7825
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 632 place count 4492 transition count 7797
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 635 place count 4489 transition count 7794
Iterating global reduction 2 with 3 rules applied. Total rules applied 638 place count 4489 transition count 7794
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 638 place count 4489 transition count 7791
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 644 place count 4486 transition count 7791
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 647 place count 4483 transition count 7776
Iterating global reduction 2 with 3 rules applied. Total rules applied 650 place count 4483 transition count 7776
Applied a total of 650 rules in 2452 ms. Remains 4483 /4808 variables (removed 325) and now considering 7776/8161 (removed 385) transitions.
[2023-03-23 14:06:44] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
// Phase 1: matrix 7176 rows 4483 cols
[2023-03-23 14:06:44] [INFO ] Computed 937 place invariants in 179 ms
[2023-03-23 14:06:49] [INFO ] Implicit Places using invariants in 4520 ms returned []
[2023-03-23 14:06:49] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
[2023-03-23 14:06:49] [INFO ] Invariant cache hit.
[2023-03-23 14:06:52] [INFO ] Implicit Places using invariants and state equation in 3308 ms returned []
Implicit Place search using SMT with State Equation took 7834 ms to find 0 implicit places.
[2023-03-23 14:06:53] [INFO ] Redundant transitions in 855 ms returned []
[2023-03-23 14:06:53] [INFO ] Flow matrix only has 7176 transitions (discarded 600 similar events)
[2023-03-23 14:06:53] [INFO ] Invariant cache hit.
[2023-03-23 14:06:57] [INFO ] Dead Transitions using invariants and state equation in 4526 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4483/4808 places, 7776/8161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15675 ms. Remains : 4483/4808 places, 7776/8161 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2306 1) (GEQ s3402 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12 finished in 15763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4808/4808 places, 8161/8161 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4808 transition count 8158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4805 transition count 8158
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 259 Pre rules applied. Total rules applied 6 place count 4805 transition count 7899
Deduced a syphon composed of 259 places in 5 ms
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 2 with 518 rules applied. Total rules applied 524 place count 4546 transition count 7899
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 535 place count 4535 transition count 7876
Iterating global reduction 2 with 11 rules applied. Total rules applied 546 place count 4535 transition count 7876
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 546 place count 4535 transition count 7873
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 552 place count 4532 transition count 7873
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 560 place count 4524 transition count 7833
Iterating global reduction 2 with 8 rules applied. Total rules applied 568 place count 4524 transition count 7833
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 624 place count 4496 transition count 7805
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 627 place count 4493 transition count 7802
Iterating global reduction 2 with 3 rules applied. Total rules applied 630 place count 4493 transition count 7802
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 630 place count 4493 transition count 7799
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 636 place count 4490 transition count 7799
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 639 place count 4487 transition count 7784
Iterating global reduction 2 with 3 rules applied. Total rules applied 642 place count 4487 transition count 7784
Applied a total of 642 rules in 2405 ms. Remains 4487 /4808 variables (removed 321) and now considering 7784/8161 (removed 377) transitions.
[2023-03-23 14:07:00] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
// Phase 1: matrix 7184 rows 4487 cols
[2023-03-23 14:07:00] [INFO ] Computed 937 place invariants in 185 ms
[2023-03-23 14:07:03] [INFO ] Implicit Places using invariants in 3603 ms returned []
[2023-03-23 14:07:03] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2023-03-23 14:07:03] [INFO ] Invariant cache hit.
[2023-03-23 14:07:07] [INFO ] Implicit Places using invariants and state equation in 3409 ms returned []
Implicit Place search using SMT with State Equation took 7017 ms to find 0 implicit places.
[2023-03-23 14:07:08] [INFO ] Redundant transitions in 835 ms returned []
[2023-03-23 14:07:08] [INFO ] Flow matrix only has 7184 transitions (discarded 600 similar events)
[2023-03-23 14:07:08] [INFO ] Invariant cache hit.
[2023-03-23 14:07:12] [INFO ] Dead Transitions using invariants and state equation in 4724 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4487/4808 places, 7784/8161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15000 ms. Remains : 4487/4808 places, 7784/8161 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2572 1) (GEQ s2610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13 finished in 15134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!p0 U G(p1)) U G(p2))||F(p1)))'
Support contains 4 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4808/4808 places, 8161/8161 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4808 transition count 8158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4805 transition count 8158
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 6 place count 4805 transition count 7900
Deduced a syphon composed of 258 places in 5 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 522 place count 4547 transition count 7900
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 532 place count 4537 transition count 7878
Iterating global reduction 2 with 10 rules applied. Total rules applied 542 place count 4537 transition count 7878
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 542 place count 4537 transition count 7875
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 548 place count 4534 transition count 7875
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 555 place count 4527 transition count 7840
Iterating global reduction 2 with 7 rules applied. Total rules applied 562 place count 4527 transition count 7840
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 618 place count 4499 transition count 7812
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 621 place count 4496 transition count 7809
Iterating global reduction 2 with 3 rules applied. Total rules applied 624 place count 4496 transition count 7809
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 624 place count 4496 transition count 7807
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 628 place count 4494 transition count 7807
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 631 place count 4491 transition count 7792
Iterating global reduction 2 with 3 rules applied. Total rules applied 634 place count 4491 transition count 7792
Applied a total of 634 rules in 2413 ms. Remains 4491 /4808 variables (removed 317) and now considering 7792/8161 (removed 369) transitions.
[2023-03-23 14:07:15] [INFO ] Flow matrix only has 7192 transitions (discarded 600 similar events)
// Phase 1: matrix 7192 rows 4491 cols
[2023-03-23 14:07:15] [INFO ] Computed 937 place invariants in 187 ms
[2023-03-23 14:07:18] [INFO ] Implicit Places using invariants in 3616 ms returned []
[2023-03-23 14:07:18] [INFO ] Flow matrix only has 7192 transitions (discarded 600 similar events)
[2023-03-23 14:07:18] [INFO ] Invariant cache hit.
[2023-03-23 14:07:22] [INFO ] Implicit Places using invariants and state equation in 3524 ms returned []
Implicit Place search using SMT with State Equation took 7144 ms to find 0 implicit places.
[2023-03-23 14:07:23] [INFO ] Redundant transitions in 843 ms returned []
[2023-03-23 14:07:23] [INFO ] Flow matrix only has 7192 transitions (discarded 600 similar events)
[2023-03-23 14:07:23] [INFO ] Invariant cache hit.
[2023-03-23 14:07:27] [INFO ] Dead Transitions using invariants and state equation in 4532 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4491/4808 places, 7792/8161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14941 ms. Remains : 4491/4808 places, 7792/8161 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s4182 1) (GEQ s4213 1)), p2:(AND (GEQ s2521 1) (GEQ s2605 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-15 finished in 15057 ms.
All properties solved by simple procedures.
Total runtime 329504 ms.

BK_STOP 1679580455336

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-167856413800828"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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