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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679132924246

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:48:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 09:48:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:48:48] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2023-03-18 09:48:48] [INFO ] Transformed 480 places.
[2023-03-18 09:48:48] [INFO ] Transformed 690 transitions.
[2023-03-18 09:48:48] [INFO ] Found NUPN structural information;
[2023-03-18 09:48:48] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-18 09:48:48] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 72 ms.
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 42 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 09:48:49] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 09:48:49] [INFO ] Computed 19 place invariants in 43 ms
[2023-03-18 09:48:49] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-18 09:48:49] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 09:48:49] [INFO ] Invariant cache hit.
[2023-03-18 09:48:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:48:50] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
[2023-03-18 09:48:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 09:48:50] [INFO ] Invariant cache hit.
[2023-03-18 09:48:51] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2442 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 480 out of 480 places after structural reductions.
[2023-03-18 09:48:52] [INFO ] Flatten gal took : 204 ms
[2023-03-18 09:48:52] [INFO ] Flatten gal took : 83 ms
[2023-03-18 09:48:52] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1062 ms. (steps per millisecond=9 ) properties (out of 85) seen :50
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2023-03-18 09:48:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 09:48:54] [INFO ] Invariant cache hit.
[2023-03-18 09:48:55] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-18 09:48:55] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-18 09:48:56] [INFO ] After 1190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-18 09:48:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-18 09:48:56] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:48:59] [INFO ] After 2252ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :26
[2023-03-18 09:48:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:49:01] [INFO ] After 2076ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :3 sat :26
[2023-03-18 09:49:02] [INFO ] Deduced a trap composed of 57 places in 571 ms of which 10 ms to minimize.
[2023-03-18 09:49:02] [INFO ] Deduced a trap composed of 21 places in 577 ms of which 2 ms to minimize.
[2023-03-18 09:49:03] [INFO ] Deduced a trap composed of 74 places in 424 ms of which 2 ms to minimize.
[2023-03-18 09:49:03] [INFO ] Deduced a trap composed of 58 places in 553 ms of which 5 ms to minimize.
[2023-03-18 09:49:04] [INFO ] Deduced a trap composed of 77 places in 530 ms of which 3 ms to minimize.
[2023-03-18 09:49:04] [INFO ] Deduced a trap composed of 58 places in 556 ms of which 1 ms to minimize.
[2023-03-18 09:49:05] [INFO ] Deduced a trap composed of 58 places in 569 ms of which 1 ms to minimize.
[2023-03-18 09:49:06] [INFO ] Deduced a trap composed of 10 places in 392 ms of which 2 ms to minimize.
[2023-03-18 09:49:06] [INFO ] Deduced a trap composed of 42 places in 362 ms of which 2 ms to minimize.
[2023-03-18 09:49:06] [INFO ] Deduced a trap composed of 14 places in 400 ms of which 1 ms to minimize.
[2023-03-18 09:49:07] [INFO ] Deduced a trap composed of 80 places in 319 ms of which 1 ms to minimize.
[2023-03-18 09:49:07] [INFO ] Deduced a trap composed of 80 places in 306 ms of which 4 ms to minimize.
[2023-03-18 09:49:08] [INFO ] Deduced a trap composed of 80 places in 293 ms of which 1 ms to minimize.
[2023-03-18 09:49:08] [INFO ] Deduced a trap composed of 79 places in 297 ms of which 1 ms to minimize.
[2023-03-18 09:49:08] [INFO ] Deduced a trap composed of 89 places in 229 ms of which 2 ms to minimize.
[2023-03-18 09:49:09] [INFO ] Deduced a trap composed of 67 places in 399 ms of which 1 ms to minimize.
[2023-03-18 09:49:09] [INFO ] Deduced a trap composed of 43 places in 347 ms of which 1 ms to minimize.
[2023-03-18 09:49:09] [INFO ] Deduced a trap composed of 27 places in 314 ms of which 1 ms to minimize.
[2023-03-18 09:49:09] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8479 ms
[2023-03-18 09:49:10] [INFO ] Deduced a trap composed of 27 places in 392 ms of which 1 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 1 ms to minimize.
[2023-03-18 09:49:11] [INFO ] Deduced a trap composed of 27 places in 423 ms of which 1 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 117 places in 352 ms of which 2 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Deduced a trap composed of 36 places in 330 ms of which 1 ms to minimize.
[2023-03-18 09:49:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2291 ms
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 32 places in 463 ms of which 1 ms to minimize.
[2023-03-18 09:49:13] [INFO ] Deduced a trap composed of 43 places in 446 ms of which 1 ms to minimize.
[2023-03-18 09:49:14] [INFO ] Deduced a trap composed of 10 places in 475 ms of which 1 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 13 places in 442 ms of which 1 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 10 places in 465 ms of which 1 ms to minimize.
[2023-03-18 09:49:16] [INFO ] Deduced a trap composed of 42 places in 400 ms of which 1 ms to minimize.
[2023-03-18 09:49:16] [INFO ] Deduced a trap composed of 112 places in 384 ms of which 1 ms to minimize.
[2023-03-18 09:49:17] [INFO ] Deduced a trap composed of 10 places in 445 ms of which 1 ms to minimize.
[2023-03-18 09:49:17] [INFO ] Deduced a trap composed of 30 places in 330 ms of which 1 ms to minimize.
[2023-03-18 09:49:17] [INFO ] Deduced a trap composed of 32 places in 408 ms of which 1 ms to minimize.
[2023-03-18 09:49:18] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 2 ms to minimize.
[2023-03-18 09:49:18] [INFO ] Deduced a trap composed of 80 places in 300 ms of which 9 ms to minimize.
[2023-03-18 09:49:19] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 1 ms to minimize.
[2023-03-18 09:49:19] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 1 ms to minimize.
[2023-03-18 09:49:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6595 ms
[2023-03-18 09:49:19] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 1 ms to minimize.
[2023-03-18 09:49:20] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 0 ms to minimize.
[2023-03-18 09:49:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2023-03-18 09:49:20] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 2 ms to minimize.
[2023-03-18 09:49:21] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 09:49:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 09:49:21] [INFO ] After 25218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:29
Fused 29 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 243 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 480 transition count 674
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 464 transition count 674
Applied a total of 32 rules in 86 ms. Remains 464 /480 variables (removed 16) and now considering 674/690 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 464/480 places, 674/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-18 09:49:22] [INFO ] Flow matrix only has 614 transitions (discarded 60 similar events)
// Phase 1: matrix 614 rows 464 cols
[2023-03-18 09:49:22] [INFO ] Computed 19 place invariants in 7 ms
[2023-03-18 09:49:22] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-18 09:49:22] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-18 09:49:22] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-18 09:49:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-18 09:49:23] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:49:25] [INFO ] After 1958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-18 09:49:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:49:27] [INFO ] After 1791ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-18 09:49:27] [INFO ] Deduced a trap composed of 10 places in 427 ms of which 2 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 37 places in 414 ms of which 1 ms to minimize.
[2023-03-18 09:49:28] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2023-03-18 09:49:29] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 1 ms to minimize.
[2023-03-18 09:49:29] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2023-03-18 09:49:30] [INFO ] Deduced a trap composed of 77 places in 380 ms of which 1 ms to minimize.
[2023-03-18 09:49:30] [INFO ] Deduced a trap composed of 52 places in 426 ms of which 1 ms to minimize.
[2023-03-18 09:49:30] [INFO ] Deduced a trap composed of 52 places in 388 ms of which 1 ms to minimize.
[2023-03-18 09:49:31] [INFO ] Deduced a trap composed of 10 places in 329 ms of which 1 ms to minimize.
[2023-03-18 09:49:31] [INFO ] Deduced a trap composed of 16 places in 388 ms of which 3 ms to minimize.
[2023-03-18 09:49:32] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 1 ms to minimize.
[2023-03-18 09:49:32] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 1 ms to minimize.
[2023-03-18 09:49:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5110 ms
[2023-03-18 09:49:33] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 0 ms to minimize.
[2023-03-18 09:49:33] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 0 ms to minimize.
[2023-03-18 09:49:33] [INFO ] Deduced a trap composed of 76 places in 240 ms of which 3 ms to minimize.
[2023-03-18 09:49:33] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 1 ms to minimize.
[2023-03-18 09:49:34] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 1 ms to minimize.
[2023-03-18 09:49:34] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 0 ms to minimize.
[2023-03-18 09:49:34] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 0 ms to minimize.
[2023-03-18 09:49:34] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 1 ms to minimize.
[2023-03-18 09:49:35] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 1 ms to minimize.
[2023-03-18 09:49:35] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2023-03-18 09:49:35] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 1 ms to minimize.
[2023-03-18 09:49:35] [INFO ] Deduced a trap composed of 56 places in 209 ms of which 4 ms to minimize.
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 82 places in 311 ms of which 1 ms to minimize.
[2023-03-18 09:49:36] [INFO ] Deduced a trap composed of 82 places in 365 ms of which 1 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 35 places in 353 ms of which 3 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 60 places in 306 ms of which 5 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 58 places in 306 ms of which 1 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 92 places in 287 ms of which 1 ms to minimize.
[2023-03-18 09:49:38] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5475 ms
[2023-03-18 09:49:38] [INFO ] Deduced a trap composed of 99 places in 310 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 1 ms to minimize.
[2023-03-18 09:49:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1020 ms
[2023-03-18 09:49:40] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 1 ms to minimize.
[2023-03-18 09:49:40] [INFO ] Deduced a trap composed of 124 places in 342 ms of which 1 ms to minimize.
[2023-03-18 09:49:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 850 ms
[2023-03-18 09:49:41] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 1 ms to minimize.
[2023-03-18 09:49:41] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 1 ms to minimize.
[2023-03-18 09:49:41] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 1 ms to minimize.
[2023-03-18 09:49:42] [INFO ] Deduced a trap composed of 88 places in 264 ms of which 1 ms to minimize.
[2023-03-18 09:49:42] [INFO ] Deduced a trap composed of 56 places in 266 ms of which 1 ms to minimize.
[2023-03-18 09:49:42] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 1 ms to minimize.
[2023-03-18 09:49:43] [INFO ] Deduced a trap composed of 20 places in 295 ms of which 1 ms to minimize.
[2023-03-18 09:49:43] [INFO ] Deduced a trap composed of 45 places in 314 ms of which 1 ms to minimize.
[2023-03-18 09:49:43] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 1 ms to minimize.
[2023-03-18 09:49:44] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 1 ms to minimize.
[2023-03-18 09:49:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3598 ms
[2023-03-18 09:49:44] [INFO ] Deduced a trap composed of 33 places in 379 ms of which 1 ms to minimize.
[2023-03-18 09:49:45] [INFO ] Deduced a trap composed of 14 places in 355 ms of which 1 ms to minimize.
[2023-03-18 09:49:45] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 1 ms to minimize.
[2023-03-18 09:49:46] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 1 ms to minimize.
[2023-03-18 09:49:46] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 1 ms to minimize.
[2023-03-18 09:49:46] [INFO ] Deduced a trap composed of 81 places in 291 ms of which 1 ms to minimize.
[2023-03-18 09:49:47] [INFO ] Deduced a trap composed of 48 places in 355 ms of which 0 ms to minimize.
[2023-03-18 09:49:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2781 ms
[2023-03-18 09:49:47] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 1 ms to minimize.
[2023-03-18 09:49:48] [INFO ] Deduced a trap composed of 64 places in 353 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 09:49:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 09:49:48] [INFO ] After 25321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Parikh walk visited 5 properties in 340 ms.
Support contains 134 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 674/674 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 464 transition count 587
Reduce places removed 87 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 88 rules applied. Total rules applied 175 place count 377 transition count 586
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 376 transition count 586
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 176 place count 376 transition count 502
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 344 place count 292 transition count 502
Applied a total of 344 rules in 54 ms. Remains 292 /464 variables (removed 172) and now considering 502/674 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 292/464 places, 502/674 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-18 09:49:49] [INFO ] Flow matrix only has 442 transitions (discarded 60 similar events)
// Phase 1: matrix 442 rows 292 cols
[2023-03-18 09:49:49] [INFO ] Computed 19 place invariants in 7 ms
[2023-03-18 09:49:49] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 09:49:49] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:49:49] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-18 09:49:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 09:49:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:49:50] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-18 09:49:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:49:51] [INFO ] After 617ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-18 09:49:51] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-18 09:49:51] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 1 ms to minimize.
[2023-03-18 09:49:51] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-18 09:49:51] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-18 09:49:52] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-18 09:49:52] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-18 09:49:52] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-18 09:49:52] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 0 ms to minimize.
[2023-03-18 09:49:52] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 0 ms to minimize.
[2023-03-18 09:49:52] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 0 ms to minimize.
[2023-03-18 09:49:53] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 1 ms to minimize.
[2023-03-18 09:49:53] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2023-03-18 09:49:53] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2023-03-18 09:49:53] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2023-03-18 09:49:53] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2023-03-18 09:49:53] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2023-03-18 09:49:53] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2023-03-18 09:49:53] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2023-03-18 09:49:54] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2023-03-18 09:49:54] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2023-03-18 09:49:54] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2023-03-18 09:49:54] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2023-03-18 09:49:54] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-18 09:49:54] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 0 ms to minimize.
[2023-03-18 09:49:54] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 1 ms to minimize.
[2023-03-18 09:49:55] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2023-03-18 09:49:55] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2023-03-18 09:49:55] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2023-03-18 09:49:55] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2023-03-18 09:49:55] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2023-03-18 09:49:55] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-18 09:49:55] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
[2023-03-18 09:49:55] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-03-18 09:49:56] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-18 09:49:56] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2023-03-18 09:49:56] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2023-03-18 09:49:56] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2023-03-18 09:49:56] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 0 ms to minimize.
[2023-03-18 09:49:56] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2023-03-18 09:49:57] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2023-03-18 09:49:57] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2023-03-18 09:49:57] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2023-03-18 09:49:57] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2023-03-18 09:49:57] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 0 ms to minimize.
[2023-03-18 09:49:57] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2023-03-18 09:49:58] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2023-03-18 09:49:58] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 6755 ms
[2023-03-18 09:49:58] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-18 09:49:58] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-18 09:49:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-03-18 09:49:58] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-18 09:49:58] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2023-03-18 09:49:58] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2023-03-18 09:49:59] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2023-03-18 09:49:59] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2023-03-18 09:49:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 749 ms
[2023-03-18 09:49:59] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2023-03-18 09:49:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-18 09:49:59] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2023-03-18 09:49:59] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2023-03-18 09:49:59] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2023-03-18 09:50:00] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2023-03-18 09:50:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 460 ms
[2023-03-18 09:50:00] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 0 ms to minimize.
[2023-03-18 09:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-18 09:50:00] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2023-03-18 09:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-18 09:50:00] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 0 ms to minimize.
[2023-03-18 09:50:00] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-18 09:50:00] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2023-03-18 09:50:00] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 0 ms to minimize.
[2023-03-18 09:50:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 463 ms
[2023-03-18 09:50:00] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2023-03-18 09:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-18 09:50:01] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2023-03-18 09:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-18 09:50:01] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 0 ms to minimize.
[2023-03-18 09:50:01] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 1 ms to minimize.
[2023-03-18 09:50:01] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 0 ms to minimize.
[2023-03-18 09:50:01] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 0 ms to minimize.
[2023-03-18 09:50:01] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 0 ms to minimize.
[2023-03-18 09:50:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 656 ms
[2023-03-18 09:50:01] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 0 ms to minimize.
[2023-03-18 09:50:02] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2023-03-18 09:50:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2023-03-18 09:50:02] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2023-03-18 09:50:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-18 09:50:02] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-18 09:50:02] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-18 09:50:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2023-03-18 09:50:02] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2023-03-18 09:50:02] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-18 09:50:03] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2023-03-18 09:50:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 444 ms
[2023-03-18 09:50:03] [INFO ] After 12701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1008 ms.
[2023-03-18 09:50:04] [INFO ] After 14795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 152 ms.
Support contains 133 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 502/502 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 292 transition count 501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 291 transition count 501
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 291 transition count 500
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 290 transition count 500
Applied a total of 4 rules in 36 ms. Remains 290 /292 variables (removed 2) and now considering 500/502 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 290/292 places, 500/502 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 349062 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349062 steps, saw 63412 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-18 09:50:07] [INFO ] Flow matrix only has 440 transitions (discarded 60 similar events)
// Phase 1: matrix 440 rows 290 cols
[2023-03-18 09:50:07] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 09:50:07] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 09:50:07] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:50:08] [INFO ] After 677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-18 09:50:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 09:50:08] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-18 09:50:09] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-18 09:50:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:50:10] [INFO ] After 606ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-18 09:50:10] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-18 09:50:10] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2023-03-18 09:50:10] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 1 ms to minimize.
[2023-03-18 09:50:10] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-03-18 09:50:11] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 0 ms to minimize.
[2023-03-18 09:50:11] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2023-03-18 09:50:11] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2023-03-18 09:50:11] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2023-03-18 09:50:11] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2023-03-18 09:50:11] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2023-03-18 09:50:11] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2023-03-18 09:50:11] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-18 09:50:12] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-18 09:50:12] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-18 09:50:12] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2023-03-18 09:50:12] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2023-03-18 09:50:12] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2145 ms
[2023-03-18 09:50:12] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2023-03-18 09:50:12] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-18 09:50:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2023-03-18 09:50:12] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2023-03-18 09:50:13] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2023-03-18 09:50:13] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 1 ms to minimize.
[2023-03-18 09:50:13] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2023-03-18 09:50:13] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2023-03-18 09:50:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 631 ms
[2023-03-18 09:50:13] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2023-03-18 09:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-18 09:50:13] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 0 ms to minimize.
[2023-03-18 09:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-18 09:50:14] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 0 ms to minimize.
[2023-03-18 09:50:14] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2023-03-18 09:50:14] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 0 ms to minimize.
[2023-03-18 09:50:14] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2023-03-18 09:50:14] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 1 ms to minimize.
[2023-03-18 09:50:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 605 ms
[2023-03-18 09:50:14] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2023-03-18 09:50:14] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-18 09:50:14] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 0 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 926 ms
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 1 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2023-03-18 09:50:15] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2023-03-18 09:50:16] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2023-03-18 09:50:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 718 ms
[2023-03-18 09:50:16] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2023-03-18 09:50:16] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2023-03-18 09:50:16] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2023-03-18 09:50:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2023-03-18 09:50:16] [INFO ] After 7200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 856 ms.
[2023-03-18 09:50:17] [INFO ] After 9076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 145 ms.
Support contains 132 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 500/500 transitions.
Applied a total of 0 rules in 17 ms. Remains 290 /290 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 290/290 places, 500/500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 341544 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341544 steps, saw 62178 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-18 09:50:21] [INFO ] Flow matrix only has 440 transitions (discarded 60 similar events)
[2023-03-18 09:50:21] [INFO ] Invariant cache hit.
[2023-03-18 09:50:21] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 09:50:21] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:50:21] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-18 09:50:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 09:50:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:50:22] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-18 09:50:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:50:23] [INFO ] After 609ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-18 09:50:23] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-18 09:50:23] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-18 09:50:24] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2023-03-18 09:50:24] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2023-03-18 09:50:24] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-18 09:50:24] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-18 09:50:24] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-18 09:50:25] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2023-03-18 09:50:25] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2023-03-18 09:50:25] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2023-03-18 09:50:25] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2023-03-18 09:50:25] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2023-03-18 09:50:25] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 0 ms to minimize.
[2023-03-18 09:50:25] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2023-03-18 09:50:26] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2023-03-18 09:50:26] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2023-03-18 09:50:26] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2023-03-18 09:50:26] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2023-03-18 09:50:26] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2023-03-18 09:50:26] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2023-03-18 09:50:26] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-03-18 09:50:27] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-18 09:50:27] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-18 09:50:27] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2023-03-18 09:50:27] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 0 ms to minimize.
[2023-03-18 09:50:27] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2023-03-18 09:50:27] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2023-03-18 09:50:27] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-03-18 09:50:27] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4095 ms
[2023-03-18 09:50:27] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-18 09:50:28] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 0 ms to minimize.
[2023-03-18 09:50:28] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2023-03-18 09:50:28] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2023-03-18 09:50:28] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2023-03-18 09:50:28] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2023-03-18 09:50:28] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2023-03-18 09:50:28] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2023-03-18 09:50:29] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2023-03-18 09:50:29] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2023-03-18 09:50:29] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 0 ms to minimize.
[2023-03-18 09:50:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1542 ms
[2023-03-18 09:50:29] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2023-03-18 09:50:29] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 0 ms to minimize.
[2023-03-18 09:50:29] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 0 ms to minimize.
[2023-03-18 09:50:29] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 0 ms to minimize.
[2023-03-18 09:50:30] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 0 ms to minimize.
[2023-03-18 09:50:30] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2023-03-18 09:50:30] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 0 ms to minimize.
[2023-03-18 09:50:30] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2023-03-18 09:50:30] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2023-03-18 09:50:30] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 0 ms to minimize.
[2023-03-18 09:50:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1246 ms
[2023-03-18 09:50:30] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 0 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 669 ms
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 0 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 0 ms to minimize.
[2023-03-18 09:50:31] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-18 09:50:32] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-18 09:50:32] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2023-03-18 09:50:32] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2023-03-18 09:50:32] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 0 ms to minimize.
[2023-03-18 09:50:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1046 ms
[2023-03-18 09:50:32] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2023-03-18 09:50:32] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2023-03-18 09:50:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2023-03-18 09:50:32] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2023-03-18 09:50:33] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 0 ms to minimize.
[2023-03-18 09:50:33] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2023-03-18 09:50:33] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2023-03-18 09:50:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
[2023-03-18 09:50:33] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2023-03-18 09:50:33] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 1 ms to minimize.
[2023-03-18 09:50:33] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2023-03-18 09:50:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 441 ms
[2023-03-18 09:50:33] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2023-03-18 09:50:34] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-18 09:50:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-03-18 09:50:34] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2023-03-18 09:50:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-18 09:50:34] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2023-03-18 09:50:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-18 09:50:34] [INFO ] After 11663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 843 ms.
[2023-03-18 09:50:35] [INFO ] After 13516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 137 ms.
Support contains 132 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 500/500 transitions.
Applied a total of 0 rules in 33 ms. Remains 290 /290 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 290/290 places, 500/500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 500/500 transitions.
Applied a total of 0 rules in 22 ms. Remains 290 /290 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-18 09:50:35] [INFO ] Flow matrix only has 440 transitions (discarded 60 similar events)
[2023-03-18 09:50:35] [INFO ] Invariant cache hit.
[2023-03-18 09:50:35] [INFO ] Implicit Places using invariants in 204 ms returned [280, 281, 282, 283, 284]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 224 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 285/290 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 285 /285 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 260 ms. Remains : 285/290 places, 500/500 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-18 09:50:35] [INFO ] Flatten gal took : 52 ms
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 56 ms
[2023-03-18 09:50:36] [INFO ] Input system was already deterministic with 690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 31 ms
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 36 ms
[2023-03-18 09:50:36] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 28 ms
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 32 ms
[2023-03-18 09:50:36] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 25 ms
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 27 ms
[2023-03-18 09:50:36] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 24 ms
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 26 ms
[2023-03-18 09:50:36] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 283 transition count 493
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 394 place count 283 transition count 405
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 570 place count 195 transition count 405
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 580 place count 190 transition count 400
Applied a total of 580 rules in 34 ms. Remains 190 /480 variables (removed 290) and now considering 400/690 (removed 290) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 190/480 places, 400/690 transitions.
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 15 ms
[2023-03-18 09:50:36] [INFO ] Flatten gal took : 16 ms
[2023-03-18 09:50:36] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 480 transition count 626
Reduce places removed 64 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 416 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 160 place count 400 transition count 610
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 160 place count 400 transition count 525
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 330 place count 315 transition count 525
Applied a total of 330 rules in 36 ms. Remains 315 /480 variables (removed 165) and now considering 525/690 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 315/480 places, 525/690 transitions.
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 17 ms
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 19 ms
[2023-03-18 09:50:37] [INFO ] Input system was already deterministic with 525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 21 ms
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 27 ms
[2023-03-18 09:50:37] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 20 ms
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 22 ms
[2023-03-18 09:50:37] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 18 ms
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 19 ms
[2023-03-18 09:50:37] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 18 ms
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 19 ms
[2023-03-18 09:50:37] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 22 ms
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 22 ms
[2023-03-18 09:50:37] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 18 ms
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 19 ms
[2023-03-18 09:50:37] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 398 place count 281 transition count 391
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 598 place count 181 transition count 391
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 638 place count 161 transition count 371
Applied a total of 638 rules in 26 ms. Remains 161 /480 variables (removed 319) and now considering 371/690 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 161/480 places, 371/690 transitions.
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 11 ms
[2023-03-18 09:50:37] [INFO ] Flatten gal took : 12 ms
[2023-03-18 09:50:37] [INFO ] Input system was already deterministic with 371 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1360374 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :{}
Probabilistic random walk after 1360374 steps, saw 226796 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 09:50:40] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 161 cols
[2023-03-18 09:50:40] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 09:50:40] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 09:50:40] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:50:41] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 09:50:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:50:41] [INFO ] After 27ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:50:41] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:50:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 09:50:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-18 09:50:41] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 09:50:41] [INFO ] After 26ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 09:50:41] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2023-03-18 09:50:41] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-18 09:50:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-18 09:50:41] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-18 09:50:41] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 371/371 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 161/161 places, 371/371 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-18 09:50:41] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:50:41] [INFO ] Invariant cache hit.
[2023-03-18 09:50:41] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 09:50:41] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:50:41] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 09:50:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:50:41] [INFO ] After 19ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-18 09:50:41] [INFO ] After 46ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:50:41] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:50:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-18 09:50:42] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-18 09:50:42] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 09:50:42] [INFO ] After 15ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 09:50:42] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 09:50:42] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1667 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=1626 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2706090 steps, run timeout after 6001 ms. (steps per millisecond=450 ) properties seen :{}
Probabilistic random walk after 2706090 steps, saw 451169 distinct states, run finished after 6001 ms. (steps per millisecond=450 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 09:50:50] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:50:50] [INFO ] Invariant cache hit.
[2023-03-18 09:50:50] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 09:50:50] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:50:50] [INFO ] After 105ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 09:50:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:50:50] [INFO ] After 27ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:50:50] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:50:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 09:50:50] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 09:50:50] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 09:50:50] [INFO ] After 27ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 09:50:50] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2023-03-18 09:50:50] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2023-03-18 09:50:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-18 09:50:50] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-18 09:50:50] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 161/161 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 371/371 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2023-03-18 09:50:50] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:50:50] [INFO ] Invariant cache hit.
[2023-03-18 09:50:51] [INFO ] Implicit Places using invariants in 194 ms returned [151, 152, 153, 154, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 196 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/161 places, 371/371 transitions.
Applied a total of 0 rules in 22 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 230 ms. Remains : 156/161 places, 371/371 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1659 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=1724 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2684676 steps, run timeout after 6001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 2684676 steps, saw 447603 distinct states, run finished after 6001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 09:50:59] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2023-03-18 09:50:59] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 09:50:59] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 09:50:59] [INFO ] After 101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 09:50:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:50:59] [INFO ] After 26ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:50:59] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:50:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-18 09:50:59] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 09:50:59] [INFO ] After 25ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 09:50:59] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-03-18 09:51:00] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-03-18 09:51:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2023-03-18 09:51:00] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2023-03-18 09:51:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 297 ms
[2023-03-18 09:51:00] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-18 09:51:00] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 156/156 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2023-03-18 09:51:00] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:00] [INFO ] Invariant cache hit.
[2023-03-18 09:51:00] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-18 09:51:00] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:00] [INFO ] Invariant cache hit.
[2023-03-18 09:51:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:51:00] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2023-03-18 09:51:00] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 09:51:00] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:00] [INFO ] Invariant cache hit.
[2023-03-18 09:51:01] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 945 ms. Remains : 156/156 places, 371/371 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=574 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-18 09:51:01] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:01] [INFO ] Invariant cache hit.
[2023-03-18 09:51:01] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 09:51:01] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 09:51:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:51:01] [INFO ] After 15ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-18 09:51:01] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:51:01] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:51:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 09:51:01] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 09:51:01] [INFO ] After 14ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 09:51:01] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-18 09:51:01] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1312254 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :{}
Probabilistic random walk after 1312254 steps, saw 218806 distinct states, run finished after 3004 ms. (steps per millisecond=436 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 09:51:04] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:04] [INFO ] Invariant cache hit.
[2023-03-18 09:51:04] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:51:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 09:51:04] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 09:51:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:51:04] [INFO ] After 22ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 09:51:05] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 09:51:05] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 156/156 places, 371/371 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1365762 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :{}
Probabilistic random walk after 1365762 steps, saw 227686 distinct states, run finished after 3001 ms. (steps per millisecond=455 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 09:51:08] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:08] [INFO ] Invariant cache hit.
[2023-03-18 09:51:08] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:51:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 09:51:08] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 09:51:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:51:08] [INFO ] After 25ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 09:51:08] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 09:51:08] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2023-03-18 09:51:08] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:08] [INFO ] Invariant cache hit.
[2023-03-18 09:51:08] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-18 09:51:08] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:08] [INFO ] Invariant cache hit.
[2023-03-18 09:51:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 09:51:08] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-18 09:51:08] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 09:51:08] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2023-03-18 09:51:08] [INFO ] Invariant cache hit.
[2023-03-18 09:51:09] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 896 ms. Remains : 156/156 places, 371/371 transitions.
Graph (trivial) has 278 edges and 156 vertex of which 99 / 156 are part of one of the 20 SCC in 4 ms
Free SCC test removed 79 places
Drop transitions removed 158 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 237 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 77 transition count 115
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 58 transition count 115
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 56 place count 47 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 26 edges and 47 vertex of which 25 / 47 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 27 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 92 edges and 23 vertex of which 8 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Graph (trivial) has 29 edges and 8 vertex of which 4 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 31 rules applied. Total rules applied 89 place count 5 transition count 40
Drop transitions removed 24 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 122 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 122 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 3 transition count 6
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 2 transition count 2
Applied a total of 130 rules in 19 ms. Remains 2 /156 variables (removed 154) and now considering 2/371 (removed 369) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 09:51:09] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 09:51:09] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 09:51:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 09:51:09] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 09:51:09] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 09:51:09] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 278 edges and 156 vertex of which 99 / 156 are part of one of the 20 SCC in 1 ms
Free SCC test removed 79 places
Drop transitions removed 158 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 237 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 77 transition count 115
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 58 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 53 place count 49 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 49 vertex of which 20 / 49 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 55 place count 33 transition count 114
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (trivial) has 53 edges and 30 vertex of which 12 / 30 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 79 place count 22 transition count 94
Drop transitions removed 24 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 137 place count 22 transition count 36
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 22 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 22 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 21 transition count 32
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 21 transition count 32
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 162 place count 17 transition count 20
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 166 place count 17 transition count 16
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 17 transition count 16
Applied a total of 167 rules in 11 ms. Remains 17 /156 variables (removed 139) and now considering 16/371 (removed 355) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 17 cols
[2023-03-18 09:51:09] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-18 09:51:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-18 09:51:09] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 09:51:09] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 09:51:09] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:51:09] [INFO ] Flatten gal took : 18 ms
[2023-03-18 09:51:09] [INFO ] Flatten gal took : 19 ms
[2023-03-18 09:51:09] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:51:09] [INFO ] Flatten gal took : 17 ms
[2023-03-18 09:51:09] [INFO ] Flatten gal took : 19 ms
[2023-03-18 09:51:09] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 09:51:09] [INFO ] Flatten gal took : 18 ms
[2023-03-18 09:51:09] [INFO ] Flatten gal took : 19 ms
[2023-03-18 09:51:09] [INFO ] Input system was already deterministic with 690 transitions.
[2023-03-18 09:51:09] [INFO ] Flatten gal took : 41 ms
[2023-03-18 09:51:09] [INFO ] Flatten gal took : 41 ms
[2023-03-18 09:51:10] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 41 ms.
[2023-03-18 09:51:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 5 ms.
Total runtime 141960 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1527/ctl_0_ --ctl=/tmp/1527/ctl_1_ --ctl=/tmp/1527/ctl_2_ --ctl=/tmp/1527/ctl_3_ --ctl=/tmp/1527/ctl_4_ --ctl=/tmp/1527/ctl_5_ --ctl=/tmp/1527/ctl_6_ --ctl=/tmp/1527/ctl_7_ --ctl=/tmp/1527/ctl_8_ --ctl=/tmp/1527/ctl_9_ --ctl=/tmp/1527/ctl_10_ --ctl=/tmp/1527/ctl_11_ --ctl=/tmp/1527/ctl_12_ --ctl=/tmp/1527/ctl_13_ --ctl=/tmp/1527/ctl_14_ --ctl=/tmp/1527/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14929988 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16089252 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-4, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540300618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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