./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 07:13:37,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 07:13:37,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 07:13:37,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 07:13:37,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 07:13:37,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 07:13:37,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 07:13:37,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 07:13:37,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 07:13:37,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 07:13:37,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 07:13:37,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 07:13:37,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 07:13:37,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 07:13:37,354 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 07:13:37,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 07:13:37,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 07:13:37,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 07:13:37,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 07:13:37,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 07:13:37,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 07:13:37,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 07:13:37,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 07:13:37,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 07:13:37,360 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 07:13:37,360 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 07:13:37,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 07:13:37,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 07:13:37,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 07:13:37,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 07:13:37,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 07:13:37,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 07:13:37,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:13:37,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 07:13:37,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 07:13:37,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 07:13:37,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 07:13:37,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 07:13:37,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 07:13:37,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 07:13:37,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 07:13:37,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 07:13:37,365 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-10-13 07:13:37,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 07:13:37,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 07:13:37,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 07:13:37,648 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 07:13:37,649 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 07:13:37,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2024-10-13 07:13:39,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 07:13:39,342 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 07:13:39,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2024-10-13 07:13:39,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f589da1/82734909eb964ea28e1db0d93a599063/FLAG72818b445 [2024-10-13 07:13:39,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f589da1/82734909eb964ea28e1db0d93a599063 [2024-10-13 07:13:39,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 07:13:39,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 07:13:39,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 07:13:39,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 07:13:39,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 07:13:39,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7834101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39, skipping insertion in model container [2024-10-13 07:13:39,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 07:13:39,657 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2592,2605] [2024-10-13 07:13:39,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:13:39,681 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 07:13:39,708 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2592,2605] [2024-10-13 07:13:39,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:13:39,730 INFO L204 MainTranslator]: Completed translation [2024-10-13 07:13:39,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39 WrapperNode [2024-10-13 07:13:39,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 07:13:39,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 07:13:39,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 07:13:39,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 07:13:39,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,764 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2024-10-13 07:13:39,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 07:13:39,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 07:13:39,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 07:13:39,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 07:13:39,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,794 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-10-13 07:13:39,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 07:13:39,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 07:13:39,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 07:13:39,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 07:13:39,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (1/1) ... [2024-10-13 07:13:39,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:13:39,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:13:39,846 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-10-13 07:13:39,849 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-10-13 07:13:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 07:13:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 07:13:39,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 07:13:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 07:13:39,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 07:13:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 07:13:39,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 07:13:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 07:13:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 07:13:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 07:13:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 07:13:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 07:13:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 07:13:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 07:13:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 07:13:39,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 07:13:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 07:13:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 07:13:39,903 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 07:13:40,021 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 07:13:40,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 07:13:40,260 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 07:13:40,260 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 07:13:40,443 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 07:13:40,444 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 07:13:40,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:13:40 BoogieIcfgContainer [2024-10-13 07:13:40,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 07:13:40,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 07:13:40,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 07:13:40,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 07:13:40,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:13:39" (1/3) ... [2024-10-13 07:13:40,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617aad72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:13:40, skipping insertion in model container [2024-10-13 07:13:40,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:39" (2/3) ... [2024-10-13 07:13:40,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617aad72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:13:40, skipping insertion in model container [2024-10-13 07:13:40,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:13:40" (3/3) ... [2024-10-13 07:13:40,457 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2024-10-13 07:13:40,472 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 07:13:40,473 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 07:13:40,473 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 07:13:40,525 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 07:13:40,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2024-10-13 07:13:40,601 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-10-13 07:13:40,601 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 07:13:40,609 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-10-13 07:13:40,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2024-10-13 07:13:40,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2024-10-13 07:13:40,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 07:13:40,623 INFO L333 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, 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;@4b4e4aa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 07:13:40,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 07:13:40,634 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 07:13:40,634 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-10-13 07:13:40,634 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 07:13:40,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:40,635 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:13:40,635 INFO L396 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-10-13 07:13:40,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 261283878, now seen corresponding path program 1 times [2024-10-13 07:13:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:40,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086270729] [2024-10-13 07:13:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:40,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086270729] [2024-10-13 07:13:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086270729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:13:41,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:13:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 07:13:41,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028305789] [2024-10-13 07:13:41,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:13:41,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:13:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:13:41,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:13:41,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:13:41,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-10-13 07:13:41,089 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-10-13 07:13:41,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:13:41,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-10-13 07:13:41,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:13:41,298 INFO L124 PetriNetUnfolderBase]: 617/945 cut-off events. [2024-10-13 07:13:41,298 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-10-13 07:13:41,301 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 3706 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-10-13 07:13:41,308 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-10-13 07:13:41,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2024-10-13 07:13:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:13:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 07:13:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-10-13 07:13:41,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2024-10-13 07:13:41,324 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2024-10-13 07:13:41,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2024-10-13 07:13:41,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 07:13:41,334 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2024-10-13 07:13:41,336 INFO L260 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-10-13 07:13:41,341 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-10-13 07:13:41,342 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2024-10-13 07:13:41,342 INFO L472 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-10-13 07:13:41,342 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:41,342 INFO L204 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-10-13 07:13:41,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 07:13:41,343 INFO L396 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-10-13 07:13:41,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1254734667, now seen corresponding path program 1 times [2024-10-13 07:13:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:41,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066708374] [2024-10-13 07:13:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:41,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:13:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066708374] [2024-10-13 07:13:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066708374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:13:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:13:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 07:13:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559747245] [2024-10-13 07:13:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:13:41,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:13:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:13:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:13:41,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:13:41,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-10-13 07:13:41,543 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-10-13 07:13:41,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:13:41,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-10-13 07:13:41,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:13:41,692 INFO L124 PetriNetUnfolderBase]: 617/943 cut-off events. [2024-10-13 07:13:41,692 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-10-13 07:13:41,696 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-10-13 07:13:41,701 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-10-13 07:13:41,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2024-10-13 07:13:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:13:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 07:13:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-10-13 07:13:41,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-10-13 07:13:41,704 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2024-10-13 07:13:41,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2024-10-13 07:13:41,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 07:13:41,706 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2024-10-13 07:13:41,707 INFO L260 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-10-13 07:13:41,710 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-10-13 07:13:41,710 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2024-10-13 07:13:41,710 INFO L472 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-10-13 07:13:41,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:41,710 INFO L204 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-10-13 07:13:41,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 07:13:41,711 INFO L396 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-10-13 07:13:41,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:41,711 INFO L85 PathProgramCache]: Analyzing trace with hash -788942457, now seen corresponding path program 1 times [2024-10-13 07:13:41,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:41,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591261293] [2024-10-13 07:13:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:41,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 07:13:41,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:41,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591261293] [2024-10-13 07:13:41,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591261293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:13:41,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:13:41,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:13:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582206175] [2024-10-13 07:13:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:13:41,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:13:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:13:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:13:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:13:41,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-13 07:13:41,841 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-10-13 07:13:41,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:13:41,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-13 07:13:41,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:13:42,063 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2024-10-13 07:13:42,065 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-10-13 07:13:42,067 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-10-13 07:13:42,073 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-10-13 07:13:42,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2024-10-13 07:13:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:13:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 07:13:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2024-10-13 07:13:42,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-10-13 07:13:42,076 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2024-10-13 07:13:42,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2024-10-13 07:13:42,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-13 07:13:42,080 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2024-10-13 07:13:42,081 INFO L260 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-10-13 07:13:42,082 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-10-13 07:13:42,083 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2024-10-13 07:13:42,083 INFO L472 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-10-13 07:13:42,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:42,083 INFO L204 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-10-13 07:13:42,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 07:13:42,084 INFO L396 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-10-13 07:13:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 513300121, now seen corresponding path program 1 times [2024-10-13 07:13:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:42,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833328273] [2024-10-13 07:13:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:13:42,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:42,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833328273] [2024-10-13 07:13:42,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833328273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:13:42,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697235736] [2024-10-13 07:13:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:42,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:13:42,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:13:42,230 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-10-13 07:13:42,231 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-10-13 07:13:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:42,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 07:13:42,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:13:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:13:42,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:13:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:13:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697235736] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 07:13:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 07:13:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-10-13 07:13:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446683118] [2024-10-13 07:13:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:13:42,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:13:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:13:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:13:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 07:13:42,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-13 07:13:42,486 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-10-13 07:13:42,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:13:42,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-13 07:13:42,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:13:42,660 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2024-10-13 07:13:42,660 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2024-10-13 07:13:42,665 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-10-13 07:13:42,674 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2024-10-13 07:13:42,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2024-10-13 07:13:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 07:13:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 07:13:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-10-13 07:13:42,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-10-13 07:13:42,678 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2024-10-13 07:13:42,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2024-10-13 07:13:42,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 07:13:42,682 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2024-10-13 07:13:42,683 INFO L260 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-10-13 07:13:42,684 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2024-10-13 07:13:42,685 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2024-10-13 07:13:42,685 INFO L472 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-10-13 07:13:42,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:42,685 INFO L204 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-10-13 07:13:42,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 07:13:42,886 WARN L453 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-10-13 07:13:42,886 INFO L396 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-10-13 07:13:42,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash -694361008, now seen corresponding path program 1 times [2024-10-13 07:13:42,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:42,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241192299] [2024-10-13 07:13:42,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:42,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:43,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241192299] [2024-10-13 07:13:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241192299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:13:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700342325] [2024-10-13 07:13:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:43,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:13:43,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:13:43,647 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-10-13 07:13:43,648 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-10-13 07:13:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:43,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 07:13:43,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:13:43,806 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-10-13 07:13:44,048 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-10-13 07:13:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:44,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:13:45,179 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-10-13 07:13:45,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:13:45,212 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-10-13 07:13:46,000 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-10-13 07:13:46,035 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-13 07:13:46,036 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-10-13 07:13:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700342325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:13:46,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:13:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-10-13 07:13:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193951033] [2024-10-13 07:13:46,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:13:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 07:13:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:13:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 07:13:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2024-10-13 07:13:46,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-13 07:13:46,589 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-10-13 07:13:46,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:13:46,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-13 07:13:46,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:13:48,486 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2024-10-13 07:13:48,487 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2024-10-13 07:13:48,493 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-10-13 07:13:48,507 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2024-10-13 07:13:48,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2024-10-13 07:13:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 07:13:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-13 07:13:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2024-10-13 07:13:48,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2024-10-13 07:13:48,512 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2024-10-13 07:13:48,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2024-10-13 07:13:48,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 07:13:48,523 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2024-10-13 07:13:48,523 INFO L260 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-10-13 07:13:48,524 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-10-13 07:13:48,524 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2024-10-13 07:13:48,524 INFO L472 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-10-13 07:13:48,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:48,524 INFO L204 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-10-13 07:13:48,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 07:13:48,724 WARN L453 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-10-13 07:13:48,725 INFO L396 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-10-13 07:13:48,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2045165880, now seen corresponding path program 2 times [2024-10-13 07:13:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:48,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342040702] [2024-10-13 07:13:48,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:49,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:49,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342040702] [2024-10-13 07:13:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342040702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:13:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966410570] [2024-10-13 07:13:49,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 07:13:49,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:13:49,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:13:49,232 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-10-13 07:13:49,234 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-10-13 07:13:49,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 07:13:49,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:13:49,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 07:13:49,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:13:49,334 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-10-13 07:13:49,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 58 treesize of output 34 [2024-10-13 07:13:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:49,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:13:50,403 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-10-13 07:13:50,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:13:50,424 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-10-13 07:13:50,688 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-10-13 07:13:50,697 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-13 07:13:50,697 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-10-13 07:13:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:50,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966410570] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:13:50,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:13:50,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-10-13 07:13:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129031203] [2024-10-13 07:13:50,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:13:50,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 07:13:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:13:50,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 07:13:50,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-13 07:13:50,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-10-13 07:13:50,874 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-10-13 07:13:50,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:13:50,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-10-13 07:13:50,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:13:51,911 INFO L124 PetriNetUnfolderBase]: 1538/2445 cut-off events. [2024-10-13 07:13:51,912 INFO L125 PetriNetUnfolderBase]: For 3235/3238 co-relation queries the response was YES. [2024-10-13 07:13:51,918 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-10-13 07:13:51,932 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 49 changer transitions 1/181 dead transitions. [2024-10-13 07:13:51,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 181 transitions, 1211 flow [2024-10-13 07:13:51,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 07:13:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-13 07:13:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 242 transitions. [2024-10-13 07:13:51,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-10-13 07:13:51,935 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 15 states and 242 transitions. [2024-10-13 07:13:51,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 181 transitions, 1211 flow [2024-10-13 07:13:51,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 181 transitions, 1093 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-10-13 07:13:51,949 INFO L231 Difference]: Finished difference. Result has 76 places, 111 transitions, 679 flow [2024-10-13 07:13:51,949 INFO L260 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-10-13 07:13:51,951 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2024-10-13 07:13:51,951 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 111 transitions, 679 flow [2024-10-13 07:13:51,952 INFO L472 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-10-13 07:13:51,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:51,952 INFO L204 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-10-13 07:13:51,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 07:13:52,152 WARN L453 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-10-13 07:13:52,153 INFO L396 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-10-13 07:13:52,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -605205446, now seen corresponding path program 3 times [2024-10-13 07:13:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:52,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662603318] [2024-10-13 07:13:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:52,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662603318] [2024-10-13 07:13:52,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662603318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:13:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700548511] [2024-10-13 07:13:52,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 07:13:52,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:13:52,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:13:52,662 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-10-13 07:13:52,663 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-10-13 07:13:52,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 07:13:52,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:13:52,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 07:13:52,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:13:52,759 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-10-13 07:13:52,990 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-10-13 07:13:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:53,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:13:53,788 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-10-13 07:13:53,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:13:53,798 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-10-13 07:13:53,966 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-10-13 07:13:53,978 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 07:13:53,978 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-10-13 07:13:53,984 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-10-13 07:13:53,993 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 07:13:53,994 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-10-13 07:13:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:54,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700548511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:13:54,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:13:54,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-10-13 07:13:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565541568] [2024-10-13 07:13:54,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:13:54,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 07:13:54,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:13:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 07:13:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-10-13 07:13:54,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-13 07:13:54,168 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-10-13 07:13:54,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:13:54,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-13 07:13:54,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:13:55,712 INFO L124 PetriNetUnfolderBase]: 2837/4302 cut-off events. [2024-10-13 07:13:55,713 INFO L125 PetriNetUnfolderBase]: For 4931/4936 co-relation queries the response was YES. [2024-10-13 07:13:55,722 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-10-13 07:13:55,747 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 162 selfloop transitions, 89 changer transitions 2/257 dead transitions. [2024-10-13 07:13:55,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 257 transitions, 1757 flow [2024-10-13 07:13:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 07:13:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-13 07:13:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 292 transitions. [2024-10-13 07:13:55,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46570972886762363 [2024-10-13 07:13:55,751 INFO L175 Difference]: Start difference. First operand has 76 places, 111 transitions, 679 flow. Second operand 19 states and 292 transitions. [2024-10-13 07:13:55,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 257 transitions, 1757 flow [2024-10-13 07:13:55,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 257 transitions, 1720 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-13 07:13:55,775 INFO L231 Difference]: Finished difference. Result has 96 places, 156 transitions, 1222 flow [2024-10-13 07:13:55,777 INFO L260 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-10-13 07:13:55,778 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 61 predicate places. [2024-10-13 07:13:55,779 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 156 transitions, 1222 flow [2024-10-13 07:13:55,779 INFO L472 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-10-13 07:13:55,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:55,779 INFO L204 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-10-13 07:13:55,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 07:13:55,980 WARN L453 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-10-13 07:13:55,980 INFO L396 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-10-13 07:13:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1101888080, now seen corresponding path program 4 times [2024-10-13 07:13:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620937546] [2024-10-13 07:13:55,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:56,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:56,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620937546] [2024-10-13 07:13:56,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620937546] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:13:56,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473953109] [2024-10-13 07:13:56,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 07:13:56,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:13:56,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:13:56,476 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-10-13 07:13:56,476 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-10-13 07:13:56,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 07:13:56,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:13:56,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 07:13:56,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:13:56,561 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-10-13 07:13:56,707 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-10-13 07:13:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:56,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:13:57,450 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-10-13 07:13:57,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:13:57,461 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-10-13 07:13:57,590 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-10-13 07:13:57,598 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 07:13:57,599 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-10-13 07:13:57,604 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-10-13 07:13:57,611 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 07:13:57,611 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-10-13 07:13:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473953109] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:13:57,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:13:57,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2024-10-13 07:13:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478065026] [2024-10-13 07:13:57,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:13:57,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 07:13:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:13:57,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 07:13:57,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-10-13 07:13:57,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-13 07:13:57,778 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-10-13 07:13:57,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:13:57,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-13 07:13:57,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:13:59,236 INFO L124 PetriNetUnfolderBase]: 3261/4900 cut-off events. [2024-10-13 07:13:59,236 INFO L125 PetriNetUnfolderBase]: For 8628/8633 co-relation queries the response was YES. [2024-10-13 07:13:59,245 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-10-13 07:13:59,264 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 140 selfloop transitions, 140 changer transitions 1/285 dead transitions. [2024-10-13 07:13:59,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 285 transitions, 2273 flow [2024-10-13 07:13:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 07:13:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-13 07:13:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 320 transitions. [2024-10-13 07:13:59,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46176046176046176 [2024-10-13 07:13:59,266 INFO L175 Difference]: Start difference. First operand has 96 places, 156 transitions, 1222 flow. Second operand 21 states and 320 transitions. [2024-10-13 07:13:59,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 285 transitions, 2273 flow [2024-10-13 07:13:59,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 285 transitions, 2224 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-10-13 07:13:59,296 INFO L231 Difference]: Finished difference. Result has 113 places, 180 transitions, 1697 flow [2024-10-13 07:13:59,296 INFO L260 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-10-13 07:13:59,297 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 78 predicate places. [2024-10-13 07:13:59,297 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 180 transitions, 1697 flow [2024-10-13 07:13:59,298 INFO L472 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-10-13 07:13:59,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:13:59,298 INFO L204 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-10-13 07:13:59,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 07:13:59,498 WARN L453 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-10-13 07:13:59,499 INFO L396 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-10-13 07:13:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:13:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1443003576, now seen corresponding path program 5 times [2024-10-13 07:13:59,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:13:59,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235373494] [2024-10-13 07:13:59,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:13:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:13:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:13:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:13:59,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:13:59,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235373494] [2024-10-13 07:13:59,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235373494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:13:59,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046067434] [2024-10-13 07:13:59,958 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 07:13:59,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:13:59,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:13:59,960 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-10-13 07:13:59,963 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-10-13 07:14:00,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-13 07:14:00,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:14:00,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 07:14:00,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:00,074 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-10-13 07:14:00,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:14:00,333 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-10-13 07:14:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:14:00,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:01,531 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-10-13 07:14:01,534 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-10-13 07:14:01,546 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-10-13 07:14:01,550 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-10-13 07:14:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:14:01,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046067434] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:01,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:01,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2024-10-13 07:14:01,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383838955] [2024-10-13 07:14:01,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:01,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-13 07:14:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:01,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 07:14:01,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2024-10-13 07:14:01,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-10-13 07:14:01,674 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-10-13 07:14:01,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:01,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-10-13 07:14:01,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:14:07,208 INFO L124 PetriNetUnfolderBase]: 6480/9263 cut-off events. [2024-10-13 07:14:07,209 INFO L125 PetriNetUnfolderBase]: For 21066/21071 co-relation queries the response was YES. [2024-10-13 07:14:07,232 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-10-13 07:14:07,277 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 288 selfloop transitions, 344 changer transitions 2/636 dead transitions. [2024-10-13 07:14:07,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 636 transitions, 5459 flow [2024-10-13 07:14:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-13 07:14:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-10-13 07:14:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 696 transitions. [2024-10-13 07:14:07,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41354723707664887 [2024-10-13 07:14:07,281 INFO L175 Difference]: Start difference. First operand has 113 places, 180 transitions, 1697 flow. Second operand 51 states and 696 transitions. [2024-10-13 07:14:07,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 636 transitions, 5459 flow [2024-10-13 07:14:07,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 636 transitions, 5241 flow, removed 82 selfloop flow, removed 10 redundant places. [2024-10-13 07:14:07,400 INFO L231 Difference]: Finished difference. Result has 175 places, 391 transitions, 4538 flow [2024-10-13 07:14:07,400 INFO L260 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-10-13 07:14:07,401 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 140 predicate places. [2024-10-13 07:14:07,401 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 391 transitions, 4538 flow [2024-10-13 07:14:07,401 INFO L472 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-10-13 07:14:07,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:14:07,402 INFO L204 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-10-13 07:14:07,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 07:14:07,602 WARN L453 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-10-13 07:14:07,603 INFO L396 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-10-13 07:14:07,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:14:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash 386528106, now seen corresponding path program 6 times [2024-10-13 07:14:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:14:07,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841358474] [2024-10-13 07:14:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:14:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:07,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:14:07,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841358474] [2024-10-13 07:14:07,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841358474] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:14:07,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797593372] [2024-10-13 07:14:07,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 07:14:07,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:14:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:14:07,711 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-10-13 07:14:07,712 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-10-13 07:14:07,794 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-10-13 07:14:07,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:14:07,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 07:14:07,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:07,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797593372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:07,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:07,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-10-13 07:14:07,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935670127] [2024-10-13 07:14:07,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:07,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 07:14:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 07:14:07,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-10-13 07:14:08,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-10-13 07:14:08,019 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-10-13 07:14:08,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:08,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-10-13 07:14:08,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:14:10,979 INFO L124 PetriNetUnfolderBase]: 12293/17498 cut-off events. [2024-10-13 07:14:10,980 INFO L125 PetriNetUnfolderBase]: For 110303/110303 co-relation queries the response was YES. [2024-10-13 07:14:11,048 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-10-13 07:14:11,133 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 828 selfloop transitions, 314 changer transitions 0/1143 dead transitions. [2024-10-13 07:14:11,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1143 transitions, 13914 flow [2024-10-13 07:14:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 07:14:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-13 07:14:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 460 transitions. [2024-10-13 07:14:11,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-10-13 07:14:11,136 INFO L175 Difference]: Start difference. First operand has 175 places, 391 transitions, 4538 flow. Second operand 32 states and 460 transitions. [2024-10-13 07:14:11,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1143 transitions, 13914 flow [2024-10-13 07:14:12,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1143 transitions, 12372 flow, removed 642 selfloop flow, removed 14 redundant places. [2024-10-13 07:14:12,404 INFO L231 Difference]: Finished difference. Result has 210 places, 639 transitions, 7371 flow [2024-10-13 07:14:12,404 INFO L260 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-10-13 07:14:12,405 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 175 predicate places. [2024-10-13 07:14:12,405 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 639 transitions, 7371 flow [2024-10-13 07:14:12,405 INFO L472 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-10-13 07:14:12,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:14:12,405 INFO L204 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-10-13 07:14:12,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 07:14:12,605 WARN L453 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-10-13 07:14:12,606 INFO L396 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-10-13 07:14:12,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:14:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash -820156864, now seen corresponding path program 1 times [2024-10-13 07:14:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:14:12,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087774830] [2024-10-13 07:14:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:14:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:12,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:14:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087774830] [2024-10-13 07:14:12,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087774830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:14:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899428382] [2024-10-13 07:14:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:12,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:14:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:14:12,707 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-10-13 07:14:12,709 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-10-13 07:14:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:12,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 07:14:12,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:12,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:12,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899428382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:12,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-13 07:14:12,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924611681] [2024-10-13 07:14:12,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:12,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 07:14:12,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 07:14:12,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 07:14:12,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-13 07:14:12,916 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-10-13 07:14:12,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:12,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-13 07:14:12,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:14:13,629 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-10-13 07:14:13,630 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-13 07:14:13,630 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 07:14:13,630 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-13 07:14:13,630 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-13 07:14:13,793 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-10-13 07:14:13,794 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-13 07:14:13,794 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 07:14:13,794 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-13 07:14:13,794 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-13 07:14:13,795 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 07:14:13,803 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-10-13 07:14:13,804 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-13 07:14:13,804 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-13 07:14:13,804 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-13 07:14:13,804 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 07:14:14,191 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-10-13 07:14:14,192 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-13 07:14:14,192 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-13 07:14:14,193 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-13 07:14:14,193 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 07:14:14,193 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 07:14:14,987 INFO L124 PetriNetUnfolderBase]: 7586/11686 cut-off events. [2024-10-13 07:14:14,988 INFO L125 PetriNetUnfolderBase]: For 126983/127524 co-relation queries the response was YES. [2024-10-13 07:14:15,035 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-10-13 07:14:15,099 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 675 selfloop transitions, 9 changer transitions 2/777 dead transitions. [2024-10-13 07:14:15,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 777 transitions, 10464 flow [2024-10-13 07:14:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 07:14:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 07:14:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-10-13 07:14:15,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-10-13 07:14:15,101 INFO L175 Difference]: Start difference. First operand has 210 places, 639 transitions, 7371 flow. Second operand 6 states and 98 transitions. [2024-10-13 07:14:15,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 777 transitions, 10464 flow [2024-10-13 07:14:16,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 777 transitions, 10359 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-10-13 07:14:16,087 INFO L231 Difference]: Finished difference. Result has 213 places, 536 transitions, 6111 flow [2024-10-13 07:14:16,087 INFO L260 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-10-13 07:14:16,088 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 178 predicate places. [2024-10-13 07:14:16,088 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 536 transitions, 6111 flow [2024-10-13 07:14:16,088 INFO L472 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-10-13 07:14:16,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:14:16,088 INFO L204 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-10-13 07:14:16,101 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-10-13 07:14:16,288 WARN L453 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-10-13 07:14:16,289 INFO L396 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-10-13 07:14:16,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:14:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1527978253, now seen corresponding path program 7 times [2024-10-13 07:14:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:14:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317895457] [2024-10-13 07:14:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:14:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:14:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317895457] [2024-10-13 07:14:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317895457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:14:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416904645] [2024-10-13 07:14:16,382 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 07:14:16,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:14:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:14:16,384 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-10-13 07:14:16,386 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-10-13 07:14:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:16,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 07:14:16,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:16,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 07:14:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416904645] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:16,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-13 07:14:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829062560] [2024-10-13 07:14:16,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 07:14:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 07:14:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-13 07:14:16,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-13 07:14:16,613 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-10-13 07:14:16,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:16,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-13 07:14:16,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:14:18,512 INFO L124 PetriNetUnfolderBase]: 6408/9928 cut-off events. [2024-10-13 07:14:18,512 INFO L125 PetriNetUnfolderBase]: For 115763/116074 co-relation queries the response was YES. [2024-10-13 07:14:18,555 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-10-13 07:14:18,601 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 413 selfloop transitions, 59 changer transitions 10/532 dead transitions. [2024-10-13 07:14:18,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 532 transitions, 6800 flow [2024-10-13 07:14:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:14:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 07:14:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-10-13 07:14:18,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2024-10-13 07:14:18,603 INFO L175 Difference]: Start difference. First operand has 213 places, 536 transitions, 6111 flow. Second operand 7 states and 115 transitions. [2024-10-13 07:14:18,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 532 transitions, 6800 flow [2024-10-13 07:14:19,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 532 transitions, 6717 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-10-13 07:14:19,224 INFO L231 Difference]: Finished difference. Result has 217 places, 472 transitions, 5434 flow [2024-10-13 07:14:19,224 INFO L260 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-10-13 07:14:19,225 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 182 predicate places. [2024-10-13 07:14:19,225 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 472 transitions, 5434 flow [2024-10-13 07:14:19,225 INFO L472 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-10-13 07:14:19,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:14:19,225 INFO L204 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-10-13 07:14:19,238 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-10-13 07:14:19,425 WARN L453 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-10-13 07:14:19,426 INFO L396 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-10-13 07:14:19,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:14:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2146383493, now seen corresponding path program 8 times [2024-10-13 07:14:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:14:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628220654] [2024-10-13 07:14:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:14:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:14:19,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:14:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628220654] [2024-10-13 07:14:19,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628220654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:14:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340443408] [2024-10-13 07:14:19,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 07:14:19,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:14:19,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:14:19,535 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-10-13 07:14:19,536 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-10-13 07:14:19,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 07:14:19,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:14:19,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 07:14:19,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:14:19,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:14:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340443408] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:19,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:19,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-13 07:14:19,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116907416] [2024-10-13 07:14:19,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:19,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 07:14:19,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:19,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 07:14:19,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-13 07:14:19,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-10-13 07:14:19,851 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-10-13 07:14:19,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:19,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-10-13 07:14:19,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:14:21,174 INFO L124 PetriNetUnfolderBase]: 4751/7325 cut-off events. [2024-10-13 07:14:21,174 INFO L125 PetriNetUnfolderBase]: For 84328/84665 co-relation queries the response was YES. [2024-10-13 07:14:21,212 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-10-13 07:14:21,246 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 272 selfloop transitions, 3 changer transitions 113/413 dead transitions. [2024-10-13 07:14:21,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 413 transitions, 5363 flow [2024-10-13 07:14:21,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:14:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 07:14:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-10-13 07:14:21,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-10-13 07:14:21,248 INFO L175 Difference]: Start difference. First operand has 217 places, 472 transitions, 5434 flow. Second operand 7 states and 110 transitions. [2024-10-13 07:14:21,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 413 transitions, 5363 flow [2024-10-13 07:14:21,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 413 transitions, 5088 flow, removed 92 selfloop flow, removed 12 redundant places. [2024-10-13 07:14:21,888 INFO L231 Difference]: Finished difference. Result has 206 places, 300 transitions, 2980 flow [2024-10-13 07:14:21,889 INFO L260 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-10-13 07:14:21,889 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 171 predicate places. [2024-10-13 07:14:21,889 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 300 transitions, 2980 flow [2024-10-13 07:14:21,890 INFO L472 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-10-13 07:14:21,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:14:21,890 INFO L204 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-10-13 07:14:21,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 07:14:22,090 WARN L453 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-10-13 07:14:22,091 INFO L396 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-10-13 07:14:22,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:14:22,091 INFO L85 PathProgramCache]: Analyzing trace with hash -161010821, now seen corresponding path program 9 times [2024-10-13 07:14:22,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:14:22,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677352016] [2024-10-13 07:14:22,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:14:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:14:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677352016] [2024-10-13 07:14:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677352016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:14:22,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180425982] [2024-10-13 07:14:22,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 07:14:22,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:14:22,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:14:22,223 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-10-13 07:14:22,224 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-10-13 07:14:22,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 07:14:22,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:14:22,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 07:14:22,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:22,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:22,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180425982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:22,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:22,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-13 07:14:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804793759] [2024-10-13 07:14:22,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:22,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 07:14:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 07:14:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-13 07:14:22,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-10-13 07:14:22,580 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-10-13 07:14:22,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:22,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-10-13 07:14:22,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:14:25,884 INFO L124 PetriNetUnfolderBase]: 13592/19281 cut-off events. [2024-10-13 07:14:25,885 INFO L125 PetriNetUnfolderBase]: For 189741/190399 co-relation queries the response was YES. [2024-10-13 07:14:25,970 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-10-13 07:14:26,065 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 905 selfloop transitions, 368 changer transitions 0/1297 dead transitions. [2024-10-13 07:14:26,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1297 transitions, 14588 flow [2024-10-13 07:14:26,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 07:14:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-10-13 07:14:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 573 transitions. [2024-10-13 07:14:26,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2024-10-13 07:14:26,068 INFO L175 Difference]: Start difference. First operand has 206 places, 300 transitions, 2980 flow. Second operand 37 states and 573 transitions. [2024-10-13 07:14:26,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1297 transitions, 14588 flow [2024-10-13 07:14:27,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1297 transitions, 13152 flow, removed 588 selfloop flow, removed 23 redundant places. [2024-10-13 07:14:27,572 INFO L231 Difference]: Finished difference. Result has 177 places, 591 transitions, 6541 flow [2024-10-13 07:14:27,572 INFO L260 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-10-13 07:14:27,572 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 142 predicate places. [2024-10-13 07:14:27,573 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 591 transitions, 6541 flow [2024-10-13 07:14:27,573 INFO L472 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-10-13 07:14:27,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:14:27,573 INFO L204 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-10-13 07:14:27,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 07:14:27,774 WARN L453 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-10-13 07:14:27,775 INFO L396 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-10-13 07:14:27,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:14:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1715871281, now seen corresponding path program 10 times [2024-10-13 07:14:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:14:27,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891649839] [2024-10-13 07:14:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:14:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:27,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:14:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891649839] [2024-10-13 07:14:27,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891649839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:14:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861316108] [2024-10-13 07:14:27,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 07:14:27,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:14:27,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:14:27,904 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-10-13 07:14:27,905 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-10-13 07:14:27,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 07:14:27,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:14:27,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 07:14:27,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:28,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861316108] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:28,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-10-13 07:14:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413212075] [2024-10-13 07:14:28,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 07:14:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 07:14:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-13 07:14:28,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-10-13 07:14:28,171 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-10-13 07:14:28,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:28,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-10-13 07:14:28,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:14:32,791 INFO L124 PetriNetUnfolderBase]: 17345/24341 cut-off events. [2024-10-13 07:14:32,791 INFO L125 PetriNetUnfolderBase]: For 240279/240279 co-relation queries the response was YES. [2024-10-13 07:14:32,942 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-10-13 07:14:33,067 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 697 selfloop transitions, 845 changer transitions 0/1543 dead transitions. [2024-10-13 07:14:33,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1543 transitions, 18131 flow [2024-10-13 07:14:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-13 07:14:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2024-10-13 07:14:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 578 transitions. [2024-10-13 07:14:33,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39807162534435264 [2024-10-13 07:14:33,069 INFO L175 Difference]: Start difference. First operand has 177 places, 591 transitions, 6541 flow. Second operand 44 states and 578 transitions. [2024-10-13 07:14:33,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 1543 transitions, 18131 flow [2024-10-13 07:14:36,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1543 transitions, 17608 flow, removed 258 selfloop flow, removed 4 redundant places. [2024-10-13 07:14:36,086 INFO L231 Difference]: Finished difference. Result has 228 places, 982 transitions, 13586 flow [2024-10-13 07:14:36,087 INFO L260 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-10-13 07:14:36,087 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 193 predicate places. [2024-10-13 07:14:36,087 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 982 transitions, 13586 flow [2024-10-13 07:14:36,087 INFO L472 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-10-13 07:14:36,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:14:36,088 INFO L204 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-10-13 07:14:36,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 07:14:36,288 WARN L453 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-10-13 07:14:36,288 INFO L396 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-10-13 07:14:36,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:14:36,289 INFO L85 PathProgramCache]: Analyzing trace with hash -489664485, now seen corresponding path program 11 times [2024-10-13 07:14:36,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:14:36,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813081629] [2024-10-13 07:14:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:14:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 07:14:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:14:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813081629] [2024-10-13 07:14:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813081629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:14:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213863315] [2024-10-13 07:14:36,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 07:14:36,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:14:36,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:14:36,426 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-10-13 07:14:36,427 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-10-13 07:14:36,505 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-13 07:14:36,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:14:36,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 07:14:36,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:36,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213863315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:36,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-10-13 07:14:36,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232842292] [2024-10-13 07:14:36,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:36,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 07:14:36,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:36,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 07:14:36,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-13 07:14:36,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-10-13 07:14:36,724 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-10-13 07:14:36,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:36,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-10-13 07:14:36,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 07:14:43,362 INFO L124 PetriNetUnfolderBase]: 19188/26950 cut-off events. [2024-10-13 07:14:43,362 INFO L125 PetriNetUnfolderBase]: For 326498/326498 co-relation queries the response was YES. [2024-10-13 07:14:43,839 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-10-13 07:14:44,001 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 1017 selfloop transitions, 1077 changer transitions 0/2095 dead transitions. [2024-10-13 07:14:44,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 2095 transitions, 26713 flow [2024-10-13 07:14:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 07:14:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-10-13 07:14:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 933 transitions. [2024-10-13 07:14:44,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39820742637644047 [2024-10-13 07:14:44,005 INFO L175 Difference]: Start difference. First operand has 228 places, 982 transitions, 13586 flow. Second operand 71 states and 933 transitions. [2024-10-13 07:14:44,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 2095 transitions, 26713 flow [2024-10-13 07:14:53,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 2095 transitions, 25012 flow, removed 477 selfloop flow, removed 7 redundant places. [2024-10-13 07:14:53,625 INFO L231 Difference]: Finished difference. Result has 306 places, 1230 transitions, 18638 flow [2024-10-13 07:14:53,626 INFO L260 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-10-13 07:14:53,626 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 271 predicate places. [2024-10-13 07:14:53,626 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 1230 transitions, 18638 flow [2024-10-13 07:14:53,627 INFO L472 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-10-13 07:14:53,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 07:14:53,627 INFO L204 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-10-13 07:14:53,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-13 07:14:53,827 WARN L453 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-10-13 07:14:53,827 INFO L396 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-10-13 07:14:53,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:14:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2110799999, now seen corresponding path program 12 times [2024-10-13 07:14:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:14:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232408251] [2024-10-13 07:14:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:14:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:14:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:14:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 07:14:53,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:14:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232408251] [2024-10-13 07:14:53,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232408251] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:14:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032398186] [2024-10-13 07:14:53,959 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 07:14:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:14:53,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:14:53,961 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-10-13 07:14:53,964 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-10-13 07:14:54,032 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-13 07:14:54,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:14:54,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 07:14:54,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:14:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:54,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:14:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:14:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032398186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:14:54,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:14:54,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-10-13 07:14:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124658394] [2024-10-13 07:14:54,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:14:54,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 07:14:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:14:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 07:14:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-13 07:14:54,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-10-13 07:14:54,235 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-10-13 07:14:54,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 07:14:54,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-10-13 07:14:54,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand