./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2261d9b3f7623cbd5155b35c39657066d179b87a48a9848bd1f196c713477a75 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:58:37,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:58:37,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:58:37,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:58:37,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:58:37,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:58:37,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:58:37,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:58:37,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:58:37,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:58:37,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:58:37,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:58:37,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:58:37,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:58:37,892 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:58:37,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:58:37,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:58:37,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:58:37,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:58:37,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:58:37,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:58:37,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:58:37,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:58:37,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:58:37,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:58:37,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:58:37,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:58:37,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:58:37,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:58:37,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:58:37,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:58:37,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:58:37,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:58:37,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:58:37,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:58:37,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:58:37,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:58:37,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:58:37,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:58:37,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:58:37,898 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:58:37,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:58:37,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:58:37,899 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2261d9b3f7623cbd5155b35c39657066d179b87a48a9848bd1f196c713477a75 [2024-06-27 16:58:38,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:58:38,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:58:38,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:58:38,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:58:38,130 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:58:38,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2024-06-27 16:58:39,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:58:39,436 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:58:39,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2024-06-27 16:58:39,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db33b797/f944c5ebd9994931b14139d4c518b37d/FLAG0775b61eb [2024-06-27 16:58:39,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db33b797/f944c5ebd9994931b14139d4c518b37d [2024-06-27 16:58:39,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:58:39,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:58:39,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:58:39,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:58:39,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:58:39,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dde51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39, skipping insertion in model container [2024-06-27 16:58:39,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,488 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:58:39,634 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2592,2605] [2024-06-27 16:58:39,641 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:58:39,647 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:58:39,661 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2592,2605] [2024-06-27 16:58:39,663 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:58:39,675 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:58:39,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39 WrapperNode [2024-06-27 16:58:39,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:58:39,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:58:39,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:58:39,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:58:39,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,729 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2024-06-27 16:58:39,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:58:39,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:58:39,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:58:39,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:58:39,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,751 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 16:58:39,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:58:39,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:58:39,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:58:39,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:58:39,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (1/1) ... [2024-06-27 16:58:39,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:58:39,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:39,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 16:58:39,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 16:58:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:58:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:58:39,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:58:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:58:39,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:58:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:58:39,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:58:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:58:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:58:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:58:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:58:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:58:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:58:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:58:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:58:39,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:58:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:58:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:58:39,834 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:58:39,907 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:58:39,909 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:58:40,173 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:58:40,174 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:58:40,346 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:58:40,346 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 16:58:40,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:58:40 BoogieIcfgContainer [2024-06-27 16:58:40,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:58:40,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:58:40,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:58:40,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:58:40,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:58:39" (1/3) ... [2024-06-27 16:58:40,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9d5663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:58:40, skipping insertion in model container [2024-06-27 16:58:40,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:58:39" (2/3) ... [2024-06-27 16:58:40,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9d5663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:58:40, skipping insertion in model container [2024-06-27 16:58:40,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:58:40" (3/3) ... [2024-06-27 16:58:40,352 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2024-06-27 16:58:40,359 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:58:40,366 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:58:40,366 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:58:40,366 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:58:40,435 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:58:40,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2024-06-27 16:58:40,521 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-06-27 16:58:40,521 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:58:40,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-06-27 16:58:40,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2024-06-27 16:58:40,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2024-06-27 16:58:40,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:58:40,541 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d79049a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:58:40,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:58:40,559 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:58:40,560 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-06-27 16:58:40,560 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:58:40,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:40,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:40,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:40,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash 261283878, now seen corresponding path program 1 times [2024-06-27 16:58:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281868500] [2024-06-27 16:58:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281868500] [2024-06-27 16:58:40,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281868500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:58:40,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:58:40,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:58:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372980425] [2024-06-27 16:58:40,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:58:40,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:58:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:40,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:58:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:58:40,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-27 16:58:40,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:40,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:40,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-27 16:58:40,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:41,071 INFO L124 PetriNetUnfolderBase]: 617/945 cut-off events. [2024-06-27 16:58:41,072 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-06-27 16:58:41,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 945 events. 617/945 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3705 event pairs, 126 based on Foata normal form. 1/932 useless extension candidates. Maximal degree in co-relation 1706. Up to 677 conditions per place. [2024-06-27 16:58:41,085 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-06-27 16:58:41,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2024-06-27 16:58:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:58:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:58:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-06-27 16:58:41,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2024-06-27 16:58:41,096 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2024-06-27 16:58:41,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2024-06-27 16:58:41,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:58:41,106 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2024-06-27 16:58:41,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2024-06-27 16:58:41,110 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-06-27 16:58:41,110 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2024-06-27 16:58:41,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:41,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:41,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:41,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:58:41,111 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:41,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1254734667, now seen corresponding path program 1 times [2024-06-27 16:58:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070626962] [2024-06-27 16:58:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:41,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:41,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070626962] [2024-06-27 16:58:41,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070626962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:58:41,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:58:41,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:58:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976982940] [2024-06-27 16:58:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:58:41,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:58:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:58:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:58:41,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-27 16:58:41,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:41,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:41,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-27 16:58:41,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:41,386 INFO L124 PetriNetUnfolderBase]: 617/943 cut-off events. [2024-06-27 16:58:41,387 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-06-27 16:58:41,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2148 conditions, 943 events. 617/943 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3839 event pairs, 407 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 792. Up to 895 conditions per place. [2024-06-27 16:58:41,392 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-06-27 16:58:41,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2024-06-27 16:58:41,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:58:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:58:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-06-27 16:58:41,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-27 16:58:41,394 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2024-06-27 16:58:41,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2024-06-27 16:58:41,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:58:41,398 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2024-06-27 16:58:41,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2024-06-27 16:58:41,399 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-27 16:58:41,399 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2024-06-27 16:58:41,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:41,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:41,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:41,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:58:41,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:41,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash -788942457, now seen corresponding path program 1 times [2024-06-27 16:58:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:41,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240607630] [2024-06-27 16:58:41,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:41,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:58:41,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:41,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240607630] [2024-06-27 16:58:41,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240607630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:58:41,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:58:41,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:58:41,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043331221] [2024-06-27 16:58:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:58:41,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:58:41,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:41,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:58:41,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:58:41,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-27 16:58:41,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:41,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:41,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-27 16:58:41,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:41,654 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2024-06-27 16:58:41,654 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-06-27 16:58:41,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1161 events. 790/1161 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4676 event pairs, 246 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2024-06-27 16:58:41,659 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-06-27 16:58:41,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2024-06-27 16:58:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:58:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:58:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2024-06-27 16:58:41,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-27 16:58:41,662 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2024-06-27 16:58:41,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2024-06-27 16:58:41,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 16:58:41,665 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2024-06-27 16:58:41,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-06-27 16:58:41,667 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-06-27 16:58:41,667 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2024-06-27 16:58:41,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:41,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:41,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:41,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:58:41,668 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:41,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 513300121, now seen corresponding path program 1 times [2024-06-27 16:58:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764704365] [2024-06-27 16:58:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764704365] [2024-06-27 16:58:41,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764704365] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864091660] [2024-06-27 16:58:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:41,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:41,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:41,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:58:41,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 16:58:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:41,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:58:41,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:41,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864091660] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:42,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:58:42,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-06-27 16:58:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623176729] [2024-06-27 16:58:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:58:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:58:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:58:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 16:58:42,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-27 16:58:42,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:42,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:42,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-27 16:58:42,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:42,158 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2024-06-27 16:58:42,158 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2024-06-27 16:58:42,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1295 events. 855/1295 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5390 event pairs, 256 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3227. Up to 670 conditions per place. [2024-06-27 16:58:42,165 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2024-06-27 16:58:42,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2024-06-27 16:58:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:58:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:58:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-27 16:58:42,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-06-27 16:58:42,166 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2024-06-27 16:58:42,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2024-06-27 16:58:42,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:58:42,168 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2024-06-27 16:58:42,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-27 16:58:42,169 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2024-06-27 16:58:42,169 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2024-06-27 16:58:42,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:42,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:42,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:42,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 16:58:42,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:42,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:42,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash -694361008, now seen corresponding path program 1 times [2024-06-27 16:58:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:42,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741005376] [2024-06-27 16:58:42,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:42,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:42,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741005376] [2024-06-27 16:58:42,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741005376] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285880554] [2024-06-27 16:58:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:42,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:42,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:42,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:58:42,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 16:58:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:43,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjunts are in the unsatisfiable core [2024-06-27 16:58:43,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:43,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:58:43,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-06-27 16:58:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:43,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:43,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2024-06-27 16:58:44,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:44,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2024-06-27 16:58:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2024-06-27 16:58:44,588 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-06-27 16:58:44,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2024-06-27 16:58:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285880554] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:58:44,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:58:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-06-27 16:58:44,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144262610] [2024-06-27 16:58:44,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:58:44,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-06-27 16:58:44,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-06-27 16:58:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2024-06-27 16:58:45,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-27 16:58:45,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:45,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:45,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-27 16:58:45,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:46,408 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2024-06-27 16:58:46,409 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2024-06-27 16:58:46,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 2761 events. 1841/2761 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12609 event pairs, 106 based on Foata normal form. 1/2760 useless extension candidates. Maximal degree in co-relation 5614. Up to 1375 conditions per place. [2024-06-27 16:58:46,421 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2024-06-27 16:58:46,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2024-06-27 16:58:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-06-27 16:58:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-06-27 16:58:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2024-06-27 16:58:46,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2024-06-27 16:58:46,424 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2024-06-27 16:58:46,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2024-06-27 16:58:46,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 16:58:46,429 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2024-06-27 16:58:46,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2024-06-27 16:58:46,429 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-06-27 16:58:46,429 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2024-06-27 16:58:46,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:46,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:46,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:46,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 16:58:46,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:46,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:46,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2045165880, now seen corresponding path program 2 times [2024-06-27 16:58:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732722161] [2024-06-27 16:58:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:47,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:47,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732722161] [2024-06-27 16:58:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732722161] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:47,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125930974] [2024-06-27 16:58:47,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:58:47,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:47,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:47,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:58:47,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 16:58:47,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:58:47,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:58:47,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjunts are in the unsatisfiable core [2024-06-27 16:58:47,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:47,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:58:47,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-06-27 16:58:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:47,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:47,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2024-06-27 16:58:47,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:47,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 111 [2024-06-27 16:58:48,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2024-06-27 16:58:48,123 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-06-27 16:58:48,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2024-06-27 16:58:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:48,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125930974] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:58:48,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:58:48,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-06-27 16:58:48,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896435662] [2024-06-27 16:58:48,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:58:48,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 16:58:48,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:48,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 16:58:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-06-27 16:58:48,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-27 16:58:48,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 19 states, 19 states have (on average 9.736842105263158) internal successors, (185), 19 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:48,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:48,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-27 16:58:48,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:49,054 INFO L124 PetriNetUnfolderBase]: 1538/2445 cut-off events. [2024-06-27 16:58:49,054 INFO L125 PetriNetUnfolderBase]: For 3235/3238 co-relation queries the response was YES. [2024-06-27 16:58:49,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7984 conditions, 2445 events. 1538/2445 cut-off events. For 3235/3238 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12186 event pairs, 126 based on Foata normal form. 3/2444 useless extension candidates. Maximal degree in co-relation 7422. Up to 1623 conditions per place. [2024-06-27 16:58:49,071 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 49 changer transitions 1/181 dead transitions. [2024-06-27 16:58:49,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 181 transitions, 1211 flow [2024-06-27 16:58:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 16:58:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 16:58:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 242 transitions. [2024-06-27 16:58:49,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 16:58:49,073 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 15 states and 242 transitions. [2024-06-27 16:58:49,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 181 transitions, 1211 flow [2024-06-27 16:58:49,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 181 transitions, 1093 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-27 16:58:49,086 INFO L231 Difference]: Finished difference. Result has 76 places, 111 transitions, 679 flow [2024-06-27 16:58:49,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=679, PETRI_PLACES=76, PETRI_TRANSITIONS=111} [2024-06-27 16:58:49,089 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2024-06-27 16:58:49,089 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 111 transitions, 679 flow [2024-06-27 16:58:49,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.736842105263158) internal successors, (185), 19 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:49,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:49,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:49,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 16:58:49,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:49,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:49,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -605205446, now seen corresponding path program 3 times [2024-06-27 16:58:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662408281] [2024-06-27 16:58:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662408281] [2024-06-27 16:58:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662408281] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951443483] [2024-06-27 16:58:49,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:58:49,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:49,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:49,713 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:58:49,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 16:58:49,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 16:58:49,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:58:49,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjunts are in the unsatisfiable core [2024-06-27 16:58:49,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:49,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:58:49,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-06-27 16:58:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:50,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:50,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-06-27 16:58:50,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:50,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2024-06-27 16:58:50,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2024-06-27 16:58:50,796 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:58:50,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2024-06-27 16:58:50,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2024-06-27 16:58:50,810 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:58:50,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2024-06-27 16:58:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:50,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951443483] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:58:50,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:58:50,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-06-27 16:58:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274063113] [2024-06-27 16:58:50,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:58:50,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-06-27 16:58:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-06-27 16:58:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-06-27 16:58:50,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-27 16:58:50,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 111 transitions, 679 flow. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:50,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:50,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-27 16:58:50,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:52,189 INFO L124 PetriNetUnfolderBase]: 2837/4302 cut-off events. [2024-06-27 16:58:52,189 INFO L125 PetriNetUnfolderBase]: For 4931/4936 co-relation queries the response was YES. [2024-06-27 16:58:52,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13781 conditions, 4302 events. 2837/4302 cut-off events. For 4931/4936 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22223 event pairs, 146 based on Foata normal form. 6/4307 useless extension candidates. Maximal degree in co-relation 12444. Up to 2499 conditions per place. [2024-06-27 16:58:52,308 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 162 selfloop transitions, 89 changer transitions 2/257 dead transitions. [2024-06-27 16:58:52,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 257 transitions, 1757 flow [2024-06-27 16:58:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 16:58:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 16:58:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 292 transitions. [2024-06-27 16:58:52,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46570972886762363 [2024-06-27 16:58:52,311 INFO L175 Difference]: Start difference. First operand has 76 places, 111 transitions, 679 flow. Second operand 19 states and 292 transitions. [2024-06-27 16:58:52,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 257 transitions, 1757 flow [2024-06-27 16:58:52,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 257 transitions, 1720 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 16:58:52,324 INFO L231 Difference]: Finished difference. Result has 96 places, 156 transitions, 1222 flow [2024-06-27 16:58:52,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1222, PETRI_PLACES=96, PETRI_TRANSITIONS=156} [2024-06-27 16:58:52,325 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 61 predicate places. [2024-06-27 16:58:52,325 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 156 transitions, 1222 flow [2024-06-27 16:58:52,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:52,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:52,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:52,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 16:58:52,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:52,538 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:52,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1101888080, now seen corresponding path program 4 times [2024-06-27 16:58:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988332513] [2024-06-27 16:58:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:52,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988332513] [2024-06-27 16:58:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988332513] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306352918] [2024-06-27 16:58:52,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:58:52,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:52,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:52,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:58:52,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 16:58:52,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:58:52,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:58:52,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjunts are in the unsatisfiable core [2024-06-27 16:58:52,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:53,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:58:53,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-06-27 16:58:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:53,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:53,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-06-27 16:58:53,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:53,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2024-06-27 16:58:53,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2024-06-27 16:58:53,845 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:58:53,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2024-06-27 16:58:53,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2024-06-27 16:58:53,854 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:58:53,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2024-06-27 16:58:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:53,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306352918] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:58:53,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:58:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2024-06-27 16:58:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406491648] [2024-06-27 16:58:53,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:58:53,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 16:58:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 16:58:53,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-06-27 16:58:53,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-27 16:58:53,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 156 transitions, 1222 flow. Second operand has 21 states, 21 states have (on average 9.047619047619047) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:53,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:53,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-27 16:58:53,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:55,375 INFO L124 PetriNetUnfolderBase]: 3261/4900 cut-off events. [2024-06-27 16:58:55,375 INFO L125 PetriNetUnfolderBase]: For 8628/8633 co-relation queries the response was YES. [2024-06-27 16:58:55,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17782 conditions, 4900 events. 3261/4900 cut-off events. For 8628/8633 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 25393 event pairs, 190 based on Foata normal form. 6/4905 useless extension candidates. Maximal degree in co-relation 16270. Up to 1876 conditions per place. [2024-06-27 16:58:55,404 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 140 selfloop transitions, 140 changer transitions 1/285 dead transitions. [2024-06-27 16:58:55,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 285 transitions, 2273 flow [2024-06-27 16:58:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-06-27 16:58:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-06-27 16:58:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 320 transitions. [2024-06-27 16:58:55,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46176046176046176 [2024-06-27 16:58:55,406 INFO L175 Difference]: Start difference. First operand has 96 places, 156 transitions, 1222 flow. Second operand 21 states and 320 transitions. [2024-06-27 16:58:55,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 285 transitions, 2273 flow [2024-06-27 16:58:55,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 285 transitions, 2224 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 16:58:55,430 INFO L231 Difference]: Finished difference. Result has 113 places, 180 transitions, 1697 flow [2024-06-27 16:58:55,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1697, PETRI_PLACES=113, PETRI_TRANSITIONS=180} [2024-06-27 16:58:55,431 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 78 predicate places. [2024-06-27 16:58:55,432 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 180 transitions, 1697 flow [2024-06-27 16:58:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.047619047619047) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:55,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:55,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:55,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-27 16:58:55,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:55,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:58:55,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1443003576, now seen corresponding path program 5 times [2024-06-27 16:58:55,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:55,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128975941] [2024-06-27 16:58:55,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:55,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:55,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128975941] [2024-06-27 16:58:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128975941] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026351089] [2024-06-27 16:58:55,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:58:55,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:55,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:55,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:58:55,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-27 16:58:56,103 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 16:58:56,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:58:56,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjunts are in the unsatisfiable core [2024-06-27 16:58:56,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:56,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:58:56,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:56,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 75 [2024-06-27 16:58:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:56,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:57,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-06-27 16:58:57,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2024-06-27 16:58:57,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-06-27 16:58:57,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2024-06-27 16:58:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:58:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026351089] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:58:57,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:58:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2024-06-27 16:58:57,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456004279] [2024-06-27 16:58:57,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:58:57,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-06-27 16:58:57,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-06-27 16:58:57,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2024-06-27 16:58:57,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-27 16:58:57,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 180 transitions, 1697 flow. Second operand has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 29 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:58:57,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:57,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-27 16:58:57,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:02,802 INFO L124 PetriNetUnfolderBase]: 6480/9263 cut-off events. [2024-06-27 16:59:02,802 INFO L125 PetriNetUnfolderBase]: For 21066/21071 co-relation queries the response was YES. [2024-06-27 16:59:02,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35203 conditions, 9263 events. 6480/9263 cut-off events. For 21066/21071 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 47909 event pairs, 270 based on Foata normal form. 7/9269 useless extension candidates. Maximal degree in co-relation 32733. Up to 2598 conditions per place. [2024-06-27 16:59:02,858 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 288 selfloop transitions, 344 changer transitions 2/636 dead transitions. [2024-06-27 16:59:02,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 636 transitions, 5459 flow [2024-06-27 16:59:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-06-27 16:59:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-06-27 16:59:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 696 transitions. [2024-06-27 16:59:02,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41354723707664887 [2024-06-27 16:59:02,862 INFO L175 Difference]: Start difference. First operand has 113 places, 180 transitions, 1697 flow. Second operand 51 states and 696 transitions. [2024-06-27 16:59:02,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 636 transitions, 5459 flow [2024-06-27 16:59:02,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 636 transitions, 5241 flow, removed 82 selfloop flow, removed 10 redundant places. [2024-06-27 16:59:02,951 INFO L231 Difference]: Finished difference. Result has 175 places, 391 transitions, 4538 flow [2024-06-27 16:59:02,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=4538, PETRI_PLACES=175, PETRI_TRANSITIONS=391} [2024-06-27 16:59:02,952 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 140 predicate places. [2024-06-27 16:59:02,953 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 391 transitions, 4538 flow [2024-06-27 16:59:02,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 29 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:02,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:02,954 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:02,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:03,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:03,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:03,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash 386528106, now seen corresponding path program 6 times [2024-06-27 16:59:03,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:03,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177201446] [2024-06-27 16:59:03,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:03,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177201446] [2024-06-27 16:59:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177201446] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703641802] [2024-06-27 16:59:03,228 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:59:03,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:03,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:03,245 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:03,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-27 16:59:03,309 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-06-27 16:59:03,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:03,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:59:03,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:03,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:03,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703641802] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:03,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:03,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-06-27 16:59:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105876959] [2024-06-27 16:59:03,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:03,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 16:59:03,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 16:59:03,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-06-27 16:59:03,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-06-27 16:59:03,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 391 transitions, 4538 flow. Second operand has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:03,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:03,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-06-27 16:59:03,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:06,327 INFO L124 PetriNetUnfolderBase]: 12293/17498 cut-off events. [2024-06-27 16:59:06,327 INFO L125 PetriNetUnfolderBase]: For 110303/110303 co-relation queries the response was YES. [2024-06-27 16:59:06,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87366 conditions, 17498 events. 12293/17498 cut-off events. For 110303/110303 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 98257 event pairs, 1705 based on Foata normal form. 260/16597 useless extension candidates. Maximal degree in co-relation 86539. Up to 5082 conditions per place. [2024-06-27 16:59:06,524 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 828 selfloop transitions, 314 changer transitions 0/1143 dead transitions. [2024-06-27 16:59:06,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1143 transitions, 13914 flow [2024-06-27 16:59:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-06-27 16:59:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-06-27 16:59:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 460 transitions. [2024-06-27 16:59:06,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-06-27 16:59:06,529 INFO L175 Difference]: Start difference. First operand has 175 places, 391 transitions, 4538 flow. Second operand 32 states and 460 transitions. [2024-06-27 16:59:06,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1143 transitions, 13914 flow [2024-06-27 16:59:07,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1143 transitions, 12372 flow, removed 642 selfloop flow, removed 14 redundant places. [2024-06-27 16:59:07,568 INFO L231 Difference]: Finished difference. Result has 210 places, 639 transitions, 7371 flow [2024-06-27 16:59:07,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4073, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=7371, PETRI_PLACES=210, PETRI_TRANSITIONS=639} [2024-06-27 16:59:07,569 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 175 predicate places. [2024-06-27 16:59:07,569 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 639 transitions, 7371 flow [2024-06-27 16:59:07,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:07,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:07,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:07,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:07,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:07,789 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:07,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash -820156864, now seen corresponding path program 1 times [2024-06-27 16:59:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:07,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552010392] [2024-06-27 16:59:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:07,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:07,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552010392] [2024-06-27 16:59:07,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552010392] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:07,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506501305] [2024-06-27 16:59:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:07,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:07,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:07,867 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:07,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-27 16:59:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:07,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:59:07,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:07,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:08,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506501305] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:08,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:08,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-06-27 16:59:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527672369] [2024-06-27 16:59:08,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:08,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 16:59:08,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:08,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 16:59:08,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-06-27 16:59:08,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-27 16:59:08,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 639 transitions, 7371 flow. Second operand has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 13 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:08,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:08,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-27 16:59:08,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:08,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork0_~i~2_7 4))))) (or (and (= v_~min2~0_58 v_~min2~0_57) (<= v_~min2~0_58 .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem8_2| |v_thread3Thread1of1ForFork0_#t~mem8_1|)) (and (= v_~min2~0_57 .cse0) (< .cse0 v_~min2~0_58)))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_1|, ~min2~0=v_~min2~0_58} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_2|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|, ~min2~0=v_~min2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem8, thread3Thread1of1ForFork0_#t~mem7, ~min2~0][206], [Black: 1272#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1252#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1228#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1260#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1234#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 806#true, 32#L75true, Black: 1214#(and (= ~min1~0 0) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (or (exists ((v_subst_6 Int)) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset)) 1) 0) (<= (+ v_subst_6 1) ~N~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset))) (<= 0 v_subst_6))) (and (= ~min2~0 0) (exists ((v_subst_5 Int)) (and (<= (+ v_subst_5 1) ~N~0) (<= 0 v_subst_5) (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_5))))))))), Black: 1222#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (exists ((v_subst_10 Int)) (and (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* v_subst_10 4)))) (<= 0 v_subst_10) (<= (+ v_subst_10 1) ~N~0)))) (exists ((v_subst_9 Int)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9)))) (<= 0 v_subst_9) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9))) 1) 0) (<= (+ v_subst_9 1) ~N~0)))) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1244#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1220#(and (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1157#(or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)), Black: 1256#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1254#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1240#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), 1495#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), 15#L63true, Black: 408#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1010#true, Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 790#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))), Black: 794#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 786#(and (= ~min1~0 0) (= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))))), Black: 792#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 740#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 796#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 798#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 6#L94-4true, 600#true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 61#(<= 1 ~N~0), Black: 598#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), 1532#true, Black: 1491#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1295#true, Black: 1503#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1509#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1511#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), 203#true, Black: 1006#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1475#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 992#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= ~min2~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1487#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), 5#L47true, Black: 1000#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~min1~0 0) (< ~min2~0 0))), Black: 1473#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1328#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1507#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1481#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1335#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1398#(< thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1501#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1505#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1236#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1268#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1513#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1477#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1270#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1020#(= ~min2~0 ~min1~0), Black: 1218#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1208#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1262#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0)))]) [2024-06-27 16:59:08,699 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 16:59:08,699 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 16:59:08,699 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 16:59:08,700 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 16:59:08,879 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([422] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork0_~i~2_7 4))))) (or (and (= v_~min2~0_58 v_~min2~0_57) (<= v_~min2~0_58 .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem8_2| |v_thread3Thread1of1ForFork0_#t~mem8_1|)) (and (= v_~min2~0_57 .cse0) (< .cse0 v_~min2~0_58)))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_1|, ~min2~0=v_~min2~0_58} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_2|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|, ~min2~0=v_~min2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem8, thread3Thread1of1ForFork0_#t~mem7, ~min2~0][206], [Black: 1272#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1252#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1228#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1260#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1234#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), 806#true, Black: 1127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), Black: 1214#(and (= ~min1~0 0) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (or (exists ((v_subst_6 Int)) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset)) 1) 0) (<= (+ v_subst_6 1) ~N~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset))) (<= 0 v_subst_6))) (and (= ~min2~0 0) (exists ((v_subst_5 Int)) (and (<= (+ v_subst_5 1) ~N~0) (<= 0 v_subst_5) (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_5))))))))), 32#L75true, Black: 1222#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (exists ((v_subst_10 Int)) (and (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* v_subst_10 4)))) (<= 0 v_subst_10) (<= (+ v_subst_10 1) ~N~0)))) (exists ((v_subst_9 Int)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9)))) (<= 0 v_subst_9) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9))) 1) 0) (<= (+ v_subst_9 1) ~N~0)))) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1244#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1220#(and (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1157#(or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)), Black: 1256#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1254#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1240#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), 15#L63true, 1495#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1010#true, Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 790#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))), Black: 794#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 786#(and (= ~min1~0 0) (= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))))), Black: 792#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 740#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 796#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 798#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 6#L94-4true, 600#true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 61#(<= 1 ~N~0), Black: 598#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), 1532#true, Black: 1491#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1295#true, Black: 1503#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1509#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), 203#true, Black: 1511#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1006#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1475#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 992#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= ~min2~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1487#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), 5#L47true, Black: 1000#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~min1~0 0) (< ~min2~0 0))), Black: 1473#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1328#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1507#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1481#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1335#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1398#(< thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1501#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1505#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1236#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1268#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1513#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1477#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1270#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1020#(= ~min2~0 ~min1~0), Black: 1218#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1208#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1262#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0)))]) [2024-06-27 16:59:08,880 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 16:59:08,880 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 16:59:08,881 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 16:59:08,881 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 16:59:08,881 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 16:59:08,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork0_~i~2_7 4))))) (or (and (= v_~min2~0_58 v_~min2~0_57) (<= v_~min2~0_58 .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem8_2| |v_thread3Thread1of1ForFork0_#t~mem8_1|)) (and (= v_~min2~0_57 .cse0) (< .cse0 v_~min2~0_58)))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_1|, ~min2~0=v_~min2~0_58} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_2|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|, ~min2~0=v_~min2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem8, thread3Thread1of1ForFork0_#t~mem7, ~min2~0][206], [Black: 1272#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1252#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1228#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1260#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1234#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), 806#true, Black: 1127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), Black: 1214#(and (= ~min1~0 0) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (or (exists ((v_subst_6 Int)) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset)) 1) 0) (<= (+ v_subst_6 1) ~N~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset))) (<= 0 v_subst_6))) (and (= ~min2~0 0) (exists ((v_subst_5 Int)) (and (<= (+ v_subst_5 1) ~N~0) (<= 0 v_subst_5) (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_5))))))))), 32#L75true, Black: 1222#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (exists ((v_subst_10 Int)) (and (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* v_subst_10 4)))) (<= 0 v_subst_10) (<= (+ v_subst_10 1) ~N~0)))) (exists ((v_subst_9 Int)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9)))) (<= 0 v_subst_9) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9))) 1) 0) (<= (+ v_subst_9 1) ~N~0)))) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1244#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1220#(and (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1157#(or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)), Black: 1256#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1254#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1240#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), 15#L63true, 1495#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1010#true, Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 790#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))), Black: 794#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 786#(and (= ~min1~0 0) (= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))))), Black: 792#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 740#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 796#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 798#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 600#true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 52#(<= (+ ~M~0 1) ~N~0), 24#L95true, Black: 61#(<= 1 ~N~0), Black: 598#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), 1532#true, Black: 1491#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1295#true, Black: 1503#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1509#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), 203#true, Black: 1511#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1006#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1475#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 992#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= ~min2~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1487#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), 5#L47true, Black: 1000#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~min1~0 0) (< ~min2~0 0))), Black: 1473#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1328#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1507#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1481#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1335#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1398#(< thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1501#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1236#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1505#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1268#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1513#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1270#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1477#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1020#(= ~min2~0 ~min1~0), Black: 1218#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1208#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1262#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0)))]) [2024-06-27 16:59:08,891 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 16:59:08,891 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 16:59:08,891 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 16:59:08,891 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 16:59:09,267 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([422] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork0_~i~2_7 4))))) (or (and (= v_~min2~0_58 v_~min2~0_57) (<= v_~min2~0_58 .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem8_2| |v_thread3Thread1of1ForFork0_#t~mem8_1|)) (and (= v_~min2~0_57 .cse0) (< .cse0 v_~min2~0_58)))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_1|, ~min2~0=v_~min2~0_58} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_2|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|, ~min2~0=v_~min2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem8, thread3Thread1of1ForFork0_#t~mem7, ~min2~0][206], [Black: 1272#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1252#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1228#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1260#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1234#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), 806#true, Black: 1127#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 32#L75true, Black: 1214#(and (= ~min1~0 0) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (or (exists ((v_subst_6 Int)) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset)) 1) 0) (<= (+ v_subst_6 1) ~N~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_subst_6) ~A~0.offset))) (<= 0 v_subst_6))) (and (= ~min2~0 0) (exists ((v_subst_5 Int)) (and (<= (+ v_subst_5 1) ~N~0) (<= 0 v_subst_5) (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_5))))))))), Black: 1222#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (exists ((v_subst_10 Int)) (and (<= 0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* v_subst_10 4)))) (<= 0 v_subst_10) (<= (+ v_subst_10 1) ~N~0)))) (exists ((v_subst_9 Int)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9)))) (<= 0 v_subst_9) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_9))) 1) 0) (<= (+ v_subst_9 1) ~N~0)))) (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (< 1 ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0)))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1244#(and (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< 1 ~N~0))), Black: 1220#(and (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1157#(or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0)), Black: 1256#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1254#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1240#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (= ~N~0 1) (< 1 ~N~0)) (<= thread1Thread1of1ForFork1_~i~0 1) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), 15#L63true, 1495#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1010#true, Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 790#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))), Black: 794#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 786#(and (= ~min1~0 0) (= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) (select (select |#memory_int#1| ~A~0.base) 0)) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))) (and (<= (+ (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)))))), Black: 792#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 740#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 796#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 798#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 600#true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 52#(<= (+ ~M~0 1) ~N~0), 24#L95true, Black: 61#(<= 1 ~N~0), Black: 598#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), 1532#true, Black: 1491#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1295#true, Black: 1503#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1509#(and (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), 203#true, Black: 1511#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1006#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1475#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 992#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= ~min2~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1487#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), 5#L47true, Black: 1000#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~min1~0 0) (< ~min2~0 0))), Black: 1473#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1328#(and (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1507#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1481#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= thread2Thread1of1ForFork2_~i~1 0)), Black: 1335#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1398#(< thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1501#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1236#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1505#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1268#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1513#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1270#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0))), Black: 1477#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1020#(= ~min2~0 ~min1~0), Black: 1218#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1208#(and (or (< ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) ~min2~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))))) (< 1 ~N~0)) (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min2~0) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) ~min1~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))))) (< 1 ~N~0))), Black: 1262#(and (or (and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0)) (< 1 ~N~0)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1)) (< 1 ~N~0)) (or (and (or (= ~min1~0 0) (< ~min1~0 0)) (<= 2 ~N~0) (<= (+ ~min2~0 1) 0)) (and (= ~N~0 1) (<= (+ ~min1~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0) (<= 1 ~N~0)) (and (= ~min2~0 0) (<= (+ ~min1~0 1) 0))) (<= thread1Thread1of1ForFork1_~i~0 1) (or (forall ((v_thread3Thread1of1ForFork0_~i~2_31 Int)) (or (< ~N~0 (+ v_thread3Thread1of1ForFork0_~i~2_31 1)) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_31) ~A~0.offset)) 1)) (< v_thread3Thread1of1ForFork0_~i~2_31 ~M~0))) (< 1 ~N~0)))]) [2024-06-27 16:59:09,268 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 16:59:09,268 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 16:59:09,268 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 16:59:09,268 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 16:59:09,268 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 16:59:09,945 INFO L124 PetriNetUnfolderBase]: 7586/11686 cut-off events. [2024-06-27 16:59:09,946 INFO L125 PetriNetUnfolderBase]: For 126983/127524 co-relation queries the response was YES. [2024-06-27 16:59:09,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68153 conditions, 11686 events. 7586/11686 cut-off events. For 126983/127524 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 74024 event pairs, 2329 based on Foata normal form. 477/11973 useless extension candidates. Maximal degree in co-relation 67504. Up to 5392 conditions per place. [2024-06-27 16:59:10,050 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 675 selfloop transitions, 9 changer transitions 2/777 dead transitions. [2024-06-27 16:59:10,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 777 transitions, 10464 flow [2024-06-27 16:59:10,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:59:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:59:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-27 16:59:10,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-06-27 16:59:10,052 INFO L175 Difference]: Start difference. First operand has 210 places, 639 transitions, 7371 flow. Second operand 6 states and 98 transitions. [2024-06-27 16:59:10,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 777 transitions, 10464 flow [2024-06-27 16:59:10,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 777 transitions, 10359 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-06-27 16:59:10,787 INFO L231 Difference]: Finished difference. Result has 213 places, 536 transitions, 6111 flow [2024-06-27 16:59:10,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6076, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6111, PETRI_PLACES=213, PETRI_TRANSITIONS=536} [2024-06-27 16:59:10,788 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 178 predicate places. [2024-06-27 16:59:10,789 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 536 transitions, 6111 flow [2024-06-27 16:59:10,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.384615384615385) internal successors, (122), 13 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:10,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:10,789 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:10,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:11,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-27 16:59:11,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:11,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1527978253, now seen corresponding path program 7 times [2024-06-27 16:59:11,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:11,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90502528] [2024-06-27 16:59:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:11,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90502528] [2024-06-27 16:59:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90502528] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553487320] [2024-06-27 16:59:11,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 16:59:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:11,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:11,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-27 16:59:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:11,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:59:11,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:11,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:11,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553487320] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:11,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-06-27 16:59:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939265013] [2024-06-27 16:59:11,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:11,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:59:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:11,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:59:11,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-06-27 16:59:11,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-27 16:59:11,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 536 transitions, 6111 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:11,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:11,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-27 16:59:11,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:12,982 INFO L124 PetriNetUnfolderBase]: 6408/9928 cut-off events. [2024-06-27 16:59:12,983 INFO L125 PetriNetUnfolderBase]: For 115763/116074 co-relation queries the response was YES. [2024-06-27 16:59:13,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59311 conditions, 9928 events. 6408/9928 cut-off events. For 115763/116074 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 60882 event pairs, 1934 based on Foata normal form. 356/10255 useless extension candidates. Maximal degree in co-relation 58643. Up to 4939 conditions per place. [2024-06-27 16:59:13,054 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 413 selfloop transitions, 59 changer transitions 10/532 dead transitions. [2024-06-27 16:59:13,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 532 transitions, 6800 flow [2024-06-27 16:59:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:59:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:59:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-27 16:59:13,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2024-06-27 16:59:13,056 INFO L175 Difference]: Start difference. First operand has 213 places, 536 transitions, 6111 flow. Second operand 7 states and 115 transitions. [2024-06-27 16:59:13,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 532 transitions, 6800 flow [2024-06-27 16:59:13,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 532 transitions, 6717 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 16:59:13,561 INFO L231 Difference]: Finished difference. Result has 217 places, 472 transitions, 5434 flow [2024-06-27 16:59:13,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5338, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5434, PETRI_PLACES=217, PETRI_TRANSITIONS=472} [2024-06-27 16:59:13,562 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 182 predicate places. [2024-06-27 16:59:13,562 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 472 transitions, 5434 flow [2024-06-27 16:59:13,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:13,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:13,562 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:13,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:13,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:13,777 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:13,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2146383493, now seen corresponding path program 8 times [2024-06-27 16:59:13,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:13,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102167217] [2024-06-27 16:59:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:13,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:13,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102167217] [2024-06-27 16:59:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102167217] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:13,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486705469] [2024-06-27 16:59:13,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:59:13,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:13,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:13,884 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:13,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-06-27 16:59:14,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:59:14,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:14,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:59:14,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:14,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:14,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486705469] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:14,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:14,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-06-27 16:59:14,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975063149] [2024-06-27 16:59:14,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:14,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:59:14,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:59:14,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-06-27 16:59:14,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-27 16:59:14,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 472 transitions, 5434 flow. Second operand has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 14 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:14,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:14,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-27 16:59:14,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:15,474 INFO L124 PetriNetUnfolderBase]: 4751/7325 cut-off events. [2024-06-27 16:59:15,475 INFO L125 PetriNetUnfolderBase]: For 84328/84665 co-relation queries the response was YES. [2024-06-27 16:59:15,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41601 conditions, 7325 events. 4751/7325 cut-off events. For 84328/84665 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 42488 event pairs, 1548 based on Foata normal form. 270/7530 useless extension candidates. Maximal degree in co-relation 41516. Up to 4845 conditions per place. [2024-06-27 16:59:15,516 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 272 selfloop transitions, 3 changer transitions 113/413 dead transitions. [2024-06-27 16:59:15,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 413 transitions, 5363 flow [2024-06-27 16:59:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:59:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:59:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-06-27 16:59:15,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 16:59:15,518 INFO L175 Difference]: Start difference. First operand has 217 places, 472 transitions, 5434 flow. Second operand 7 states and 110 transitions. [2024-06-27 16:59:15,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 413 transitions, 5363 flow [2024-06-27 16:59:15,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 413 transitions, 5088 flow, removed 92 selfloop flow, removed 12 redundant places. [2024-06-27 16:59:15,850 INFO L231 Difference]: Finished difference. Result has 206 places, 300 transitions, 2980 flow [2024-06-27 16:59:15,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4068, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2980, PETRI_PLACES=206, PETRI_TRANSITIONS=300} [2024-06-27 16:59:15,851 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 171 predicate places. [2024-06-27 16:59:15,851 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 300 transitions, 2980 flow [2024-06-27 16:59:15,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 14 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:15,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:15,851 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:15,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:16,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-06-27 16:59:16,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:16,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash -161010821, now seen corresponding path program 9 times [2024-06-27 16:59:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:16,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007420020] [2024-06-27 16:59:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:16,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:16,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007420020] [2024-06-27 16:59:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007420020] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:16,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927980447] [2024-06-27 16:59:16,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:59:16,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:16,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:16,143 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:16,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-06-27 16:59:16,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 16:59:16,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:16,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:59:16,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:16,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927980447] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:16,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:16,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-06-27 16:59:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85009139] [2024-06-27 16:59:16,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:16,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-27 16:59:16,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-27 16:59:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-06-27 16:59:16,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-27 16:59:16,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 300 transitions, 2980 flow. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:16,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:16,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-27 16:59:16,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:19,295 INFO L124 PetriNetUnfolderBase]: 13592/19281 cut-off events. [2024-06-27 16:59:19,295 INFO L125 PetriNetUnfolderBase]: For 189741/190399 co-relation queries the response was YES. [2024-06-27 16:59:19,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105125 conditions, 19281 events. 13592/19281 cut-off events. For 189741/190399 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 107356 event pairs, 557 based on Foata normal form. 240/19385 useless extension candidates. Maximal degree in co-relation 105062. Up to 7424 conditions per place. [2024-06-27 16:59:19,442 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 905 selfloop transitions, 368 changer transitions 0/1297 dead transitions. [2024-06-27 16:59:19,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1297 transitions, 14588 flow [2024-06-27 16:59:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-06-27 16:59:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-06-27 16:59:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 573 transitions. [2024-06-27 16:59:19,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2024-06-27 16:59:19,444 INFO L175 Difference]: Start difference. First operand has 206 places, 300 transitions, 2980 flow. Second operand 37 states and 573 transitions. [2024-06-27 16:59:19,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1297 transitions, 14588 flow [2024-06-27 16:59:20,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1297 transitions, 13152 flow, removed 588 selfloop flow, removed 23 redundant places. [2024-06-27 16:59:20,671 INFO L231 Difference]: Finished difference. Result has 177 places, 591 transitions, 6541 flow [2024-06-27 16:59:20,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=6541, PETRI_PLACES=177, PETRI_TRANSITIONS=591} [2024-06-27 16:59:20,672 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 142 predicate places. [2024-06-27 16:59:20,672 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 591 transitions, 6541 flow [2024-06-27 16:59:20,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:20,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:20,672 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:20,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-06-27 16:59:20,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-06-27 16:59:20,883 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:20,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1715871281, now seen corresponding path program 10 times [2024-06-27 16:59:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859644378] [2024-06-27 16:59:20,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:20,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859644378] [2024-06-27 16:59:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859644378] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:20,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260075818] [2024-06-27 16:59:20,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:59:20,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:20,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:20,972 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:20,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-06-27 16:59:21,026 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:59:21,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:21,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:59:21,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:21,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260075818] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:21,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:21,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-06-27 16:59:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692009851] [2024-06-27 16:59:21,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:21,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 16:59:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 16:59:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-06-27 16:59:21,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-06-27 16:59:21,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 591 transitions, 6541 flow. Second operand has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:21,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:21,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-06-27 16:59:21,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:25,403 INFO L124 PetriNetUnfolderBase]: 17345/24341 cut-off events. [2024-06-27 16:59:25,404 INFO L125 PetriNetUnfolderBase]: For 240279/240279 co-relation queries the response was YES. [2024-06-27 16:59:25,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136855 conditions, 24341 events. 17345/24341 cut-off events. For 240279/240279 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 133916 event pairs, 484 based on Foata normal form. 32/24373 useless extension candidates. Maximal degree in co-relation 136793. Up to 8859 conditions per place. [2024-06-27 16:59:25,595 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 697 selfloop transitions, 845 changer transitions 0/1543 dead transitions. [2024-06-27 16:59:25,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1543 transitions, 18131 flow [2024-06-27 16:59:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-06-27 16:59:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2024-06-27 16:59:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 578 transitions. [2024-06-27 16:59:25,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39807162534435264 [2024-06-27 16:59:25,601 INFO L175 Difference]: Start difference. First operand has 177 places, 591 transitions, 6541 flow. Second operand 44 states and 578 transitions. [2024-06-27 16:59:25,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 1543 transitions, 18131 flow [2024-06-27 16:59:28,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1543 transitions, 17608 flow, removed 258 selfloop flow, removed 4 redundant places. [2024-06-27 16:59:28,218 INFO L231 Difference]: Finished difference. Result has 228 places, 982 transitions, 13586 flow [2024-06-27 16:59:28,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6366, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=457, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=13586, PETRI_PLACES=228, PETRI_TRANSITIONS=982} [2024-06-27 16:59:28,219 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 193 predicate places. [2024-06-27 16:59:28,220 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 982 transitions, 13586 flow [2024-06-27 16:59:28,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:28,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:28,220 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:28,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:28,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-27 16:59:28,427 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:28,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash -489664485, now seen corresponding path program 11 times [2024-06-27 16:59:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:28,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064750340] [2024-06-27 16:59:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:59:28,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:28,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064750340] [2024-06-27 16:59:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064750340] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:28,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160248788] [2024-06-27 16:59:28,521 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:59:28,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:28,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:28,522 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:28,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-06-27 16:59:28,625 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 16:59:28,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:28,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:59:28,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:28,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:28,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160248788] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:28,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:28,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-06-27 16:59:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828303648] [2024-06-27 16:59:28,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:28,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 16:59:28,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:28,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 16:59:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-06-27 16:59:28,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-06-27 16:59:28,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 982 transitions, 13586 flow. Second operand has 18 states, 18 states have (on average 6.777777777777778) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:28,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:28,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-06-27 16:59:28,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:35,672 INFO L124 PetriNetUnfolderBase]: 19188/26950 cut-off events. [2024-06-27 16:59:35,672 INFO L125 PetriNetUnfolderBase]: For 326498/326498 co-relation queries the response was YES. [2024-06-27 16:59:35,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163683 conditions, 26950 events. 19188/26950 cut-off events. For 326498/326498 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 151253 event pairs, 475 based on Foata normal form. 32/26982 useless extension candidates. Maximal degree in co-relation 163609. Up to 9795 conditions per place. [2024-06-27 16:59:35,935 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 1017 selfloop transitions, 1077 changer transitions 0/2095 dead transitions. [2024-06-27 16:59:35,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 2095 transitions, 26713 flow [2024-06-27 16:59:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-06-27 16:59:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-06-27 16:59:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 933 transitions. [2024-06-27 16:59:35,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39820742637644047 [2024-06-27 16:59:35,938 INFO L175 Difference]: Start difference. First operand has 228 places, 982 transitions, 13586 flow. Second operand 71 states and 933 transitions. [2024-06-27 16:59:35,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 2095 transitions, 26713 flow [2024-06-27 16:59:42,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 2095 transitions, 25012 flow, removed 477 selfloop flow, removed 7 redundant places. [2024-06-27 16:59:42,042 INFO L231 Difference]: Finished difference. Result has 306 places, 1230 transitions, 18638 flow [2024-06-27 16:59:42,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=12256, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=845, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=18638, PETRI_PLACES=306, PETRI_TRANSITIONS=1230} [2024-06-27 16:59:42,043 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 271 predicate places. [2024-06-27 16:59:42,043 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 1230 transitions, 18638 flow [2024-06-27 16:59:42,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.777777777777778) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:42,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:42,044 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:42,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-06-27 16:59:42,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-06-27 16:59:42,255 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:42,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2110799999, now seen corresponding path program 12 times [2024-06-27 16:59:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620033209] [2024-06-27 16:59:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:59:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620033209] [2024-06-27 16:59:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620033209] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079797269] [2024-06-27 16:59:42,359 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:59:42,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:42,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:42,385 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:42,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-06-27 16:59:42,482 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 16:59:42,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:42,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:59:42,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:42,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:42,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079797269] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:42,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:42,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-06-27 16:59:42,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261401119] [2024-06-27 16:59:42,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:42,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 16:59:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:42,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 16:59:42,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-06-27 16:59:42,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-06-27 16:59:42,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 1230 transitions, 18638 flow. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:42,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:42,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-06-27 16:59:42,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:49,995 INFO L124 PetriNetUnfolderBase]: 21132/29671 cut-off events. [2024-06-27 16:59:49,996 INFO L125 PetriNetUnfolderBase]: For 358892/358892 co-relation queries the response was YES. [2024-06-27 16:59:50,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182042 conditions, 29671 events. 21132/29671 cut-off events. For 358892/358892 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 168494 event pairs, 911 based on Foata normal form. 31/29666 useless extension candidates. Maximal degree in co-relation 181954. Up to 10879 conditions per place. [2024-06-27 16:59:50,556 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 1075 selfloop transitions, 1061 changer transitions 0/2137 dead transitions. [2024-06-27 16:59:50,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 2137 transitions, 31350 flow [2024-06-27 16:59:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-06-27 16:59:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-06-27 16:59:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 631 transitions. [2024-06-27 16:59:50,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40683430045132174 [2024-06-27 16:59:50,558 INFO L175 Difference]: Start difference. First operand has 306 places, 1230 transitions, 18638 flow. Second operand 47 states and 631 transitions. [2024-06-27 16:59:50,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 2137 transitions, 31350 flow [2024-06-27 16:59:57,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 2137 transitions, 29679 flow, removed 430 selfloop flow, removed 25 redundant places. [2024-06-27 16:59:57,485 INFO L231 Difference]: Finished difference. Result has 342 places, 1465 transitions, 24303 flow [2024-06-27 16:59:57,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=17117, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=830, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=24303, PETRI_PLACES=342, PETRI_TRANSITIONS=1465} [2024-06-27 16:59:57,486 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 307 predicate places. [2024-06-27 16:59:57,486 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 1465 transitions, 24303 flow [2024-06-27 16:59:57,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:57,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:57,487 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:57,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:57,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:57,698 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:59:57,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 507457499, now seen corresponding path program 13 times [2024-06-27 16:59:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87751922] [2024-06-27 16:59:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:59:57,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:57,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87751922] [2024-06-27 16:59:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87751922] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:57,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11922328] [2024-06-27 16:59:57,772 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 16:59:57,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:57,773 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:59:57,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-06-27 16:59:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:57,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:59:57,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:59:57,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:59:58,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11922328] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:58,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:59:58,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-06-27 16:59:58,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636166408] [2024-06-27 16:59:58,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:58,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 16:59:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:59:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 16:59:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-06-27 16:59:58,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-27 16:59:58,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1465 transitions, 24303 flow. Second operand has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:58,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:58,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-27 16:59:58,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:05,455 INFO L124 PetriNetUnfolderBase]: 19550/27815 cut-off events. [2024-06-27 17:00:05,455 INFO L125 PetriNetUnfolderBase]: For 377042/377588 co-relation queries the response was YES. [2024-06-27 17:00:05,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174017 conditions, 27815 events. 19550/27815 cut-off events. For 377042/377588 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 164383 event pairs, 1656 based on Foata normal form. 298/27917 useless extension candidates. Maximal degree in co-relation 173914. Up to 11569 conditions per place. [2024-06-27 17:00:05,822 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 946 selfloop transitions, 839 changer transitions 0/1809 dead transitions. [2024-06-27 17:00:05,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1809 transitions, 31266 flow [2024-06-27 17:00:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:00:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:00:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 239 transitions. [2024-06-27 17:00:05,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42602495543672014 [2024-06-27 17:00:05,824 INFO L175 Difference]: Start difference. First operand has 342 places, 1465 transitions, 24303 flow. Second operand 17 states and 239 transitions. [2024-06-27 17:00:05,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1809 transitions, 31266 flow [2024-06-27 17:00:13,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 1809 transitions, 30885 flow, removed 176 selfloop flow, removed 6 redundant places. [2024-06-27 17:00:13,434 INFO L231 Difference]: Finished difference. Result has 356 places, 1500 transitions, 27312 flow [2024-06-27 17:00:13,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=24159, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=804, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=27312, PETRI_PLACES=356, PETRI_TRANSITIONS=1500} [2024-06-27 17:00:13,436 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 321 predicate places. [2024-06-27 17:00:13,436 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 1500 transitions, 27312 flow [2024-06-27 17:00:13,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:13,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:13,436 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:13,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-06-27 17:00:13,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-06-27 17:00:13,648 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:00:13,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1666554393, now seen corresponding path program 14 times [2024-06-27 17:00:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:00:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300850273] [2024-06-27 17:00:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:00:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 17:00:13,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:00:13,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300850273] [2024-06-27 17:00:13,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300850273] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:00:13,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517745084] [2024-06-27 17:00:13,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:00:13,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:00:13,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:13,729 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:00:13,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-06-27 17:00:13,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:00:13,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:13,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:13,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 17:00:13,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 17:00:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517745084] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:14,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:00:14,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-06-27 17:00:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902895978] [2024-06-27 17:00:14,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:14,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 17:00:14,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:00:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 17:00:14,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-06-27 17:00:14,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-27 17:00:14,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1500 transitions, 27312 flow. Second operand has 21 states, 21 states have (on average 7.142857142857143) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:14,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:14,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-27 17:00:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand